Exact expanded PA statement
forall n. (exists bcf_lt_gap_b5rbtdls_positive. bcf_lt_gap_b5rbtdls_positive + S (2) = n) -> (exists bcf_le_gap_b5rbtdls_result. bcf_le_gap_b5rbtdls_result + (3 + 3) = n + n)Structural proof guide
A natural above two has double at least three plus three.
Direct prerequisites: add_le_add_right, add_le_add_left, le_trans. The authored body proceeds by intermediate claims (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 n - 0002
intro hpositive - 0003
have hleft : exists bcf_le_gap_b5rbtdls_left. bcf_le_gap_b5rbtdls_left + (3 + 3) = n + 3 - 0004
specialize add_le_add_right 3 - 0005
specialize add_le_add_right n - 0006
specialize add_le_add_right 3 - 0007
apply add_le_add_right - 0008
exact hpositive - 0009
have hright : exists bcf_le_gap_b5rbtdls_right. bcf_le_gap_b5rbtdls_right + (n + 3) = n + n - 0010
specialize add_le_add_left 3 - 0011
specialize add_le_add_left n - 0012
specialize add_le_add_left n - 0013
apply add_le_add_left - 0014
exact hpositive - 0015
specialize le_trans (3 + 3) - 0016
specialize le_trans (n + 3) - 0017
specialize le_trans (n + n) - 0018
apply le_trans - 0019
exact hleft - 0020
exact hright