Theorems · Theorem · combinatorics

Finset.map_insert

∀ {α : Type u_1} {β : Type u_2} [inst : DecidableEq α] [inst_1 : DecidableEq β] (f : α ↪ β) (a : α) (s : Finset α),
  Finset.map f (insert a s) = insert (f a) (Finset.map f s)

Defined in

Mathlib.Data.Finset.Image

Cited by

2 results in Mathlib

Foundations

Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

DecidableEqDecidableEq