Theorems · Theorem
Function.Surjective.forall
∀ {α : Sort u_1} {β : Sort u_2} {f : α → β},
Function.Surjective f → ∀ {p : β → Prop}, (∀ (y : β), p y) ↔ ∀ (x : α), p (f x)- Defined in
- Mathlib.Logic.Function.Basic
- Cited by
- 214 results in Mathlib
- Foundations
- Depth 5 from the axioms, rests on 6 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by214
Results whose statement or proof uses this declaration.
- OrderIso.map_iInfproof · cited by 25
- OrderIso.map_iSupproof · cited by 25
- continuous_iff_isClosedproof · cited by 24
- Function.Surjective.injective_comp_rightproof · cited by 12
- Function.Surjective.forall₂proof · cited by 11
- CliffordAlgebra.left_inductionproof · cited by 8
- QuotientAddGroup.forall_mkproof · cited by 6
- regularSpace_TFAEproof · cited by 6
- Finset.image_univ_of_surjectiveproof · cited by 5
- AntilipschitzWith.tendsto_coboundedproof · cited by 5
- AddMonoidHom.exists_mrange_eq_mgraphproof · cited by 4
- Filter.frequently_iffproof · cited by 4
Showing the 200 most cited of 214.