proposition: Lemma add_near_g a b: pair_near a b -> good_pair (a+b).
proof: Proof. by move => /add_near_r /pair_near_good /andP []. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype order bigop ssralg) mathcomp(div ssrnum ssrint rat prime path binomial) mathcomp(tuple finset) gaia(fibm)