Theorems · Definition · combinatorics
Finset.shatterer
{α : Type u_1} → [DecidableEq α] → Finset (Finset α) → Finset (Finset α)The set family of sets that are shattered by 𝒜.
- Defined in
- Mathlib.Combinatorics.SetFamily.Shatter
- Cited by
- 11 results in Mathlib
- Foundations
- Depth 74 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
- Finset.filterproof · cited by 949
- Finset.biUnionproof · cited by 217
- Finset.powersetproof · cited by 93
- Finset.Shattersproof · cited by 19
Cited by12
Results whose statement or proof uses this declaration.
- Finset.vcDimproof · cited by 5
- Finset.mem_shattererstatement · cited by 5
- Finset.shatterer_monostatement · cited by 2
- Finset.shatterer_compress_subset_shattererstatement · cited by 1
- Finset.isLowerSet_shattererstatement · cited by 1
- Finset.shatterer_idemstatement · cited by 1
- Finset.shatters_shattererstatement and proof · cited by 1
- Finset.subset_shattererstatement · cited by 1
- Finset.Shatters.shattererstatement · cited by 0
- Finset.shatterer_eqstatement and proof · cited by 0
- Finset.card_shatterer_le_sum_vcDimstatement and proof · cited by 0
- Finset.card_le_card_shattererstatement and proof · cited by 0