let k be Nat; :: thesis: for G being Go-board
for f, g being FinSequence of (TOP-REAL 2) st f is_sequence_on G & f is special & L~ g c= L~ f & 1 <= k & k + 1 <= len f holds
for A being Subset of (TOP-REAL 2) st ( A = (right_cell (f,k,G)) \ (L~ g) or A = (left_cell (f,k,G)) \ (L~ g) ) holds
A is connected

let G be Go-board; :: thesis: for f, g being FinSequence of (TOP-REAL 2) st f is_sequence_on G & f is special & L~ g c= L~ f & 1 <= k & k + 1 <= len f holds
for A being Subset of (TOP-REAL 2) st ( A = (right_cell (f,k,G)) \ (L~ g) or A = (left_cell (f,k,G)) \ (L~ g) ) holds
A is connected

let f, g be FinSequence of (TOP-REAL 2); :: thesis: ( f is_sequence_on G & f is special & L~ g c= L~ f & 1 <= k & k + 1 <= len f implies for A being Subset of (TOP-REAL 2) st ( A = (right_cell (f,k,G)) \ (L~ g) or A = (left_cell (f,k,G)) \ (L~ g) ) holds
A is connected )

assume that
A1: f is_sequence_on G and
A2: f is special and
A3: L~ g c= L~ f and
A4: ( 1 <= k & k + 1 <= len f ) ; :: thesis: for A being Subset of (TOP-REAL 2) st ( A = (right_cell (f,k,G)) \ (L~ g) or A = (left_cell (f,k,G)) \ (L~ g) ) holds
A is connected

let A be Subset of (TOP-REAL 2); :: thesis: ( ( A = (right_cell (f,k,G)) \ (L~ g) or A = (left_cell (f,k,G)) \ (L~ g) ) implies A is connected )
assume A5: ( A = (right_cell (f,k,G)) \ (L~ g) or A = (left_cell (f,k,G)) \ (L~ g) ) ; :: thesis: A is connected
per cases ( A = (right_cell (f,k,G)) \ (L~ g) or A = (left_cell (f,k,G)) \ (L~ g) ) by A5;
end;