proposition: Lemma natgehgthtrans (n m k : nat) : n ≥ m -> m > k -> n > k.
proof: Proof. intros gnm gmk. induction (natgehchoice n m gnm) as [ g' | e ]. - apply (istransnatgth _ _ _ g' gmk). - rewrite e. apply gmk. Defined.
imports: UniMath.Foundations.Sets