intros r1 r2 p q H'; case H'.
intros H'0 H'1 H'2 H'3 H'4.
split; auto.
intros f H'5.
unfold FtoRradix in |- *; rewrite <- H'3; rewrite <- H'2; auto.
Qed.

Theorem ClosestMin :
forall (r : R) (min max : float),
isMin b radix r min ->
isMax b radix r max -> (2%nat * r <= min + max)%R -> Closest r min.