Mathlib Map

Theorems · Theorem · combinatorics

Set.powersetCard.ncard_eq

∀ {α : Type u_1} {n : ℕ} (s : ↑(Set.powersetCard α n)), (↑s).ncard = n
Defined in
Mathlib.Data.Set.PowersetCard
Cited by
2 results in Mathlib
Foundations
Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Set.powersetCard.isPreprimitive_alternatingGroup · cited by 2powersetCard.isPreprimiti…Set.powersetCard.isPreprimitive_perm · cited by 1powersetCard.isPreprimiti…Set · cited by 53352SetFinset · cited by 13712FinsetSetLike.coe · cited by 8199SetLike.coeSet.Elem · cited by 7166Set.ElemSubtype.prop · cited by 505Subtype.propSet.ncard · cited by 344Set.ncardSet.powersetCard · cited by 100Set.powersetCardSet.ncard_coe_finset · cited by 15Set.ncard_coe_finsetSet.powersetCard.coe_coe · cited by 3powersetCard.coe_coepowersetCard.ncard_eqCITED BYCITES

Cites9

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.