Exact expanded PA statement
forall a b n. (b + a) + n = n -> a + n = nStructural proof guide
A fixed-point equation remains fixed after dropping an additive prefix.
Direct prerequisites: zero_add, add_succ_left, no_succ_add_fixed. The authored body proceeds by structural induction (1), equality transport (2).
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
intro a - 0002
induction b - 0003
intro n - 0004
intro h - 0005
specialize zero_add a - 0006
rewrite zero_add at h - 0007
exact h - 0008
intro n - 0009
intro h - 0010
exfalso - 0011
specialize no_succ_add_fixed (b + a) - 0012
specialize no_succ_add_fixed n - 0013
apply no_succ_add_fixed - 0014
specialize add_succ_left b - 0015
specialize add_succ_left a - 0016
rewrite add_succ_left at h - 0017
exact h