let f be V22() standard clockwise_oriented special_circular_sequence; :: thesis: for G being Go-board st f is_sequence_on G holds
for i, j, k being Nat st 1 <= k & k + 1 <= len f & [i,j] in Indices G & [(i + 1),j] in Indices G & f /. k = G * (i,j) & f /. (k + 1) = G * ((i + 1),j) holds
j > 1

let G be Go-board; :: thesis: ( f is_sequence_on G implies for i, j, k being Nat st 1 <= k & k + 1 <= len f & [i,j] in Indices G & [(i + 1),j] in Indices G & f /. k = G * (i,j) & f /. (k + 1) = G * ((i + 1),j) holds
j > 1 )

assume A1: f is_sequence_on G ; :: thesis: for i, j, k being Nat st 1 <= k & k + 1 <= len f & [i,j] in Indices G & [(i + 1),j] in Indices G & f /. k = G * (i,j) & f /. (k + 1) = G * ((i + 1),j) holds
j > 1

let i, j, k be Nat; :: thesis: ( 1 <= k & k + 1 <= len f & [i,j] in Indices G & [(i + 1),j] in Indices G & f /. k = G * (i,j) & f /. (k + 1) = G * ((i + 1),j) implies j > 1 )
assume that
A2: ( 1 <= k & k + 1 <= len f ) and
A3: [i,j] in Indices G and
A4: ( [(i + 1),j] in Indices G & f /. k = G * (i,j) & f /. (k + 1) = G * ((i + 1),j) ) ; :: thesis: j > 1
assume A5: j <= 1 ; :: thesis: contradiction
1 <= j by ;
then j = 1 by ;
then A6: j -' 1 = 0 by XREAL_1:232;
A7: i <= len G by ;
right_cell (f,k,G) = cell (G,i,(j -' 1)) by ;
then not (right_cell (f,k,G)) \ (L~ f) is bounded by ;
then not RightComp f is bounded by ;
then not BDD (L~ f) is bounded by GOBRD14:37;
hence contradiction by JORDAN2C:106; :: thesis: verum