Hypothesis (Hnb_steps : (1 < nb_steps)%Z).

Theorem inbetween_step_Lo_Mi_Eq_odd :
forall x k,
inbetween (start + Z2R k * step) (start + Z2R (k + 1) * step) x loc_Exact ->
(2 * k + 1 = nb_steps)%Z ->
inbetween start (start + Z2R nb_steps * step) x (loc_Inexact Lt).