lean_workbook_plus_28710
ProvedLet and be sets and be a function from to . For every subset , define . Show that if and only if is onto. This has to be taken with a universal quantifier for all .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_28710 (P Q : Type) (f : P → Q) (h : ∀ B : Set Q, f '' (f ⁻¹' B) = B) : ∀ y : Q, ∃ x : P, f x = y := by sorry
Source