{ (q `1) where q is Point of () : ( q `2 = N-bound (L~ g) & q in L~ g ) } c= REAL
proof
let X be object ; :: according to TARSKI:def 3 :: thesis: ( not X in { (q `1) where q is Point of () : ( q `2 = N-bound (L~ g) & q in L~ g ) } or X in REAL )
assume X in { (q `1) where q is Point of () : ( q `2 = N-bound (L~ g) & q in L~ g ) } ; :: thesis:
then ex q being Point of () st
( X = q `1 & q `2 = N-bound (L~ g) & q in L~ g ) ;
hence X in REAL by XREAL_0:def 1; :: thesis: verum
end;
then reconsider B = { (q `1) where q is Point of () : ( q `2 = N-bound (L~ g) & q in L~ g ) } as Subset of REAL ;
defpred S1[ Nat] means ( [\$1,(width (GoB g))] in Indices (GoB g) & ex i being Nat st
( i in dom g & g /. i = (GoB g) * (\$1,(width (GoB g))) ) );
set Y = { j where j is Element of NAT : S1[j] } ;
A121: { j where j is Element of NAT : S1[j] } c= dom (GoB g)
proof
let y be object ; :: according to TARSKI:def 3 :: thesis: ( not y in { j where j is Element of NAT : S1[j] } or y in dom (GoB g) )
assume y in { j where j is Element of NAT : S1[j] } ; :: thesis: y in dom (GoB g)
then ex j being Element of NAT st
( y = j & [j,(width (GoB g))] in Indices (GoB g) & ex i being Nat st
( i in dom g & g /. i = (GoB g) * (j,(width (GoB g))) ) ) ;
then [y,(width (GoB g))] in [:(dom (GoB g)),(Seg (width (GoB g))):] by MATRIX_0:def 4;
hence y in dom (GoB g) by ZFMISC_1:87; :: thesis: verum
end;
A122: { j where j is Element of NAT : S1[j] } is Subset of NAT from 1 <= width (GoB g) by GOBOARD7:33;
then consider i, j being Nat such that
A123: i in dom g and
A124: [j,(width (GoB g))] in Indices (GoB g) and
A125: g /. i = (GoB g) * (j,(width (GoB g))) by Th8;
j in NAT by ORDINAL1:def 12;
then j in { j where j is Element of NAT : S1[j] } by ;
then reconsider Y = { j where j is Element of NAT : S1[j] } as non empty finite Subset of NAT by ;
set i1 = min Y;
set s1 = ((GoB g) * (1,(width (GoB g)))) `1 ;
min Y in Y by XXREAL_2:def 7;
then consider j being Element of NAT such that
A126: j = min Y and
A127: [j,(width (GoB g))] in Indices (GoB g) and
A128: ex i being Nat st
( i in dom g & g /. i = (GoB g) * (j,(width (GoB g))) ) ;
A129: min Y <= len (GoB g) by ;
A130: 1 <= width (GoB g) by ;
1 <= min Y by ;
then A131: ((GoB g) * ((min Y),(width (GoB g)))) `2 = ((GoB g) * (1,(width (GoB g)))) `2 by ;
then A132: ((GoB g) * ((min Y),(width (GoB g)))) `2 = N-bound (L~ g) by Th40;
consider i being Nat such that
A133: i in dom g and
A134: g /. i = (GoB g) * (j,(width (GoB g))) by A128;
A135: i <= len g by ;
A136: 1 <= i by ;
A137: now :: thesis: ( ( i < len g & (GoB g) * ((min Y),(width (GoB g))) in L~ g ) or ( i = len g & (GoB g) * ((min Y),(width (GoB g))) in L~ g ) )
per cases ( i < len g or i = len g ) by ;
case i < len g ; :: thesis: (GoB g) * ((min Y),(width (GoB g))) in L~ g
then i + 1 <= len g by NAT_1:13;
then g /. i in LSeg (g,i) by ;
hence (GoB g) * ((min Y),(width (GoB g))) in L~ g by ; :: thesis: verum
end;
case i = len g ; :: thesis: (GoB g) * ((min Y),(width (GoB g))) in L~ g
then g /. i in LSeg (g,(i -' 1)) by ;
hence (GoB g) * ((min Y),(width (GoB g))) in L~ g by ; :: thesis: verum
end;
end;
end;
((GoB g) * ((min Y),(width (GoB g)))) `2 = N-bound (L~ g) by ;
then A138: ((GoB g) * ((min Y),(width (GoB g)))) `1 in { (q `1) where q is Point of () : ( q `2 = N-bound (L~ g) & q in L~ g ) } by A137;
for r being Real st r in B holds
r >= ((GoB g) * ((min Y),(width (GoB g)))) `1
proof
let r be Real; :: thesis: ( r in B implies r >= ((GoB g) * ((min Y),(width (GoB g)))) `1 )
assume r in B ; :: thesis: r >= ((GoB g) * ((min Y),(width (GoB g)))) `1
then ex q being Point of () st
( r = q `1 & q `2 = N-bound (L~ g) & q in L~ g ) ;
hence r >= ((GoB g) * ((min Y),(width (GoB g)))) `1 by Lm6; :: thesis: verum
end;
then A139: lower_bound B >= ((GoB g) * ((min Y),(width (GoB g)))) `1 by ;
((GoB g) * (1,(width (GoB g)))) `1 is LowerBound of B
proof
let r be ExtReal; :: according to XXREAL_2:def 2 :: thesis: ( not r in B or ((GoB g) * (1,(width (GoB g)))) `1 <= r )
assume r in B ; :: thesis: ((GoB g) * (1,(width (GoB g)))) `1 <= r
then A140: ex q1 being Point of () st
( r = q1 `1 & q1 `2 = N-bound (L~ g) & q1 in L~ g ) ;
1 <= width (GoB g) by GOBOARD7:33;
hence ((GoB g) * (1,(width (GoB g)))) `1 <= r by ; :: thesis: verum
end;
then B is bounded_below ;
then lower_bound B <= ((GoB g) * ((min Y),(width (GoB g)))) `1 by ;
then ((GoB g) * ((min Y),(width (GoB g)))) `1 = lower_bound B by
.= lower_bound (proj1 | (N-most (L~ g))) by Th15 ;
hence ex b1 being Nat st
( [b1,(width (GoB g))] in Indices (GoB g) & (GoB g) * (b1,(width (GoB g))) = N-min (L~ g) ) by ; :: thesis: verum