proposition: Lemma inverse_is_inverse_2 a b (g : F a --> F b) : #F (inverse g) = g.
proof: Proof. unfold inverse. repeat rewrite functor_comp. rewrite functor_on_inv_from_z_iso. simpl. rewrite triangle_id_inverse'. rewrite <- assoc. set (H' := nat_trans_ax (adjcounit (pr1 H))). simpl in H'; rewrite H'; clear H'. rewrite assoc. set (H' := pathsinv0 (triangle_id_left_ad (pr2 (pr1 H)) a)). match goal with [|- ?f · ?g = ?h] => assert (H'' : identity _ = f) end. - simpl in *; apply H'. - rewrite <- H''. rewrite id_left. apply idpath. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Equivalences.Core