Exact expanded PA statement
forall r m a b. (exists k. k + S r = m) -> ~(r = (a + m) + b)Structural proof guide
A strict upper bound prevents the lower term from containing that bound as an additive middle block.
Direct prerequisites: add_succ_left. The authored body proceeds by structural induction (1), case analysis (1), intermediate claims (1), equality transport (7).
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are hypotheses of this body receipt. The focused endpoint audits separately check the complete empty-context certificates.
- 0001
have hbad : forall z a w b. ~(z = (a + (w + S z)) + b) - 0002
intro z - 0003
induction z - 0004
intro a - 0005
intro w - 0006
intro b - 0007
intro hz - 0008
apply PA1 - 0009
symm - 0010
rewrite PA4 at hz - 0011
rewrite PA4 at hz - 0012
specialize add_succ_left (a + (w + 0)) - 0013
specialize add_succ_left b - 0014
rewrite add_succ_left at hz - 0015
exact hz - 0016
intro a - 0017
intro w - 0018
intro b - 0019
intro hz - 0020
specialize IH a - 0021
specialize IH w - 0022
specialize IH b - 0023
apply IH - 0024
apply PA2 - 0025
rewrite PA4 at hz - 0026
rewrite PA4 at hz - 0027
specialize add_succ_left (a + (w + S z)) - 0028
specialize add_succ_left b - 0029
rewrite add_succ_left at hz - 0030
exact hz - 0031
intro r - 0032
intro m - 0033
intro a - 0034
intro b - 0035
intro hr - 0036
intro heq - 0037
cases hr - 0038
specialize hbad r - 0039
specialize hbad a - 0040
specialize hbad x - 0041
specialize hbad b - 0042
apply hbad - 0043
rewrite <- hr_witness at heq - 0044
exact heq