proposition: Lemma Qclose_alt : forall e (q r : Q), close e q r <-> abs (q - r) < ' e.
proof: Proof. intros e q r;split. - intros [E1 E2]. destruct (total le 0 (q - r)) as [E|E]. + rewrite (Qabs_of_nonneg _ E). trivial. + rewrite (Qabs_of_nonpos _ E). apply flip_lt_negate. rewrite involutive. trivial. - intros E. split;[apply flip_lt_negate;rewrite involutive|]; apply le_lt_trans with (abs (q - r));trivial. + apply Qabs_le_neg_raw. + apply Qabs_le_raw. 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