Theorems · Theorem · combinatorics

Multiset.Pi.cons_eta

∀ {α : Type u_1} [inst : DecidableEq α] {δ : α → Sort u_2} {m : Multiset α} {a : α}
  (f : (a' : α) → a' ∈ a ::ₘ m → δ a'), (Multiset.Pi.cons m a (f a ⋯) fun a' ha' => f a' ⋯) = f

Defined in

Mathlib.Data.Multiset.Pi

Cited by

2 results in Mathlib

Foundations

Depth 19 from the axioms · uses propext, Quot.sound

Assumes

DecidableEq