Exact expanded PA statement
forall d n q r. n = d * q + r -> ~(r = 0) -> (exists bpr_gap_bb8rn_lt. bpr_gap_bb8rn_lt + S (r) = d) -> ~(exists bpr_quotient_bb8rn_divides. n = (d) * bpr_quotient_bb8rn_divides)Structural proof guide
A nonzero proper remainder refutes divisibility.
Direct prerequisites: multiple_refl, divides_remainder, divisor_le_nonzero, lt_not_le. The authored body proceeds by intermediate claims (3).
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 d - 0002
intro n - 0003
intro q - 0004
intro r - 0005
intro heq - 0006
intro hr0 - 0007
intro hlt - 0008
intro hdivides - 0009
have hself : exists u. d = d * u - 0010
specialize multiple_refl d - 0011
exact multiple_refl - 0012
have hrem : exists u. r = d * u - 0013
specialize divides_remainder d - 0014
specialize divides_remainder n - 0015
specialize divides_remainder d - 0016
specialize divides_remainder q - 0017
specialize divides_remainder r - 0018
apply divides_remainder - 0019
exact hdivides - 0020
exact hself - 0021
exact heq - 0022
have hle : exists k. k + d = r - 0023
specialize divisor_le_nonzero d - 0024
specialize divisor_le_nonzero r - 0025
apply divisor_le_nonzero - 0026
exact hr0 - 0027
exact hrem - 0028
specialize lt_not_le r - 0029
specialize lt_not_le d - 0030
apply lt_not_le - 0031
exact hlt - 0032
exact hle