def graphOfMorphism {X : Type u_1} {Y : Type u_2} (f : X → Y) : Set (X × Y)

The graph of a function f : X → Y as the subset of X × Y of pairs (x, f x) (Lec 7, Def 18).

theorem graphOfMorphism_eq_range {X : Type u_1} {Y : Type u_2} (f : X → Y) : graphOfMorphism f = Set.range fun (x : X) => (x, f x)

The graph of f coincides with the range of x ↦ (x, f x).