Theorems · Theorem · order theory
Finset.supIndep_univ_bool
∀ {α : Type u_1} [inst : Lattice α] [inst_1 : OrderBot α] (f : Bool → α),
Finset.univ.SupIndep f ↔ Disjoint (f false) (f true)- Defined in
- Mathlib.Order.SupIndep
- Cited by
- 0 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.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finset.univstatement · cited by 3,473
- Disjointstatement · cited by 2,201
- OrderBotstatement and proof · cited by 1,055
- Latticestatement and proof · cited by 916
- Finset.SupIndepstatement · cited by 52
- disjoint_commproof · cited by 49
- Finset.supIndep_pairproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.