proposition: Lemma opp_is_inverse_in_precat {C : precategory} {a b : C} {f : a --> b} {g : b --> a} : @is_inverse_in_precat C a b f g -> @is_inverse_in_precat (opp_precat C) a b g f.
proof: Proof. intros H. use make_is_inverse_in_precat. - exact (is_inverse_in_precat1 H). - exact (is_inverse_in_precat2 H). Defined.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.FunctorCategory