proposition: Lemma fix_le : forall x : R, forall xn zn : Z, FIX x xn -> (zn <= xn)%Z -> FIX x zn.
proof: Proof. intros x xn zn (xf,(Hx1,Hx2)) H. exists xf. split. exact Hx1. apply Z.le_trans with (1 := H) (2 := Hx2). Qed.
imports: Coq(ZArith Reals) Flocq(Zaux Raux Defs Digits Float_prop Generic_fmt FIX FLX) Gappa_definitions Gappa_dyadic