Step-by-step derivation
S001 · implies
Before
carrier Fin(6);complete Cayley table=[[0, 1, 2, 3, 4, 5], [1, 5, 4, 2, 0, 3], [2, 4, 5, 1, 3, 0], [3, 2, 1, 0, 5, 4], [4, 0, 3, 5, 2, 1], [5, 3, 0, 4, 1, 2]]
After
all entries lie in carrier;do not assume identity0 or commutativity
Conditions: none
Fix the whole table and labels.Typed closure is only the first group premise;an Abelian family name does not replace the commutativity audit.
Step identifiers and dependencies
Rule: complete_finite_group_typed_table · Uses: G001
S002 · implies
Before
a=0;b=0;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[0, 1, 2, 3, 4, 5];a*(b*c) values=[0, 1, 2, 3, 4, 5];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S001
S003 · implies
Before
a=0;b=1;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[1, 5, 4, 2, 0, 3];a*(b*c) values=[1, 5, 4, 2, 0, 3];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S002
S004 · implies
Before
a=0;b=2;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[2, 4, 5, 1, 3, 0];a*(b*c) values=[2, 4, 5, 1, 3, 0];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S003
S005 · implies
Before
a=0;b=3;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[3, 2, 1, 0, 5, 4];a*(b*c) values=[3, 2, 1, 0, 5, 4];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S004
S006 · implies
Before
a=0;b=4;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[4, 0, 3, 5, 2, 1];a*(b*c) values=[4, 0, 3, 5, 2, 1];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S005
S007 · implies
Before
a=0;b=5;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[5, 3, 0, 4, 1, 2];a*(b*c) values=[5, 3, 0, 4, 1, 2];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S006
S008 · implies
Before
a=1;b=0;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[1, 5, 4, 2, 0, 3];a*(b*c) values=[1, 5, 4, 2, 0, 3];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S007
S009 · implies
Before
a=1;b=1;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[5, 3, 0, 4, 1, 2];a*(b*c) values=[5, 3, 0, 4, 1, 2];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S008
S010 · implies
Before
a=1;b=2;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[4, 0, 3, 5, 2, 1];a*(b*c) values=[4, 0, 3, 5, 2, 1];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S009
S011 · implies
Before
a=1;b=3;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[2, 4, 5, 1, 3, 0];a*(b*c) values=[2, 4, 5, 1, 3, 0];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S010
S012 · implies
Before
a=1;b=4;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[0, 1, 2, 3, 4, 5];a*(b*c) values=[0, 1, 2, 3, 4, 5];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S011
S013 · implies
Before
a=1;b=5;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[3, 2, 1, 0, 5, 4];a*(b*c) values=[3, 2, 1, 0, 5, 4];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S012
S014 · implies
Before
a=2;b=0;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[2, 4, 5, 1, 3, 0];a*(b*c) values=[2, 4, 5, 1, 3, 0];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S013
S015 · implies
Before
a=2;b=1;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[4, 0, 3, 5, 2, 1];a*(b*c) values=[4, 0, 3, 5, 2, 1];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S014
S016 · implies
Before
a=2;b=2;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[5, 3, 0, 4, 1, 2];a*(b*c) values=[5, 3, 0, 4, 1, 2];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S015
S017 · implies
Before
a=2;b=3;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[1, 5, 4, 2, 0, 3];a*(b*c) values=[1, 5, 4, 2, 0, 3];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S016
S018 · implies
Before
a=2;b=4;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[3, 2, 1, 0, 5, 4];a*(b*c) values=[3, 2, 1, 0, 5, 4];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S017
S019 · implies
Before
a=2;b=5;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[0, 1, 2, 3, 4, 5];a*(b*c) values=[0, 1, 2, 3, 4, 5];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S018
S020 · implies
Before
a=3;b=0;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[3, 2, 1, 0, 5, 4];a*(b*c) values=[3, 2, 1, 0, 5, 4];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S019
S021 · implies
Before
a=3;b=1;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[2, 4, 5, 1, 3, 0];a*(b*c) values=[2, 4, 5, 1, 3, 0];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S020
S022 · implies
Before
a=3;b=2;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[1, 5, 4, 2, 0, 3];a*(b*c) values=[1, 5, 4, 2, 0, 3];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S021
S023 · implies
Before
a=3;b=3;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[0, 1, 2, 3, 4, 5];a*(b*c) values=[0, 1, 2, 3, 4, 5];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S022
S024 · implies
Before
a=3;b=4;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[5, 3, 0, 4, 1, 2];a*(b*c) values=[5, 3, 0, 4, 1, 2];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S023
S025 · implies
Before
a=3;b=5;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[4, 0, 3, 5, 2, 1];a*(b*c) values=[4, 0, 3, 5, 2, 1];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S024
S026 · implies
Before
a=4;b=0;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[4, 0, 3, 5, 2, 1];a*(b*c) values=[4, 0, 3, 5, 2, 1];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S025
S027 · implies
Before
a=4;b=1;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[0, 1, 2, 3, 4, 5];a*(b*c) values=[0, 1, 2, 3, 4, 5];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S026
S028 · implies
Before
a=4;b=2;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[3, 2, 1, 0, 5, 4];a*(b*c) values=[3, 2, 1, 0, 5, 4];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S027
S029 · implies
Before
a=4;b=3;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[5, 3, 0, 4, 1, 2];a*(b*c) values=[5, 3, 0, 4, 1, 2];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S028
S030 · implies
Before
a=4;b=4;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[2, 4, 5, 1, 3, 0];a*(b*c) values=[2, 4, 5, 1, 3, 0];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S029
S031 · implies
Before
a=4;b=5;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[1, 5, 4, 2, 0, 3];a*(b*c) values=[1, 5, 4, 2, 0, 3];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S030
S032 · implies
Before
a=5;b=0;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[5, 3, 0, 4, 1, 2];a*(b*c) values=[5, 3, 0, 4, 1, 2];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S031
S033 · implies
Before
a=5;b=1;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[3, 2, 1, 0, 5, 4];a*(b*c) values=[3, 2, 1, 0, 5, 4];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S032
S034 · implies
Before
a=5;b=2;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[0, 1, 2, 3, 4, 5];a*(b*c) values=[0, 1, 2, 3, 4, 5];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S033
S035 · implies
Before
a=5;b=3;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[4, 0, 3, 5, 2, 1];a*(b*c) values=[4, 0, 3, 5, 2, 1];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S034
S036 · implies
Before
a=5;b=4;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[1, 5, 4, 2, 0, 3];a*(b*c) values=[1, 5, 4, 2, 0, 3];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S035
S037 · implies
Before
a=5;b=5;all c=[0, 1, 2, 3, 4, 5]
After
(a*b)*c values=[2, 4, 5, 1, 3, 0];a*(b*c) values=[2, 4, 5, 1, 3, 0];equal=Yes
Conditions: none
For each ordered(a,b),list both sides over every c.Only equality of every row qualifies the whole finite associativity obligation.
Step identifiers and dependencies
Rule: associativity_every_third_label · Uses: G001, S036
S038 · implies
Before
candidate identity=0;left products=[0, 1, 2, 3, 4, 5];right products=[0, 1, 2, 3, 4, 5]
After
both equal original carrier labels=Yes
Conditions: none
Require both e*x=x and x*e=x.Label0 has no special status;read both table directions.
Step identifiers and dependencies
Rule: two_sided_identity_derive_not_zero_label · Uses: G001, S037
S039 · implies
Before
candidate identity=1;left products=[1, 5, 4, 2, 0, 3];right products=[1, 5, 4, 2, 0, 3]
After
both equal original carrier labels=No
Conditions: none
Require both e*x=x and x*e=x.Label0 has no special status;read both table directions.
Step identifiers and dependencies
Rule: two_sided_identity_derive_not_zero_label · Uses: G001, S038
S040 · implies
Before
candidate identity=2;left products=[2, 4, 5, 1, 3, 0];right products=[2, 4, 5, 1, 3, 0]
After
both equal original carrier labels=No
Conditions: none
Require both e*x=x and x*e=x.Label0 has no special status;read both table directions.
Step identifiers and dependencies
Rule: two_sided_identity_derive_not_zero_label · Uses: G001, S039
S041 · implies
Before
candidate identity=3;left products=[3, 2, 1, 0, 5, 4];right products=[3, 2, 1, 0, 5, 4]
After
both equal original carrier labels=No
Conditions: none
Require both e*x=x and x*e=x.Label0 has no special status;read both table directions.
Step identifiers and dependencies
Rule: two_sided_identity_derive_not_zero_label · Uses: G001, S040
S042 · implies
Before
candidate identity=4;left products=[4, 0, 3, 5, 2, 1];right products=[4, 0, 3, 5, 2, 1]
After
both equal original carrier labels=No
Conditions: none
Require both e*x=x and x*e=x.Label0 has no special status;read both table directions.
Step identifiers and dependencies
Rule: two_sided_identity_derive_not_zero_label · Uses: G001, S041
S043 · implies
Before
candidate identity=5;left products=[5, 3, 0, 4, 1, 2];right products=[5, 3, 0, 4, 1, 2]
After
both equal original carrier labels=No
Conditions: none
Require both e*x=x and x*e=x.Label0 has no special status;read both table directions.
Step identifiers and dependencies
Rule: two_sided_identity_derive_not_zero_label · Uses: G001, S042
S044 · implies
Before
element=0;actual identity=0;two-sided inverse candidates=[0]
After
inverse=0
Conditions: none
Find a two-sided inverse returning to the actual identity for every element.Missing any inverse prevents later group reasoning.
Step identifiers and dependencies
Rule: group_inverse_qualified_at_actual_identity · Uses: G001, S043
S045 · implies
Before
element=1;actual identity=0;two-sided inverse candidates=[4]
After
inverse=4
Conditions: none
Find a two-sided inverse returning to the actual identity for every element.Missing any inverse prevents later group reasoning.
Step identifiers and dependencies
Rule: group_inverse_qualified_at_actual_identity · Uses: G001, S044
S046 · implies
Before
element=2;actual identity=0;two-sided inverse candidates=[5]
After
inverse=5
Conditions: none
Find a two-sided inverse returning to the actual identity for every element.Missing any inverse prevents later group reasoning.
Step identifiers and dependencies
Rule: group_inverse_qualified_at_actual_identity · Uses: G001, S045
S047 · implies
Before
element=3;actual identity=0;two-sided inverse candidates=[3]
After
inverse=3
Conditions: none
Find a two-sided inverse returning to the actual identity for every element.Missing any inverse prevents later group reasoning.
Step identifiers and dependencies
Rule: group_inverse_qualified_at_actual_identity · Uses: G001, S046
S048 · implies
Before
element=4;actual identity=0;two-sided inverse candidates=[1]
After
inverse=1
Conditions: none
Find a two-sided inverse returning to the actual identity for every element.Missing any inverse prevents later group reasoning.
Step identifiers and dependencies
Rule: group_inverse_qualified_at_actual_identity · Uses: G001, S047
S049 · implies
Before
element=5;actual identity=0;two-sided inverse candidates=[2]
After
inverse=2
Conditions: none
Find a two-sided inverse returning to the actual identity for every element.Missing any inverse prevents later group reasoning.
Step identifiers and dependencies
Rule: group_inverse_qualified_at_actual_identity · Uses: G001, S048
S050 · implies
Before
element=5;actual identity=0
After
zero repetitions give=0
Conditions: none
Start powers at the actual identity.Zero repetitions return it;no extra commutativity premise has been assumed.
Step identifiers and dependencies
Rule: power_starts_at_actual_identity · Uses: G001, S049
S051 · implies
Before
repetition=1;previous=0;element=5;table row=[0, 1, 2, 3, 4, 5]
After
new value=table[0][5]=5
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S050
S052 · implies
Before
repetition=2;previous=5;element=5;table row=[5, 3, 0, 4, 1, 2]
After
new value=table[5][5]=2
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S051
S053 · implies
Before
repetition=3;previous=2;element=5;table row=[2, 4, 5, 1, 3, 0]
After
new value=table[2][5]=0
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S052
S054 · implies
Before
repetition=4;previous=0;element=5;table row=[0, 1, 2, 3, 4, 5]
After
new value=table[0][5]=5
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S053
S055 · implies
Before
repetition=5;previous=5;element=5;table row=[5, 3, 0, 4, 1, 2]
After
new value=table[5][5]=2
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S054
S056 · implies
Before
repetition=6;previous=2;element=5;table row=[2, 4, 5, 1, 3, 0]
After
new value=table[2][5]=0
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S055
S057 · implies
Before
repetition=7;previous=0;element=5;table row=[0, 1, 2, 3, 4, 5]
After
new value=table[0][5]=5
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S056
S058 · implies
Before
repetition=8;previous=5;element=5;table row=[5, 3, 0, 4, 1, 2]
After
new value=table[5][5]=2
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S057
S059 · implies
Before
repetition=9;previous=2;element=5;table row=[2, 4, 5, 1, 3, 0]
After
new value=table[2][5]=0
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S058
S060 · implies
Before
repetition=10;previous=0;element=5;table row=[0, 1, 2, 3, 4, 5]
After
new value=table[0][5]=5
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S059
S061 · implies
Before
repetition=11;previous=5;element=5;table row=[5, 3, 0, 4, 1, 2]
After
new value=table[5][5]=2
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S060
S062 · implies
Before
repetition=12;previous=2;element=5;table row=[2, 4, 5, 1, 3, 0]
After
new value=table[2][5]=0
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S061
S063 · implies
Before
repetition=13;previous=0;element=5;table row=[0, 1, 2, 3, 4, 5]
After
new value=table[0][5]=5
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S062
S064 · implies
Before
repetition=14;previous=5;element=5;table row=[5, 3, 0, 4, 1, 2]
After
new value=table[5][5]=2
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S063
S065 · implies
Before
repetition=15;previous=2;element=5;table row=[2, 4, 5, 1, 3, 0]
After
new value=table[2][5]=0
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S064
S066 · implies
Before
repetition=16;previous=0;element=5;table row=[0, 1, 2, 3, 4, 5]
After
new value=table[0][5]=5
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S065
S067 · implies
Before
repetition=17;previous=5;element=5;table row=[5, 3, 0, 4, 1, 2]
After
new value=table[5][5]=2
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S066
S068 · implies
Before
repetition=18;previous=2;element=5;table row=[2, 4, 5, 1, 3, 0]
After
new value=table[2][5]=0
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S067
S069 · implies
Before
repetition=19;previous=0;element=5;table row=[0, 1, 2, 3, 4, 5]
After
new value=table[0][5]=5
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S068
S070 · implies
Before
repetition=20;previous=5;element=5;table row=[5, 3, 0, 4, 1, 2]
After
new value=table[5][5]=2
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S069
S071 · implies
Before
repetition=21;previous=2;element=5;table row=[2, 4, 5, 1, 3, 0]
After
new value=table[2][5]=0
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S070
S072 · implies
Before
repetition=22;previous=0;element=5;table row=[0, 1, 2, 3, 4, 5]
After
new value=table[0][5]=5
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S071
S073 · implies
Before
repetition=23;previous=5;element=5;table row=[5, 3, 0, 4, 1, 2]
After
new value=table[5][5]=2
Conditions: none
Look up the current accumulated value and element in the original table,retaining iteration order.Labels are not integer addition.
Step identifiers and dependencies
Rule: ordered_group_power_table_lookup · Uses: G001, S072