proposition: Lemma lt_trans : forall a b c : Ord, a < b -> b < c -> a < c.
proof: Proof. intros; eapply Lt_trans; eauto with schutte. Qed.
imports: Coq(Relations Classical Classical_sets) ZornsLemma(CountableTypes) hydras(Well_Orders Lub Countable)