proposition: Lemma demo_admit : forall n m p : nat, n > m -> m >= p -> n > p.
proof: Proof. Proof using. intros. dup 6. admits R1: (m = m). demo. admits (R1&R2): (m = m /\ n > m+1). demo. admits (q&Q): (exists q, q > p). demo. admits: (m <> n). demo. admit_rewrite (m = n) in H0. demo. dup. induction p. demo. demo. admit_goal IH. destruct p. demo. demo. Qed.
imports: TLC(LibTactics) Coq.micromega.Lia