proposition: Lemma strong' : forall n m, m <= n -> P m.
proof: Proof. induction n; simpl; intuition; apply PH; intuition. exfalso; lia. Qed.
imports: Coq.Classes.Morphisms Coq.Classes.Morphisms_Prop Coq.Bool.Bool Coq.Arith.Arith Coq.micromega.Lia Coq.NArith.NArith Coq.ZArith.ZArith bbv.N_Z_nat_conversions bbv.Nomega