proposition: Remark R1 : forall m n, Ack m.+1 n.+1 <= Ack (2 + m) n.
proof: Proof. intro; destruct n; simpl (2 + m). - rewrite Ack_S_0; left. - rewrite (Ack_S_S m.+1); generalize (R0 m n ); intro H; apply Ack_mono_r; auto. Qed.
imports: Coq(Lia) Coq(Program.Wf Arith) hydras(ssrnat_extracts) Equations(Equations)