Mathlib Map

Theorems · Theorem · combinatorics

Set.toFinset_image2

∀ {α : Type u_1} {β : Type u_3} {γ : Type u_5} [inst : DecidableEq γ] (f : α → β → γ) (s : Set α) (t : Set β)
  [inst_1 : Fintype ↑s] [inst_2 : Fintype ↑t] [inst_3 : Fintype ↑(Set.image2 f s t)],
  (Set.image2 f s t).toFinset = Finset.image₂ f s.toFinset t.toFinset
Defined in
Mathlib.Data.Finset.NAry
Cited by
5 results in Mathlib
Foundations
Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEqFintypeFintypeFintype

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites10

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by5

Results whose statement or proof uses this declaration.