Exact expanded PA statement
forall n a b. n = a * b -> ~(a = 1) -> ~(b = 1) -> ((~(n = 1) /\ forall bpr_left_bb8fnfp_prime bpr_right_bb8fnfp_prime. n = bpr_left_bb8fnfp_prime * bpr_right_bb8fnfp_prime -> bpr_left_bb8fnfp_prime = 1 \/ bpr_right_bb8fnfp_prime = 1)) -> falseStructural proof guide
A displayed nontrivial factorization refutes primality.
Direct prerequisites: none. The authored body proceeds by case analysis (2), intermediate claims (1).
Proof neighborhood
Direct dependencies
none
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 a - 0003
intro b - 0004
intro hfactor - 0005
intro ha - 0006
intro hb - 0007
intro hprime - 0008
cases hprime - 0009
specialize hprime_right a - 0010
specialize hprime_right b - 0011
have hunit : a = 1 \/ b = 1 - 0012
apply hprime_right - 0013
exact hfactor - 0014
cases hunit - 0015
apply ha - 0016
exact hunit_left - 0017
apply hb - 0018
exact hunit_right