Theorems · Definition · order theory

RingHom.withTopMap

{R : Type u_2} →
  {S : Type u_3} →
    [inst : NonAssocSemiring R] →
      [inst_1 : PartialOrder R] →
        [inst_2 : CanonicallyOrderedAdd R] →
          [inst_3 : DecidableEq R] →
            [inst_4 : Nontrivial R] →
              [inst_5 : NonAssocSemiring S] →
                [inst_6 : PartialOrder S] →
                  [inst_7 : CanonicallyOrderedAdd S] →
                    [inst_8 : DecidableEq S] →
                      [inst_9 : Nontrivial S] → (f : R →+* S) → Function.Injective ⇑f → WithTop R →+* WithTop S

A version of WithTop.map for RingHoms.

Defined in

Mathlib.Algebra.Order.Ring.WithTop

Cited by

1 results in Mathlib

Foundations

Depth 24 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

NonAssocSemiringPartialOrderCanonicallyOrderedAddDecidableEqNontrivialNonAssocSemiringPartialOrderCanonicallyOrderedAddDecidableEqNontrivial