(* ===== 2ND PART OF CS : CASE ~expf m x0 xb0 ============== *)
(* OK: *)

Lemma between_expf_B0_1:forall (m:fmap)(x:dart)(i:nat),
inv_hmap m -> succ m zero x ->
let x0 := cA m zero x in
let x_1:= cA_1 m one x in
let xb0:= bottom m zero x in
let p:= MF.Iter_upb m x_1 in
let z:= Iter (cF m) i x_1 in
~expf m x0 xb0 ->
(i < p)%nat ->
expf (B m zero x) x_1 z.