fact: Definition finite_array a := snd (N.iter (Z.to_N (Uint63.to_Z (PArray.length a))) (fun '(i, b) => (Z.succ i, b && is_finite_SF (Prim2SF (get a (of_Z i))))) (0%Z, true)).
imports: Coq(PrimInt63 Sint63 Floats PArray) Coq(Bool List Reals Lia Lra) Flocq(Core PrimFloat BinarySingleNaN Operations)