Theorems · Theorem · order theory

Set.preimage_invFun_of_mem

∀ {α : Type u_1} {β : Type u_2} [n : Nonempty α] {f : α → β},
  Function.Injective f → ∀ {s : Set α}, Classical.choice n ∈ s → Function.invFun f ⁻¹' s = f '' s ∪ (Set.range f)ᶜ

Defined in

Mathlib.Data.Set.Function

Cited by

0 results in Mathlib

Foundations

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

Assumes

Nonempty