Theorems · Theorem · order theory
Finpartition.part_eq_iff_mem
∀ {α : Type u_1} [inst : DecidableEq α] {s t : Finset α} (P : Finpartition s) {a : α},
t ∈ P.parts → (P.part a = t ↔ a ∈ t)- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 67 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.partstatement and proof · cited by 22
- Finpartition.leproof · cited by 15
- Finpartition.eq_of_mem_partsproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Finpartition.part_eq_of_memproof · cited by 3