proposition: Lemma path_object' (x y : object) : forall (Ha : x.(a) = y.(a)) (Hb : x.(b) = y.(b)), transport (fun X => morphism C (S X) _) Ha (transport (fun Y => morphism C _ (T Y)) Hb x.(f)) = y.(f) -> x = y.
proof: Proof. destruct x, y; simpl. intros; path_induction; reflexivity. Defined.
imports: Functor.Core InitialTerminalCategory.Core InitialTerminalCategory.Functors Category.Strict HoTT.Basics HoTT.Types