Theorems · Theorem · order theory
Finpartition.part_mem
∀ {α : Type u_1} [inst : DecidableEq α] {s : Finset α} (P : Finpartition s) {a : α}, P.part a ∈ P.parts ↔ a ∈ s- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 63 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.
Cites5
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 · cited by 22
- Finpartition.existsUnique_memproof · cited by 3
Cited by5
Results whose statement or proof uses this declaration.
- Finpartition.part_eq_emptyproof · cited by 3
- Finpartition.mem_part_iff_part_eq_partproof · cited by 1
- SimpleGraph.IsTuranMaximal.card_partsproof · cited by 1
- Finpartition.part_surjOnproof · cited by 1
- Finpartition.part_subsetproof · cited by 0