Theorems · Theorem · order theory
InitialSeg.antisymm_toFun
∀ {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} [inst : IsWellOrder β s] (f : InitialSeg r s)
(g : InitialSeg s r), ⇑(f.antisymm g) = ⇑f- Defined in
- Mathlib.Order.InitialSeg
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 30 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsWellOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- RelIsostatement · cited by 456
- IsWellOrderstatement and proof · cited by 171
- InitialSegstatement and proof · cited by 70
- InitialSeg.antisymmstatement · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.