Step-by-step derivation
S001 · implies
Before
natural numbers include0;b is divisible by a iff b=a*k for some natural k
After
0 divides only0;every natural divides0
Conditions: none
Divisibility is an existential multiplier relation without presuming a positive or nonzero divisor.Every natural,including0,divides0.A positive-divisor inventory separately excludes0.
Step identifiers and dependencies
Rule: natural_divisibility_zero_scope · Uses: G001
S002 · implies
Before
positive divisor candidate1:divide natural 15 by positive 1
After
15=15·1+0
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S001
S003 · implies
Before
positive divisor candidate1:a=1;b=15;quotient=15;remainder=0
After
divides=Yes;witness/status=15
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S002
S004 · implies
Before
positive divisor candidate2:divide natural 15 by positive 2
After
15=7·2+1
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S003
S005 · implies
Before
positive divisor candidate2:a=2;b=15;quotient=7;remainder=1
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S004
S006 · implies
Before
positive divisor candidate3:divide natural 15 by positive 3
After
15=5·3+0
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S005
S007 · implies
Before
positive divisor candidate3:a=3;b=15;quotient=5;remainder=0
After
divides=Yes;witness/status=5
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S006
S008 · implies
Before
positive divisor candidate4:divide natural 15 by positive 4
After
15=3·4+3
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S007
S009 · implies
Before
positive divisor candidate4:a=4;b=15;quotient=3;remainder=3
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S008
S010 · implies
Before
positive divisor candidate5:divide natural 15 by positive 5
After
15=3·5+0
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S009
S011 · implies
Before
positive divisor candidate5:a=5;b=15;quotient=3;remainder=0
After
divides=Yes;witness/status=3
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S010
S012 · implies
Before
positive divisor candidate6:divide natural 15 by positive 6
After
15=2·6+3
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S011
S013 · implies
Before
positive divisor candidate6:a=6;b=15;quotient=2;remainder=3
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S012
S014 · implies
Before
positive divisor candidate7:divide natural 15 by positive 7
After
15=2·7+1
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S013
S015 · implies
Before
positive divisor candidate7:a=7;b=15;quotient=2;remainder=1
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S014
S016 · implies
Before
positive divisor candidate8:divide natural 15 by positive 8
After
15=1·8+7
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S015
S017 · implies
Before
positive divisor candidate8:a=8;b=15;quotient=1;remainder=7
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S016
S018 · implies
Before
positive divisor candidate9:divide natural 15 by positive 9
After
15=1·9+6
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S017
S019 · implies
Before
positive divisor candidate9:a=9;b=15;quotient=1;remainder=6
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S018
S020 · implies
Before
positive divisor candidate10:divide natural 15 by positive 10
After
15=1·10+5
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S019
S021 · implies
Before
positive divisor candidate10:a=10;b=15;quotient=1;remainder=5
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S020
S022 · implies
Before
positive divisor candidate11:divide natural 15 by positive 11
After
15=1·11+4
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S021
S023 · implies
Before
positive divisor candidate11:a=11;b=15;quotient=1;remainder=4
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S022
S024 · implies
Before
positive divisor candidate12:divide natural 15 by positive 12
After
15=1·12+3
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S023
S025 · implies
Before
positive divisor candidate12:a=12;b=15;quotient=1;remainder=3
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S024
S026 · implies
Before
positive divisor candidate13:divide natural 15 by positive 13
After
15=1·13+2
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S025
S027 · implies
Before
positive divisor candidate13:a=13;b=15;quotient=1;remainder=2
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S026
S028 · implies
Before
positive divisor candidate14:divide natural 15 by positive 14
After
15=1·14+1
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S027
S029 · implies
Before
positive divisor candidate14:a=14;b=15;quotient=1;remainder=1
After
divides=No;witness/status=does not exist
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S028
S030 · implies
Before
positive divisor candidate15:divide natural 15 by positive 15
After
15=1·15+0
Conditions: none
A positive divisor gives a unique quotient/remainder with0≤r<divisor.The full equality audits both values without division by zero.
Step identifiers and dependencies
Rule: natural_euclidean_division_witness · Uses: G001, S029
S031 · implies
Before
positive divisor candidate15:a=15;b=15;quotient=1;remainder=0
After
divides=Yes;witness/status=1
Conditions: none
For positive a,a zero remainder makes the quotient a natural multiplier witness.A nonzero remainder rules out divisibility by uniqueness;the truncated quotient is not a witness.
Step identifiers and dependencies
Rule: positive_divisor_remainder_criterion · Uses: G001, S030
S032 · implies
Before
positive b=15;complete candidate interval=[1,15]
After
positive divisors=[1, 3, 5, 15];count=4
Conditions: none
If positive d divides positive b,then b=d*k with k≥1,so d≤b.Thus1 through b is the complete candidate domain,not a sample of some factors.
Step identifiers and dependencies
Rule: complete_positive_divisor_bound · Uses: G001, S031