Documentation

Mathlib.Algebra.Order.Ring.Synonym

Ring structure on the order type synonyms #

Transfer algebraic instances from R to Rแต’แตˆ and Lex R.

Order dual #

@[implicit_reducible]
@[implicit_reducible]
instance OrderDual.instNatCast {R : Type u_1} [h : NatCast R] :
@[implicit_reducible]
instance OrderDual.instIntCast {R : Type u_1} [h : IntCast R] :
@[implicit_reducible]
@[implicit_reducible]
instance OrderDual.instRing {R : Type u_1} [h : Ring R] :
@[implicit_reducible]
@[simp]
theorem toDual_natCast {R : Type u_1} [NatCast R] (n : โ„•) :
OrderDual.toDual โ†‘n = โ†‘n
@[simp]
theorem toDual_ofNat {R : Type u_1} [NatCast R] (n : โ„•) [n.AtLeastTwo] :
OrderDual.toDual (OfNat.ofNat n) = OfNat.ofNat n
@[simp]
theorem ofDual_natCast {R : Type u_1} [NatCast R] (n : โ„•) :
OrderDual.ofDual โ†‘n = โ†‘n
@[simp]
theorem ofDual_ofNat {R : Type u_1} [NatCast R] (n : โ„•) [n.AtLeastTwo] :
OrderDual.ofDual (OfNat.ofNat n) = OfNat.ofNat n
@[simp]
theorem toDual_intCast {R : Type u_1} [IntCast R] (n : โ„ค) :
OrderDual.toDual โ†‘n = โ†‘n
@[simp]
theorem ofDual_intCast {R : Type u_1} [IntCast R] (n : โ„ค) :
OrderDual.ofDual โ†‘n = โ†‘n

Lexicographical order #

@[implicit_reducible]
instance instDistribLex {R : Type u_1} [h : Distrib R] :
@[implicit_reducible]
@[implicit_reducible]
@[implicit_reducible]
instance instSemiringLex {R : Type u_1} [h : Semiring R] :
@[implicit_reducible]
instance instCommSemiringLex {R : Type u_1} [h : CommSemiring R] :
@[implicit_reducible]
instance instHasDistribNegLex {R : Type u_1} [Mul R] [h : HasDistribNeg R] :
@[implicit_reducible]
instance instNonUnitalRingLex {R : Type u_1} [h : NonUnitalRing R] :
@[implicit_reducible]
instance instNonAssocRingLex {R : Type u_1} [h : NonAssocRing R] :
@[implicit_reducible]
instance instRingLex {R : Type u_1} [h : Ring R] :
Ring (Lex R)
@[implicit_reducible]
@[implicit_reducible]
instance instCommRingLex {R : Type u_1} [h : CommRing R] :