Mathlib Map

Theorems · Theorem · combinatorics

Finset.card_sigmaLift

∀ {ι : Type u_1} {α : ι → Type u_2} {β : ι → Type u_3} {γ : ι → Type u_4} [inst : DecidableEq ι]
  (f : ⦃i : ι⦄ → α i → β i → Finset (γ i)) (a : (i : ι) × α i) (b : (i : ι) × β i),
  (Finset.sigmaLift f a b).card = if h : a.fst = b.fst then (f (h ▸ a.snd) b.snd).card else 0
Defined in
Mathlib.Data.Finset.Sigma
Cited by
4 results in Mathlib
Foundations
Depth 28 from the axioms · uses propext, Quot.sound
Assumes
DecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Sigma.card_Ico · cited by 0Sigma.card_IcoSigma.card_Ioc · cited by 0Sigma.card_IocSigma.card_Ioo · cited by 0Sigma.card_IooSigma.card_Icc · cited by 0Sigma.card_IccFinset · cited by 13712FinsetFinset.card · cited by 2327Finset.cardFinset.card_map · cited by 114Finset.card_mapFunction.Embedding.sigmaMk · cited by 25Embedding.sigmaMkFinset.sigmaLift · cited by 8Finset.sigmaLiftFinset.card_sigmaLiftCITED BYCITES

Cites5

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

Cited by4

Results whose statement or proof uses this declaration.