let j, i be Element of NAT ; :: thesis: for G being Matrix of (TOP-REAL 2) st not G is empty-yielding & G is Y_equal-in-column & G is Y_increasing-in-line & 1 <= j & j <= width G & 1 <= i & i < len G holds
LSeg (G * i,j),(G * (i + 1),j) c= h_strip G,j
let G be Matrix of (TOP-REAL 2); :: thesis: ( not G is empty-yielding & G is Y_equal-in-column & G is Y_increasing-in-line & 1 <= j & j <= width G & 1 <= i & i < len G implies LSeg (G * i,j),(G * (i + 1),j) c= h_strip G,j )
assume that
A1: not G is empty-yielding and
A2: G is Y_equal-in-column and
A3: G is Y_increasing-in-line and
A4: ( 1 <= j & j <= width G ) and
A5: ( 1 <= i & i < len G ) ; :: thesis: LSeg (G * i,j),(G * (i + 1),j) c= h_strip G,j
A6: ( 1 <= i + 1 & i + 1 <= len G ) by A5, NAT_1:13;
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in LSeg (G * i,j),(G * (i + 1),j) or x in h_strip G,j )
assume A7: x in LSeg (G * i,j),(G * (i + 1),j) ; :: thesis: x in h_strip G,j
then reconsider p = x as Point of (TOP-REAL 2) ;
A8: p = |[(p `1 ),(p `2 )]| by EUCLID:57;
A9: (G * i,j) `2 = (G * 1,j) `2 by A2, A4, A5, Th2
.= (G * (i + 1),j) `2 by A2, A4, A6, Th2 ;

now

per cases ( j = width G or j < width G ) by A4, XXREAL_0:1;

suppose A10: j = width G ; :: thesis: x in h_strip G,j

then (G * i,(width G)) `2 <= p `2 by A7, A9, TOPREAL1:10;
then p in { |[r,s]| where r, s is Real : (G * i,(width G)) `2 <= s } by A8;
hence x in h_strip G,j by A1, A2, A5, A10, Th7; :: thesis: verum

end;

suppose A11: j < width G ; :: thesis: x in h_strip G,j

then A12: j + 1 <= width G by NAT_1:13;
A13: ( (G * i,j) `2 <= p `2 & p `2 <= (G * i,j) `2 ) by A7, A9, TOPREAL1:10;
then A14: p `2 = (G * i,j) `2 by XXREAL_0:1;
j < j + 1 by XREAL_1:31;
then p `2 < (G * i,(j + 1)) `2 by A3, A4, A5, A12, A14, Th5;
then p in { |[r,s]| where r, s is Real : ( (G * i,j) `2 <= s & s <= (G * i,(j + 1)) `2 ) } by A8, A13;
hence x in h_strip G,j by A2, A4, A5, A11, Th6; :: thesis: verum

end;

end;

end;

hence x in h_strip G,j ; :: thesis: verum