proposition: Lemma le_lt_trans : forall a b c, a <= b -> b < c -> a < c.
proof: Proof. apply Le_Lt_trans; eauto with schutte. Qed.
imports: Coq(Relations Classical Classical_sets) ZornsLemma(CountableTypes) hydras(Well_Orders Lub Countable)