Theorems · Theorem · combinatorics
Finset.Pi.cons_same
∀ {α : Type u_1} {δ : α → Sort v} [inst : DecidableEq α] (s : Finset α) (a : α) (b : δ a) (f : (a : α) → a ∈ s → δ a)
(h : a ∈ insert a s), Finset.Pi.cons s a b f a h = 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.
Cites3
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.Pi.consstatement · cited by 6
- Multiset.Pi.cons_sameproof · cited by 5
Cited by1
Results whose statement or proof uses this declaration.
- Finset.prod_sumproof · cited by 3