proposition: Lemma demo_false_1 : forall (n:nat), (forall m, m = n -> False) -> H1.
proof: Proof. Proof using. intros n P. dup 5. { false. eapply P. reflexivity. } { false (P n (refl_equal n)). } { false P. reflexivity. } { false*. } { lets: (P n). false. } Qed.
imports: TLC(LibTactics) Coq.micromega.Lia