proposition: Lemma rel0_impl a b (Hab : rel0 a b) : from_cobase_eqrel a b.
proof: Proof. use Hab. clear Hab. intro H; simpl. destruct H as [f Hf]. generalize (toforallpaths _ _ _ (coconeInCommutes cc (pr1 a) (pr1 b) f) (pr2 a)). unfold compose, from_cobase; simpl; intro H. rewrite <- H. rewrite <- Hf. apply idpath. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Sets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Graphs.Coproducts UniMath.CategoryTheory.Limits.Graphs.Limits UniMath.CategoryTheory.Limits.Graphs.Pushouts UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.Limits.Coproducts UniMath.CategoryTheory.Limits.Coequalizers UniMath.CategoryTheory.Limits.Initial UniMath.CategoryTheory.Categories.HSET.Core UniMath.Combinatorics.FiniteSets UniMath.MoreFoundations.Subtypes