proposition: Lemma simplify_cochain_step_idpath {u : nat} (x : forall n, X n) : @simplify_cochain_step (S u) u x (idpath _) = idpath _.
proof: Proof. reflexivity. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Sets UniMath.MoreFoundations.Univalence UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Categories.Type.Core UniMath.CategoryTheory.Limits.Graphs.Limits UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Chains.Cochains