Theorems · Theorem · combinatorics
Finset.Pi.cons_injective
∀ {α : Type u_1} {δ : α → Sort v} [inst : DecidableEq α] {a : α} {b : δ a} {s : Finset α},
a ∉ s → Function.Injective (Finset.Pi.cons s a b)- Defined in
- Mathlib.Data.Finset.Pi
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 57 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.valproof · cited by 438
- Multiset.consproof · cited by 313
- Finset.Pi.consstatement and proof · cited by 6
- Multiset.Pi.cons_injectiveproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Finset.prod_sumproof · cited by 3