Mathlib Map

Theorems · Theorem · combinatorics

Finset.insert_val_of_notMem

∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Finset α}, a ∉ s → (insert a s).val = a ::ₘ s.val
Defined in
Mathlib.Data.Finset.Insert
Cited by
3 results in Mathlib
Foundations
Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Finset.pi_insert · cited by 1Finset.pi_insertMultiset.Ioo_cons_left · cited by 0Multiset.Ioo_cons_leftMultiset.Ico_cons_right · cited by 0Multiset.Ico_cons_rightFinset · cited by 13712FinsetMultiset · cited by 2627MultisetFinset.val · cited by 438Finset.valMultiset.cons · cited by 313Multiset.consMultiset.ndinsert_of_notMem · cited by 8Multiset.ndinsert_of_notM…Finset.insert_val · cited by 2Finset.insert_valFinset.insert_val_of_notMemCITED BYCITES

Cites6

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

Cited by3

Results whose statement or proof uses this declaration.