proposition: Remark R2 (m n:nat) : Ack m (Ack m n) <= Ack m.+1 n.+1.
proof: Proof. destruct (Ack_properties m) as [H1 [H2 H3]]. transitivity (Ack m (Ack m.+1 n)); auto. - apply Ack_mono_r. + apply H3; rewrite <- Ack_S_S; auto. Qed.
imports: Coq(Lia) Coq(Program.Wf Arith) hydras(ssrnat_extracts) Equations(Equations)