fact: Definition ℤBiRecursion_transition_inv_reversed (P : ℤ → Type) (f : ∏ z : ℤ, P z ≃ P (1 + z)) (p : P 0) (z : ℤ) : pr1 (invmap (ℤBiRecursion_weq f) p) z = invmap (f z) (pr1 (invmap (ℤBiRecursion_weq f) p) (1 + z)) := !homotinvweqweq _ _ @ maponpaths (invmap (f z)) (! ℤBiRecursion_transition_inv f p z).
imports: UniMath.Foundations.All UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.NullHomotopies UniMath.MoreFoundations.Univalence UniMath.MoreFoundations.MoreEquivalences UniMath.MoreFoundations.Notations UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Nat UniMath.Algebra.Monoids UniMath.Algebra.Groups UniMath.Algebra.GroupAction UniMath.NumberSystems.Integers