Theorems · Theorem · order theory

LinearOrderedCommGroupWithZero.inr_apply

∀ (α : Type u_1) (β : Type u_2) [inst : LinearOrderedCommGroupWithZero α] [inst_1 : LinearOrderedCommGroupWithZero β]
  (a : β),
  (LinearOrderedCommGroupWithZero.inr α β) a =
    (WithZero.map' ↑(toLexMulEquiv (αˣ × βˣ))) ((MonoidWithZeroHom.inr α β) a)

Defined in: Mathlib.Algebra.Order.GroupWithZero.Lex
Cited by: 1 results in Mathlib
Foundations: Depth 28 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: LinearOrderedCommGroupWithZero LinearOrderedCommGroupWithZero

Mathlib docs Source Loogle LeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites13

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

DFunLike.coestatement and proof · cited by 62,936
Unitsstatement · cited by 2,804
MulEquivstatement · cited by 1,142
MonoidWithZeroHomstatement · cited by 704
WithZerostatement · cited by 586
LinearOrderedCommGroupWithZerostatement and proof · cited by 528
Lexstatement · cited by 370
MonoidHomClass.toMonoidHomstatement · cited by 294
OrderMonoidWithZeroHomstatement · cited by 48
WithZero.map'statement · cited by 45
MonoidWithZeroHom.inrstatement · cited by 12
toLexMulEquivstatement · cited by 9

Cited by1

Results whose statement or proof uses this declaration.

LinearOrderedCommGroupWithZero.inr_eq_coe_inrₗproof · cited by 1