Theorems · Theorem · combinatorics

Finset.map_erase

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

Defined in

Mathlib.Data.Finset.Image

Cited by

5 results in Mathlib

Foundations

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

Assumes

DecidableEqDecidableEq