Theorems · Theorem · combinatorics

Finset.map_disjUnion

∀ {α : Type u_1} {β : Type u_2} {f : α ↪ β} (s₁ s₂ : Finset α) (h : Disjoint s₁ s₂)
  (h' : optParam (Disjoint (Finset.map f s₁) (Finset.map f s₂)) ⋯),
  Finset.map f (s₁.disjUnion s₂ h) = (Finset.map f s₁).disjUnion (Finset.map f s₂) h'

Defined in

Mathlib.Data.Finset.Image

Cited by

1 results in Mathlib

Foundations

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