Exact expanded PA statement
forall n p. (exists bpr_gap_bbp02_boundary_lower. bpr_gap_bbp02_boundary_lower + S (1) = n) -> ((~(p = 1) /\ forall bpr_left_bbp02_boundary_prime bpr_right_bbp02_boundary_prime. p = bpr_left_bbp02_boundary_prime * bpr_right_bbp02_boundary_prime -> bpr_left_bbp02_boundary_prime = 1 \/ bpr_right_bbp02_boundary_prime = 1)) -> p = n + n -> falseStructural proof guide
The closed upper endpoint is composite whenever 1<n.
Direct prerequisites: lt_not_le, zero_add, two_mul_eq_add_self, fixed_nontrivial_factor_not_prime. The authored body proceeds by intermediate claims (3), equality transport (1).
Proof neighborhood
Direct dependencies
BT001I lt_not_le BT0000 zero_add BT00QU two_mul_eq_add_self BT0116 fixed_nontrivial_factor_not_primeDirect 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 p - 0003
intro hlower - 0004
intro hprime - 0005
intro heq - 0006
have hn_not_one : ~(n = 1) - 0007
intro hn_one - 0008
specialize lt_not_le 1 - 0009
specialize lt_not_le n - 0010
apply lt_not_le - 0011
exact hlower - 0012
exists 0 - 0013
rewrite hn_one - 0014
apply zero_add - 0015
have htwo_not_one : ~(2 = 1) - 0016
intro htwo_one - 0017
apply PA1 - 0018
apply PA2 - 0019
exact htwo_one - 0020
have hfactor : p = 2 * n - 0021
trans n + n - 0022
exact heq - 0023
symm - 0024
specialize two_mul_eq_add_self n - 0025
exact two_mul_eq_add_self - 0026
specialize fixed_nontrivial_factor_not_prime p - 0027
specialize fixed_nontrivial_factor_not_prime 2 - 0028
specialize fixed_nontrivial_factor_not_prime n - 0029
apply fixed_nontrivial_factor_not_prime - 0030
exact hfactor - 0031
exact htwo_not_one - 0032
exact hn_not_one - 0033
exact hprime