proposition: Lemma le_lt_trans {A:Type}{le:relation A}{P:PreOrder le}: forall a b c, le a b -> lt b c -> lt a c.
proof: Proof. intros a b c Hab [Hbc H'bc]; split. - now transitivity b. - intro H; destruct H'bc; now transitivity a. Qed.