proposition: Theorem round_round_mult_beta_odd_FLX : forall choice1 choice2, (prec <= prec')%Z -> forall x y, FLX_format beta prec x -> FLX_format beta prec y -> round_round_eq beta (FLX_exp prec) (FLX_exp prec') choice1 choice2 (x * y).
proof: Proof. intros choice1 choice2 Hprec x y Fx Fy. apply round_round_mult_beta_odd. - now apply FLX_exp_valid. - now apply FLX_exp_valid. - intro ex; unfold FLX_exp; lia. - now apply generic_format_FLX. - now apply generic_format_FLX. Qed.
imports: Coq(ZArith Reals Psatz) Flocq(Core FTZ Double_rounding)