Theorems · Theorem · combinatorics

Finset.map_union

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

Defined in

Mathlib.Data.Finset.Image

Cited by

2 results in Mathlib

Foundations

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

Assumes

DecidableEqDecidableEq