Theorems · Theorem · combinatorics

Finset.mem_pimage

∀ {α : Type u_1} {β : Type u_2} [inst : DecidableEq β] {f : α →. β} [inst_1 : (x : α) → Decidable (f x).Dom]
  {s : Finset α} {b : β}, b ∈ Finset.pimage f s ↔ ∃ a ∈ s, b ∈ f a

Defined in

Mathlib.Data.Finset.PImage

Cited by

2 results in Mathlib

Foundations

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

Assumes

DecidableEqDecidable