Theorems · Theorem · combinatorics
Setoid.IsPartition.ncard_eq_finsum
∀ {α : Type u_1} {P : Set (Set α)},
Setoid.IsPartition P →
∀ (s : Set α), autoParam s.Finite Setoid.IsPartition.ncard_eq_finsum._auto_1 → s.ncard = ∑ᶠ (t : ↑P), (s ∩ ↑t).ncardGiven a partition of the ambient type, the cardinal of a finite set
is the finsum of the cardinalities of its traces on the parts of the partition
- Defined in
- Mathlib.Data.Setoid.Partition.Card
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites30
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SetLike.coeproof · cited by 8,199
- Set.Elemstatement and proof · cited by 7,166
- Finset.sumproof · cited by 5,195
- Finiteproof · cited by 3,029
- Finset.cardproof · cited by 2,327
- Finset.sum_congrproof · cited by 2,323
- Set.Finitestatement and proof · cited by 1,814
- Nat.cardproof · cited by 844
- Function.supportproof · cited by 610
- Subtype.propproof · cited by 505
- Set.Finite.toFinsetproof · cited by 351
Cited by2
Results whose statement or proof uses this declaration.
- MulAction.IsPreprimitive.of_card_ltproof · cited by 1
- AddAction.IsPreprimitive.of_card_ltproof · cited by 0