Theorems · Theorem · order theory
iSupIndep_comp_coe_iff_supIndep
∀ {α : Type u_1} {ι : Type u_3} [inst : CompleteLattice α] {s : Finset ι} {f : ι → α},
iSupIndep (f ∘ Subtype.val) ↔ s.SupIndep f- Defined in
- Mathlib.Order.SupIndep
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- PartialOrderproof · cited by 6,410
- iSupproof · cited by 2,415
- Disjointproof · cited by 2,201
- OrderBotproof · cited by 1,055
- CompleteLatticestatement and proof · cited by 1,048
- Finset.eraseproof · cited by 455
- iSup_congr_Propproof · cited by 247
- SupSetproof · cited by 154
- iSupIndepstatement and proof · cited by 100
- Finset.SupIndepstatement · cited by 52
- Finset.sup_eq_iSupproof · cited by 30
Cited by3
Results whose statement or proof uses this declaration.
- Submodule.torsionBySet_isInternalproof · cited by 2
- iSupIndep.supIndepproof · cited by 1
- Finset.SupIndep.independentproof · cited by 0