Theorems · Definition · order theory
Finpartition.atomise
{α : Type u_1} → [inst : DecidableEq α] → (s : Finset α) → Finset (Finset α) → Finpartition sCuts s along the finsets in F: Two elements of s will be in the same part if they are
in the same finsets of F.
- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 77 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
- Finset.filterproof · cited by 949
- Finset.imageproof · cited by 910
- Finpartitionstatement · cited by 199
- Finset.powersetproof · cited by 93
- Finpartition.ofEraseproof · cited by 3
Cited by7
Results whose statement or proof uses this declaration.
- SzemerediRegularity.card_chunkproof · cited by 2
- SzemerediRegularity.card_incrementproof · cited by 2
- Finpartition.mem_atomisestatement · cited by 1
- Finpartition.card_filter_atomise_le_two_powstatement and proof · cited by 0
- Finpartition.atomise_emptystatement · cited by 0
- Finpartition.biUnion_filter_atomisestatement and proof · cited by 0
- Finpartition.card_atomise_lestatement · cited by 0