Theorems · Theorem · order theory
Finpartition.eq_of_mem_parts
∀ {α : Type u_1} [inst : DecidableEq α] {s t u : Finset α} (P : Finpartition s) {a : α},
t ∈ P.parts → u ∈ P.parts → a ∈ t → a ∈ u → t = u- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- Finpartitionstatement and proof · cited by 199
- Finpartition.partsstatement and proof · cited by 184
- Finpartition.disjointproof · cited by 13
- Set.PairwiseDisjoint.elimproof · cited by 12
- Finset.not_disjoint_iffproof · cited by 6
Cited by2
Results whose statement or proof uses this declaration.
- Finpartition.existsUnique_memproof · cited by 3
- Finpartition.part_eq_iff_memproof · cited by 1