Theorems · Theorem · order theory
Set.exists_range_eq_graphOn_univ
∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {f : α → β × γ},
Function.Surjective (Prod.fst ∘ f) →
(∀ (g₁ g₂ : α), (f g₁).1 = (f g₂).1 → (f g₁).2 = (f g₂).2) → ∃ f', Set.range f = Set.graphOn f' Set.univVertical line test for functions.
Let f : α → β × γ be a function to a product. Assume that f is surjective on the first factor
and that the image of f intersects every "vertical line" {(b, c) | c : γ} at most once.
Then the image of f is the graph of some monoid homomorphism f' : β → γ.
- Defined in
- Mathlib.Data.Set.Prod
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.rangestatement · cited by 4,705
- Set.univstatement · cited by 3,945
- Set.extproof · cited by 2,266
- Set.graphOnstatement · cited by 32
Cited by4
Results whose statement or proof uses this declaration.
- AddMonoidHom.exists_mrange_eq_mgraphproof · cited by 4
- MonoidHom.exists_mrange_eq_mgraphproof · cited by 3
- Set.exists_eq_mgraphOn_univproof · cited by 0
- Set.exists_equiv_range_eq_graphOn_univproof · cited by 0