proposition: Lemma pair_le_bad a: (a <= NaN) && (NaN <= a).
proof: Proof. by rewrite /pair_le /= !muln0 !mul0n. 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)