proposition: Lemma demo_asserts_and_cuts_rewrite : forall n, 0 < n < 2 -> P1 1 -> P1 n.
proof: Proof. Proof using. introv Lt H. dup 2. asserts_rewrite (n = 1). demo. demo. cuts_rewrite (n = 1). demo. demo. Qed.
imports: TLC(LibTactics) Coq.micromega.Lia