proposition: Lemma pair_le_nn a: a <= a.
proof: Proof. by rewrite /pair_le mulnC leqnn. 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)