proposition: Lemma transportf_paths_FlFr {A B : UU} {f g : A -> B} {x1 x2 : A} (p : x1 = x2) (q : f x1 = g x1) : transportf (λ x, f x = g x) p q = !maponpaths f p @ q @ maponpaths g p.
proof: Proof. induction p. cbn. apply pathsinv0. apply pathscomp0rid. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.Tactics