English
Mapping of a composite equals the composition of mappings in reverse order: map(f ≫ g) = map(g) ∘ map(f).
Русский
Отображение композиции равно композиции отображений в обратном порядке: map(f ≫ g) = map(g) ∘ map(f).
LaTeX
$$map(f ≫ g) = (map g) \\circ (map f)$$
Lean4
/-- Mapping by the composite morphism `f ≫ g` is the same as mapping by `f` then by `g`. -/
theorem mapComp_eq {X Y Z : T} (f : X ⟶ Y) (g : Y ⟶ Z) : map (f ≫ g) = (map g) ⋙ (map f) :=
by
fapply Functor.ext
· simp [Under.map, Comma.mapLeft]
· intro U V k
ext
simp