Main derivation
S01 · implies
Before
G=\{e,r,r^2,s,rs,r^2s\}After
\begin{array}{c|cccccc}*&e&r&r^2&s&rs&r^2s\\\hline e&e&r&r^2&s&rs&r^2s\\r&r&r^2&e&rs&r^2s&s\\r^2&r^2&e&r&r^2s&s&rs\\s&s&r^2s&rs&e&r^2&r\\rs&rs&s&r^2s&r&e&r^2\\r^2s&r^2s&rs&s&r^2&r&e\\\end{array}Conditions: none
Rule: calc · Uses: G1
Leaf basis: calc
Expand the pair formula for all 36 products; every output belongs to the same six-element carrier and no cell is missing.
S02 · implies
Before
(i,j)(k,l)=(i+(-1)^jk,j+l)\quad(\bmod(3,2))
After
((i,j)(k,l))(m,n)=(i+(-1)^jk+(-1)^{j+l}m,j+l+n)=(i,j)((k,l)(m,n));\quad e=(0,0);\quad(i,j)^{-1}=(-(-1)^ji,j)Conditions: none
Rule: calc · Uses: G1, S01
Leaf basis: calc
Both bracketings have identical coordinates, proving associativity for all 216 triples; (0,0) is a two-sided identity and the inverse formula multiplies back on both sides.
S03 · implies
Before
X=\{0,1,2,3\}After
\begin{array}{c|cccc}\cdot&0&1&2&3\\\hline e&0&1&2&3\\r&1&2&0&3\\r^2&2&0&1&3\\s&0&2&1&3\\rs&1&0&2&3\\r^2s&2&1&0&3\\\end{array}Conditions: none
Rule: calc · Uses: G1, S02
Leaf basis: calc
Expand all 24 action values. For x<3, g*(h*x)=i+(-1)^j*k+(-1)^(j+l)*x=(gh)*x; both sides fix 3, and e fixes every point.
S04 · implies
Before
\phi_0:G\to X,\quad\phi_0(g)=g\cdot0
After
\operatorname{im}\phi_0=O=\{0,1,2\},\quad H=\phi_0^{-1}(\{0\})=\{e,s\}Conditions: none
Rule: calc · Uses: G1, S03
Leaf basis: calc
The full 0-column computes orbit and stabilizer, both bound to point zero.
S05 · implies
Before
g=e,r,r^2,s,rs,r^2s
After
\phi_0^{-1}(0)=\{e,s\},\quad\phi_0^{-1}(1)=\{r,rs\},\quad\phi_0^{-1}(2)=\{r^2,r^2s\}Conditions: none
Rule: calc · Uses: G1, S04
Leaf basis: calc
All six group elements are partitioned among three fibers without omissions or overlap.
S06 · implies
Before
H=\{e,s\}After
eH=\{e,s\},\quad rH=\{r,rs\},\quad r^2H=\{r^2,r^2s\}Conditions: none
Rule: calc · Uses: G1, S01, S05
Leaf basis: calc
Compute all three left cosets from the full table; they exactly match the fibers.
S07 · equivalent
Before
g_0\cdot0=y
After
g\cdot0=y\iff(g_0^{-1}g)\cdot0=0\iff g_0^{-1}g\in H\iff g\in g_0HConditions: none
Rule: calc · Uses: G1, S02, S03, S04, S06
Leaf basis: calc
Action laws and inverses give the two-way fiber/left-coset proof, not merely coincident lists.
S08 · implies
Before
L_{g_0}:H\to g_0H,\quad h\mapsto g_0hAfter
L_{g_0}^{-1}(k)=g_0^{-1}k\Rightarrow|g_0H|=|H|=2Conditions: none
Rule: calc · Uses: G1, S02, S06, S07
Leaf basis: calc
Left translation has an explicit inverse, so every fiber has the same size two.
S09 · implies
Before
G=\phi_0^{-1}(0)\sqcup\phi_0^{-1}(1)\sqcup\phi_0^{-1}(2)After
|G|=3\cdot2=|G\cdot0|\,|\operatorname{Stab}_G(0)|=6Conditions: none
Rule: mko_definition · Uses: G1, S04, S05, S08
Leaf basis: mko_definition
Disjoint complete fibers and equal-size bijections prove the counting identity.