fact: Definition first_in_holed_interval (u : nat -> R) (v : R -> nat) (a b h : R) : enumeration R u v -> Rlt a b -> { n : nat | in_holed_interval a b h u n /\ forall k : nat, in_holed_interval a b h u k -> n <= k }.
imports: Coq.Reals.Rdefinitions Coq.Reals.Raxioms Rfunctions Coq.Reals.RIneq Coq.Logic.FinFun Coq.Logic.ConstructiveEpsilon