Theorems · Theorem · order theory
disjointed_eq_self
∀ {α : Type u_1} {ι : Type u_2} [inst : GeneralizedBooleanAlgebra α] [inst_1 : Preorder ι]
[inst_2 : LocallyFiniteOrderBot ι] {f : ι → α} {i : ι}, (∀ j < i, Disjoint (f j) (f i)) → disjointed f i = f i- Defined in
- Mathlib.Order.Disjointed
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- Bot.botproof · cited by 4,720
- Disjointstatement and proof · cited by 2,201
- LocallyFiniteOrderBotstatement and proof · cited by 286
- GeneralizedBooleanAlgebrastatement and proof · cited by 204
- Finset.Iioproof · cited by 147
- Disjoint.symmproof · cited by 125
- disjoint_iffproof · cited by 76
- disjointedstatement · cited by 64
- Finset.mem_Iioproof · cited by 20
- sdiff_eq_leftproof · cited by 15
- Finset.sup_congrproof · cited by 9
Cited by1
Results whose statement or proof uses this declaration.
- disjointed_uniqueproof · cited by 1