Exact expanded PA statement
forall t m. (exists h. h + S t = m) -> exists h. h + S (t + t) = m + mStructural proof guide
Generated structural guide
The left position of an earlier pair lies below the doubled prefix.
Use the direct prerequisites lt_to_le, add_le_add_right, add_le_add_left, le_trans, add_succ_left as previously established PA formulas.
The proof proceeds by intermediate claims (4), equality transport (1).
Referenced ingredients
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Linked names are exact direct references. This Alpha-v16 checked-use theorem is independently kernel-checked when replayed; it is not a Stable theorem.
- 0001
intro t - 0002
intro m - 0003
intro htm - 0004
have htle : exists h. h + t = m - 0005
specialize lt_to_le t - 0006
specialize lt_to_le m - 0007
apply lt_to_le - 0008
exact htm - 0009
have hfirst : exists h. h + (S t + t) = m + t - 0010
specialize add_le_add_right (S t) - 0011
specialize add_le_add_right m - 0012
specialize add_le_add_right t - 0013
apply add_le_add_right - 0014
exact htm - 0015
have hsingle : S t + t = S (t + t) - 0016
specialize add_succ_left t - 0017
specialize add_succ_left t - 0018
exact add_succ_left - 0019
rewrite hsingle at hfirst - 0020
have hsecond : exists h. h + (m + t) = m + m - 0021
specialize add_le_add_left t - 0022
specialize add_le_add_left m - 0023
specialize add_le_add_left m - 0024
apply add_le_add_left - 0025
exact htle - 0026
specialize le_trans (S (t + t)) - 0027
specialize le_trans (m + t) - 0028
specialize le_trans (m + m) - 0029
apply le_trans - 0030
exact hfirst - 0031
exact hsecond