Theorems · Theorem · order theory
Finset.SupIndep.pairwiseDisjoint
∀ {α : Type u_1} {ι : Type u_3} [inst : Lattice α] [inst_1 : OrderBot α] {s : Finset ι} {f : ι → α},
s.SupIndep f → (↑s).PairwiseDisjoint f- Defined in
- Mathlib.Order.SupIndep
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- SetLike.coestatement and proof · cited by 8,199
- OrderBotstatement and proof · cited by 1,055
- Latticestatement and proof · cited by 916
- Set.PairwiseDisjointstatement · cited by 275
- Finset.SupIndepstatement and proof · cited by 52
- Finset.sup_singletonproof · cited by 42
- Finset.singleton_subset_iffproof · cited by 38
- Finset.notMem_singletonproof · cited by 13
Cited by7
Results whose statement or proof uses this declaration.
- Finpartition.disjointproof · cited by 13
- Finpartition.sum_card_partsproof · cited by 5
- Finset.supIndep_iff_pairwiseDisjointproof · cited by 3
- MeasureTheory.IsSetSemiring.pairwiseDisjoint_disjointOfDiffUnionproof · cited by 2
- Finpartition.sum_combineproof · cited by 1
- MeasureTheory.IsSetSemiring.pairwiseDisjoint_disjointOfDiffproof · cited by 1
- Finpartition.isPartition_partsproof · cited by 0