PA0031

prime_nonzero

Stable checked-use theorem · independently closed

Every prime natural is nonzero.

Exact expanded PA statement

forall p. (~(p = 1) /\ forall a b. p = a * b -> a = 1 \/ b = 1) -> ~(p = 0)

Structural proof guide

Generated structural guide

Every prime natural is nonzero.

Use the direct prerequisites mul_zero_left, succ_ne_zero as previously established PA formulas.

The proof proceeds by case analysis (2), intermediate claims (1), 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 Stable checked-use theorem is independently kernel-checked when replayed.

  1. 0001intro p
  2. 0002intro hp
  3. 0003intro hp0
  4. 0004cases hp
  5. 0005specialize hp_right 0
  6. 0006specialize hp_right 0
  7. 0007have hunit : 0 = 1 \/ 0 = 1
  8. 0008apply hp_right
  9. 0009rewrite hp0
  10. 0010symm
  11. 0011apply mul_zero_left
  12. 0012cases hunit
  13. 0013specialize succ_ne_zero 0
  14. 0014apply succ_ne_zero
  15. 0015symm
  16. 0016exact hunit_left
  17. 0017specialize succ_ne_zero 0
  18. 0018apply succ_ne_zero
  19. 0019symm
  20. 0020exact hunit_right