proposition: Lemma close_arrow_apply : forall e (f g : A -> B), close e f g -> forall x, close e (f x) (g x).
proof: Proof. intros e f g E x;revert E;apply (Trunc_ind _);intros [d [d' [E1 E2]]]. rewrite E1;apply rounded_plus;trivial. Qed.
imports: HoTT.Classes.interfaces.abstract_algebra HoTT.Classes.interfaces.rationals HoTT.Classes.interfaces.orders HoTT.Classes.implementations.peano_naturals HoTT.Classes.implementations.natpair_integers HoTT.Classes.theory.groups HoTT.Classes.theory.integers HoTT.Classes.theory.dec_fields HoTT.Classes.orders.dec_fields HoTT.Classes.orders.sum HoTT.Classes.theory.rationals HoTT.Classes.orders.lattices HoTT.Classes.implementations.assume_rationals HoTT.Classes.tactics.ring_quote HoTT.Classes.tactics.ring_tac