theorem
  1 <= i & i+1 <= len G & 1 <= j & j+1 <= width G implies LSeg(1/2*(G*(i
  ,j)+G*(i+1,j+1)),p) meets Int cell(G,i,j)
proof
  assume
A1: 1 <= i & i+1 <= len G & 1 <= j & j+1 <= width G;
  now
    take a = 1/2*(G*(i,j)+G*(i+1,j+1));
    thus a in LSeg(1/2*(G*(i,j)+G*(i+1,j+1)),p) by RLTOPSP1:68;
    thus a in Int cell(G,i,j) by A1,Th31;
  end;
  hence thesis by XBOOLE_0:3;
end;
