theorem Th19:
for
i,
j,
k being
Nat for
f being
FinSequence of
(TOP-REAL 2) for
G being
Go-board st 1
<= k &
k + 1
<= len f &
f is_sequence_on G &
[i,j] in Indices G &
[(i + 1),j] in Indices G &
f /. k = G * (
(i + 1),
j) &
f /. (k + 1) = G * (
i,
j) holds
right_cell (
f,
k,
G)
= cell (
G,
i,
j)