let X be RealBanachSpace; :: thesis: for Y being RealNormSpace
for T being Subset of (R_NormSpace_of_BoundedLinearOperators X,Y) st ( for x being Point of X ex K being real number st
( 0 <= K & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.(f . x).|| <= K ) ) ) holds
ex L being real number st
( 0 <= L & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= L ) )

let Y be RealNormSpace; :: thesis: for T being Subset of (R_NormSpace_of_BoundedLinearOperators X,Y) st ( for x being Point of X ex K being real number st
( 0 <= K & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.(f . x).|| <= K ) ) ) holds
ex L being real number st
( 0 <= L & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= L ) )

let T be Subset of (R_NormSpace_of_BoundedLinearOperators X,Y); :: thesis: ( ( for x being Point of X ex K being real number st
( 0 <= K & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.(f . x).|| <= K ) ) ) implies ex L being real number st
( 0 <= L & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= L ) ) )

assume A1: for x being Point of X ex KTx being real number st
( 0 <= KTx & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.(f . x).|| <= KTx ) ) ; :: thesis: ex L being real number st
( 0 <= L & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= L ) )

per cases ( T <> {} or T = {} ) ;
suppose A2: T <> {} ; :: thesis: ex L being real number st
( 0 <= L & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= L ) )

deffunc H1( Point of X, Real) -> Subset of X = Ball $1,$2;
defpred S1[ Point of X, set ] means $2 = { ||.(f . $1).|| where f is bounded LinearOperator of X,Y : f in T } ;
A3: for x being Point of X ex y being Element of bool REAL st S1[x,y]
proof
let x be Point of X; :: thesis: ex y being Element of bool REAL st S1[x,y]
take y = { ||.(f . x).|| where f is bounded LinearOperator of X,Y : f in T } ; :: thesis: ( y is Element of K21(REAL ) & y is Element of bool REAL & S1[x,y] )
now
let z be set ; :: thesis: ( z in y implies z in REAL )
assume z in y ; :: thesis: z in REAL
then ex f being bounded LinearOperator of X,Y st
( z = ||.(f . x).|| & f in T ) ;
hence z in REAL ; :: thesis: verum
end;
hence ( y is Element of K21(REAL ) & y is Element of bool REAL & S1[x,y] ) by TARSKI:def 3; :: thesis: verum
end;
ex Ta being Function of the carrier of X,(bool REAL ) st
for x being Element of X holds S1[x,Ta . x] from FUNCT_2:sch 3(A3);
then consider Ta being Function of X,(bool REAL ) such that
A4: for x being Point of X holds Ta . x = { ||.(f . x).|| where f is bounded LinearOperator of X,Y : f in T } ;
defpred S2[ Element of NAT , set ] means $2 = { x where x is Point of X : ( Ta . x is bounded_above & sup (Ta . x) <= $1 ) } ;
A5: for n being Element of NAT ex y being Element of bool the carrier of X st S2[n,y]
proof
let n be Element of NAT ; :: thesis: ex y being Element of bool the carrier of X st S2[n,y]
take y = { x where x is Point of X : ( Ta . x is bounded_above & sup (Ta . x) <= n ) } ; :: thesis: ( y is Element of K21(the carrier of X) & y is Element of bool the carrier of X & S2[n,y] )
now
let z be set ; :: thesis: ( z in y implies z in the carrier of X )
assume z in y ; :: thesis: z in the carrier of X
then ex x being Point of X st
( z = x & Ta . x is bounded_above & sup (Ta . x) <= n ) ;
hence z in the carrier of X ; :: thesis: verum
end;
hence ( y is Element of K21(the carrier of X) & y is Element of bool the carrier of X & S2[n,y] ) by TARSKI:def 3; :: thesis: verum
end;
ex Xn being Function of NAT ,(bool the carrier of X) st
for n being Element of NAT holds S2[n,Xn . n] from FUNCT_2:sch 3(A5);
then consider Xn being Function of NAT ,(bool the carrier of X) such that
A6: for n being Element of NAT holds Xn . n = { x where x is Point of X : ( Ta . x is bounded_above & sup (Ta . x) <= n ) } ;
reconsider Xn = Xn as SetSequence of X ;
A7: the carrier of X c= union (rng Xn)
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in the carrier of X or x in union (rng Xn) )
assume x in the carrier of X ; :: thesis: x in union (rng Xn)
then reconsider x1 = x as Point of X ;
consider KTx1 being real number such that
0 <= KTx1 and
A8: for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.(f . x1).|| <= KTx1 by A1;
A9: Ta . x1 = { ||.(f . x1).|| where f is bounded LinearOperator of X,Y : f in T } by A4;
A10: for p being real number st p in Ta . x1 holds
p <= KTx1
proof
let p be real number ; :: thesis: ( p in Ta . x1 implies p <= KTx1 )
assume p in Ta . x1 ; :: thesis: p <= KTx1
then ex f being bounded LinearOperator of X,Y st
( p = ||.(f . x1).|| & f in T ) by A9;
hence p <= KTx1 by A8; :: thesis: verum
end;
then A11: Ta . x1 is bounded_above by SEQ_4:def 1;
consider n being Element of NAT such that
A12: KTx1 < n by SEQ_4:10;
consider f being set such that
A13: f in T by A2, XBOOLE_0:def 1;
reconsider f = f as bounded LinearOperator of X,Y by A13, LOPBAN_1:def 10;
||.(f . x1).|| in Ta . x by A9, A13;
then upper_bound (Ta . x1) <= KTx1 by A10, SEQ_4:62;
then upper_bound (Ta . x1) <= n by A12, XXREAL_0:2;
then x1 in { z1 where z1 is Point of X : ( Ta . z1 is bounded_above & sup (Ta . z1) <= n ) } by A11;
then x1 in Xn . n by A6;
then x1 in Union Xn by PROB_1:25;
hence x in union (rng Xn) ; :: thesis: verum
end;
A14: for x being Point of X holds not Ta . x is empty
proof
let x be Point of X; :: thesis: not Ta . x is empty
consider f0 being set such that
A15: f0 in T by A2, XBOOLE_0:def 1;
reconsider f0 = f0 as bounded LinearOperator of X,Y by A15, LOPBAN_1:def 10;
Ta . x = { ||.(f . x).|| where f is bounded LinearOperator of X,Y : f in T } by A4;
then ||.(f0 . x).|| in Ta . x by A15;
hence not Ta . x is empty ; :: thesis: verum
end;
A16: for n being Element of NAT holds Xn . n is closed
proof
let n be Element of NAT ; :: thesis: Xn . n is closed
for s1 being sequence of X st rng s1 c= Xn . n & s1 is convergent holds
lim s1 in Xn . n
proof
let s1 be sequence of X; :: thesis: ( rng s1 c= Xn . n & s1 is convergent implies lim s1 in Xn . n )
assume that
A17: rng s1 c= Xn . n and
A18: s1 is convergent ; :: thesis: lim s1 in Xn . n
A19: Ta . (lim s1) = { ||.(f . (lim s1)).|| where f is bounded LinearOperator of X,Y : f in T } by A4;
A20: for y being real number st y in Ta . (lim s1) holds
y <= n
proof
let y be real number ; :: thesis: ( y in Ta . (lim s1) implies y <= n )
assume y in Ta . (lim s1) ; :: thesis: y <= n
then consider f being bounded LinearOperator of X,Y such that
A21: y = ||.(f . (lim s1)).|| and
A22: f in T by A19;
A23: f is_continuous_in lim s1 by Th4;
A24: dom f = the carrier of X by FUNCT_2:def 1;
then A25: rng s1 c= dom f by A17, XBOOLE_1:1;
then A26: f /* s1 is convergent by A18, A23, NFCONT_1:def 9;
for k being Element of NAT holds ||.(f /* s1).|| . k <= n
proof
let k be Element of NAT ; :: thesis: ||.(f /* s1).|| . k <= n
||.(f /* s1).|| . k = ||.((f /* s1) . k).|| by NORMSP_1:def 10;
then A27: ||.(f /* s1).|| . k = ||.(f /. (s1 . k)).|| by A17, A24, FUNCT_2:186, XBOOLE_1:1;
dom s1 = NAT by FUNCT_2:def 1;
then s1 . k in rng s1 by FUNCT_1:12;
then s1 . k in Xn . n by A17;
then s1 . k in { x where x is Point of X : ( Ta . x is bounded_above & sup (Ta . x) <= n ) } by A6;
then consider x being Point of X such that
A28: x = s1 . k and
A29: Ta . x is bounded_above and
A30: sup (Ta . x) <= n ;
Ta . x = { ||.(g . x).|| where g is bounded LinearOperator of X,Y : g in T } by A4;
then ||.(f . (s1 . k)).|| in Ta . (s1 . k) by A22, A28;
then ||.(f . (s1 . k)).|| <= sup (Ta . (s1 . k)) by A28, A29, SEQ_4:def 4;
hence ||.(f /* s1).|| . k <= n by A27, A28, A30, XXREAL_0:2; :: thesis: verum
end;
then A31: for i being Element of NAT st 0 <= i holds
||.(f /* s1).|| . i <= n ;
f /. (lim s1) = lim (f /* s1) by A18, A23, A25, NFCONT_1:def 9;
then lim ||.(f /* s1).|| = ||.(f /. (lim s1)).|| by A26, LOPBAN_1:24;
hence y <= n by A21, A26, A31, NORMSP_1:39, RSSPACE2:6; :: thesis: verum
end;
not Ta . (lim s1) is empty by A14;
then A32: sup (Ta . (lim s1)) <= n by A20, SEQ_4:62;
A33: Xn . n = { x where x is Point of X : ( Ta . x is bounded_above & sup (Ta . x) <= n ) } by A6;
Ta . (lim s1) is bounded_above by A20, SEQ_4:def 1;
hence lim s1 in Xn . n by A32, A33; :: thesis: verum
end;
hence Xn . n is closed by NFCONT_1:def 5; :: thesis: verum
end;
consider f being set such that
A34: f in T by A2, XBOOLE_0:def 1;
reconsider f = f as bounded LinearOperator of X,Y by A34, LOPBAN_1:def 10;
union (rng Xn) is Subset of X by PROB_1:23;
then union (rng Xn) = the carrier of X by A7, XBOOLE_0:def 10;
then consider n0 being Element of NAT , r being Real, x0 being Point of X such that
A35: 0 < r and
A36: H1(x0,r) c= Xn . n0 by A16, Th3;
||.(x0 - x0).|| = ||.(0. X).|| by RLVECT_1:16;
then x0 in H1(x0,r) by A35;
then x0 in Xn . n0 by A36;
then x0 in { x1 where x1 is Point of X : ( Ta . x1 is bounded_above & sup (Ta . x1) <= n0 ) } by A6;
then consider xx1 being Point of X such that
A37: xx1 = x0 and
A38: Ta . xx1 is bounded_above and
sup (Ta . xx1) <= n0 ;
Ta . xx1 = { ||.(g . xx1).|| where g is bounded LinearOperator of X,Y : g in T } by A4;
then ||.(f . x0).|| in Ta . x0 by A37, A34;
then ||.(f . x0).|| <= sup (Ta . x0) by A37, A38, SEQ_4:def 4;
then A39: 0 <= sup (Ta . x0) by NORMSP_1:8;
A40: for x being Point of X st x <> 0. X holds
((r / (2 * ||.x.||)) * x) + x0 in H1(x0,r)
proof
let x be Point of X; :: thesis: ( x <> 0. X implies ((r / (2 * ||.x.||)) * x) + x0 in H1(x0,r) )
reconsider x1 = (||.x.|| " ) * x as Point of X ;
A41: ||.((r / 2) * x1).|| = (abs (r / 2)) * ||.x1.|| by NORMSP_1:def 2;
assume x <> 0. X ; :: thesis: ((r / (2 * ||.x.||)) * x) + x0 in H1(x0,r)
then A42: ||.x.|| <> 0 by NORMSP_1:def 2;
||.((((r / (2 * ||.x.||)) * x) + x0) - x0).|| = ||.(((r / (2 * ||.x.||)) * x) + (x0 + (- x0))).|| by RLVECT_1:def 6;
then ||.((((r / (2 * ||.x.||)) * x) + x0) - x0).|| = ||.(((r / (2 * ||.x.||)) * x) + (0. X)).|| by RLVECT_1:16;
then ||.((((r / (2 * ||.x.||)) * x) + x0) - x0).|| = ||.((r / (2 * ||.x.||)) * x).|| by RLVECT_1:def 7;
then ||.((((r / (2 * ||.x.||)) * x) + x0) - x0).|| = ||.(((r / 2) / ||.x.||) * x).|| by XCMPLX_1:79;
then A43: ||.((((r / (2 * ||.x.||)) * x) + x0) - x0).|| = ||.((r / 2) * x1).|| by RLVECT_1:def 9;
||.x.|| >= 0 by NORMSP_1:8;
then A44: abs (||.x.|| " ) = ||.x.|| " by ABSVALUE:def 1;
||.x1.|| = (abs (||.x.|| " )) * ||.x.|| by NORMSP_1:def 2;
then ||.x1.|| = 1 by A42, A44, XCMPLX_0:def 7;
then ||.((r / 2) * x1).|| = r / 2 by A35, A41, ABSVALUE:def 1;
then A45: ||.(x0 - (((r / (2 * ||.x.||)) * x) + x0)).|| = r / 2 by A43, NORMSP_1:11;
r / 2 < r by A35, XREAL_1:218;
hence ((r / (2 * ||.x.||)) * x) + x0 in H1(x0,r) by A45; :: thesis: verum
end;
set M = upper_bound (Ta . x0);
take KT = (2 * ((upper_bound (Ta . x0)) + n0)) / r; :: thesis: ( 0 <= KT & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= KT ) )

A46: for f being bounded LinearOperator of X,Y st f in T holds
for x being Point of X st x in H1(x0,r) holds
||.(f . x).|| <= n0
proof
let f be bounded LinearOperator of X,Y; :: thesis: ( f in T implies for x being Point of X st x in H1(x0,r) holds
||.(f . x).|| <= n0 )

assume A47: f in T ; :: thesis: for x being Point of X st x in H1(x0,r) holds
||.(f . x).|| <= n0

let x be Point of X; :: thesis: ( x in H1(x0,r) implies ||.(f . x).|| <= n0 )
assume x in H1(x0,r) ; :: thesis: ||.(f . x).|| <= n0
then x in Xn . n0 by A36;
then x in { x1 where x1 is Point of X : ( Ta . x1 is bounded_above & sup (Ta . x1) <= n0 ) } by A6;
then consider x1 being Point of X such that
A48: x1 = x and
A49: Ta . x1 is bounded_above and
A50: sup (Ta . x1) <= n0 ;
Ta . x1 = { ||.(g . x1).|| where g is bounded LinearOperator of X,Y : g in T } by A4;
then ||.(f . x).|| in Ta . x by A47, A48;
then ||.(f . x).|| <= sup (Ta . x) by A48, A49, SEQ_4:def 4;
hence ||.(f . x).|| <= n0 by A48, A50, XXREAL_0:2; :: thesis: verum
end;
A51: now
let f be bounded LinearOperator of X,Y; :: thesis: ( f in T implies for k being real number st k in { ||.(f . x1).|| where x1 is Point of X : ||.x1.|| <= 1 } holds
k <= KT )

assume A52: f in T ; :: thesis: for k being real number st k in { ||.(f . x1).|| where x1 is Point of X : ||.x1.|| <= 1 } holds
k <= KT

A53: for x being Point of X st x <> 0. X holds
||.(f . x).|| <= KT * ||.x.||
proof
||.(x0 - x0).|| = ||.(0. X).|| by RLVECT_1:16;
then x0 in H1(x0,r) by A35;
then x0 in Xn . n0 by A36;
then A54: x0 in { x1 where x1 is Point of X : ( Ta . x1 is bounded_above & sup (Ta . x1) <= n0 ) } by A6;
set nr3 = ||.(f . x0).||;
let x be Point of X; :: thesis: ( x <> 0. X implies ||.(f . x).|| <= KT * ||.x.|| )
set nrp1 = r / (2 * ||.x.||);
set nrp2 = (2 * ||.x.||) / r;
set nr1 = ||.((f . ((r / (2 * ||.x.||)) * x)) + (f . x0)).||;
set nr2 = ||.(f . ((r / (2 * ||.x.||)) * x)).||;
||.(- (f . x0)).|| = ||.(f . x0).|| by NORMSP_1:6;
then A55: ||.(f . ((r / (2 * ||.x.||)) * x)).|| - ||.(f . x0).|| <= ||.((f . ((r / (2 * ||.x.||)) * x)) - (- (f . x0))).|| by NORMSP_1:12;
assume A56: x <> 0. X ; :: thesis: ||.(f . x).|| <= KT * ||.x.||
then A57: ||.(f . (((r / (2 * ||.x.||)) * x) + x0)).|| <= n0 by A46, A40, A52;
consider x1 being Point of X such that
A58: x1 = x0 and
A59: Ta . x1 is bounded_above and
sup (Ta . x1) <= n0 by A54;
Ta . x1 = { ||.(g . x1).|| where g is bounded LinearOperator of X,Y : g in T } by A4;
then ||.(f . x0).|| in Ta . x0 by A52, A58;
then ||.(f . x0).|| <= sup (Ta . x0) by A58, A59, SEQ_4:def 4;
then A60: ((r / (2 * ||.x.||)) * ||.(f . x).||) - (upper_bound (Ta . x0)) <= ((r / (2 * ||.x.||)) * ||.(f . x).||) - ||.(f . x0).|| by XREAL_1:12;
||.x.|| <> 0 by A56, NORMSP_1:def 2;
then A61: ||.x.|| > 0 by NORMSP_1:8;
||.(f . ((r / (2 * ||.x.||)) * x)).|| = ||.((r / (2 * ||.x.||)) * (f . x)).|| by LOPBAN_1:def 6;
then ||.(f . ((r / (2 * ||.x.||)) * x)).|| = (abs (r / (2 * ||.x.||))) * ||.(f . x).|| by NORMSP_1:def 2;
then ||.(f . ((r / (2 * ||.x.||)) * x)).|| = (r / (2 * ||.x.||)) * ||.(f . x).|| by A35, A61, ABSVALUE:def 1;
then ( ||.((f . ((r / (2 * ||.x.||)) * x)) + (f . x0)).|| = ||.(f . (((r / (2 * ||.x.||)) * x) + x0)).|| & ((r / (2 * ||.x.||)) * ||.(f . x).||) - ||.(f . x0).|| <= ||.((f . ((r / (2 * ||.x.||)) * x)) + (f . x0)).|| ) by A55, LOPBAN_1:def 5, RLVECT_1:30;
then ((r / (2 * ||.x.||)) * ||.(f . x).||) - ||.(f . x0).|| <= n0 by A57, XXREAL_0:2;
then ((r / (2 * ||.x.||)) * ||.(f . x).||) - (upper_bound (Ta . x0)) <= n0 by A60, XXREAL_0:2;
then (((r / (2 * ||.x.||)) * ||.(f . x).||) + (- (upper_bound (Ta . x0)))) + (upper_bound (Ta . x0)) <= n0 + (upper_bound (Ta . x0)) by XREAL_1:8;
then ((2 * ||.x.||) / r) * ((r / (2 * ||.x.||)) * ||.(f . x).||) <= ((2 * ||.x.||) / r) * (n0 + (upper_bound (Ta . x0))) by A35, A61, XREAL_1:66;
then A62: ((r / (2 * ||.x.||)) * ((2 * ||.x.||) / r)) * ||.(f . x).|| <= ((2 * ||.x.||) / r) * (n0 + (upper_bound (Ta . x0))) ;
2 * ||.x.|| > 0 by A61, XREAL_1:131;
then 1 * ||.(f . x).|| <= ((2 * ||.x.||) / r) * (n0 + (upper_bound (Ta . x0))) by A35, A62, XCMPLX_1:113;
hence ||.(f . x).|| <= KT * ||.x.|| ; :: thesis: verum
end;
A63: for x being Point of X holds ||.(f . x).|| <= KT * ||.x.||
proof
let x be Point of X; :: thesis: ||.(f . x).|| <= KT * ||.x.||
now
assume A64: x = 0. X ; :: thesis: ||.(f . x).|| <= KT * ||.x.||
then f . x = f . (0 * (0. X)) by RLVECT_1:23;
then f . x = 0 * (f . (0. X)) by LOPBAN_1:def 6;
then A65: f . x = 0. Y by RLVECT_1:23;
||.x.|| = 0 by A64;
hence ||.(f . x).|| <= KT * ||.x.|| by A65; :: thesis: verum
end;
hence ||.(f . x).|| <= KT * ||.x.|| by A53; :: thesis: verum
end;
thus for k being real number st k in { ||.(f . x1).|| where x1 is Point of X : ||.x1.|| <= 1 } holds
k <= KT :: thesis: verum
proof
let k be real number ; :: thesis: ( k in { ||.(f . x1).|| where x1 is Point of X : ||.x1.|| <= 1 } implies k <= KT )
assume k in { ||.(f . x1).|| where x1 is Point of X : ||.x1.|| <= 1 } ; :: thesis: k <= KT
then consider x being Point of X such that
A66: ( k = ||.(f . x).|| & ||.x.|| <= 1 ) ;
( k <= KT * ||.x.|| & KT * ||.x.|| <= KT ) by A35, A39, A63, A66, XREAL_1:155;
hence k <= KT by XXREAL_0:2; :: thesis: verum
end;
end;
for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= KT
proof
let f be Point of (R_NormSpace_of_BoundedLinearOperators X,Y); :: thesis: ( f in T implies ||.f.|| <= KT )
reconsider f1 = f as bounded LinearOperator of X,Y by LOPBAN_1:def 10;
assume f in T ; :: thesis: ||.f.|| <= KT
then A67: for k being real number st k in PreNorms f1 holds
k <= KT by A51;
||.f.|| = sup (PreNorms f1) by LOPBAN_1:36;
hence ||.f.|| <= KT by A67, SEQ_4:62; :: thesis: verum
end;
hence ( 0 <= KT & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= KT ) ) by A35, A39; :: thesis: verum
end;
suppose A68: T = {} ; :: thesis: ex L being real number st
( 0 <= L & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= L ) )

take L = 0 ; :: thesis: ( 0 <= L & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= L ) )

thus ( 0 <= L & ( for f being Point of (R_NormSpace_of_BoundedLinearOperators X,Y) st f in T holds
||.f.|| <= L ) ) by A68; :: thesis: verum
end;
end;