proposition: Lemma plus_elim (alpha : Ord) : forall P : (Ord->Ord)->Prop, (forall f: Ord->Ord, ordering_function f ordinal (ge alpha)-> P f) -> P (plus alpha).
proof: Proof. intros P H0; now apply H0, plus_ordering. Qed.
imports: Coq(Arith Logic.Epsilon Ensembles) ZornsLemma(CountableTypes)