Theorems · Theorem · order theory
sSupIndep_iff
∀ {α : Type u_5} [inst : CompleteLattice α] (s : Set α), sSupIndep s ↔ iSupIndep Subtype.val- Defined in
- Mathlib.Order.SupIndep
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses propext, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- iSupproof · cited by 2,415
- Disjointproof · cited by 2,201
- CompleteLatticestatement and proof · cited by 1,048
- SupSet.sSupproof · cited by 954
- iSup_congr_Propproof · cited by 247
- iSupIndepstatement · cited by 100
- sSup_eq_iSupproof · cited by 42
- sSupIndepstatement · cited by 39
- iSup_subtypeproof · cited by 26
- iSup_andproof · cited by 13
Cited by3
Results whose statement or proof uses this declaration.
- IsSemisimpleModule.exists_linearEquiv_dfinsuppproof · cited by 3
- iSupIndep.sSupIndep_rangeproof · cited by 2
- IsSemisimpleModule.exists_linearEquiv_fin_dfinsuppproof · cited by 1