Theorems · Theorem · combinatorics

Finset.prodMap_map_product

∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (f : α ↪ β) (g : γ ↪ δ) (s : Finset α) (t : Finset γ),
  Finset.map (f.prodMap g) (s ×ˢ t) = Finset.map f s ×ˢ Finset.map g t

Defined in

Mathlib.Data.Finset.Prod

Cited by

0 results in Mathlib

Foundations

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