let f be Function of X,X; :: thesis: ( f is contraction implies f is with_unique_fixpoint )
assume A1: f is contraction ; :: thesis: f is with_unique_fixpoint
set x0 = the Element of the carrier of X;
deffunc H1( set , set ) -> set = f . c2;
consider g being Function such that
A2: ( dom g = NAT & g . 0 = the Element of the carrier of X & ( for n being Nat holds g . (n + 1) = H1(n,g . n) ) ) from NAT_1:sch 11();
consider K being Real such that
A3: 0 < K and
A4: K < 1 and
A5: for x, y being Point of X holds ||.((f . x) - (f . y)).|| <= K * ||.(x - y).|| by A1;
defpred S1[ Nat] means g . X in the carrier of X;
A6: S1[ 0 ] by A2;
A7: for k being Nat st S1[k] holds
S1[k + 1]
proof
let k be Nat; :: thesis: ( S1[k] implies S1[k + 1] )
g . (k + 1) = f . (g . k) by A2;
hence ( S1[k] implies S1[k + 1] ) by FUNCT_2:5; :: thesis: verum
end;
A8: for n being Nat holds S1[n] from NAT_1:sch 2(A6, A7);
for n being object st n in NAT holds
g . n in the carrier of X by A8;
then reconsider g = g as sequence of X by A2, FUNCT_2:3;
A9: for n being Nat holds ||.((g . (n + 1)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (K to_power n)
proof
defpred S2[ Nat] means ||.((g . (X + 1)) - (g . X)).|| <= ||.((g . 1) - (g . 0)).|| * (K to_power X);
A10: ||.((g . (0 + 1)) - (g . 0)).|| = ||.((g . 1) - (g . 0)).|| * 1
.= ||.((g . 1) - (g . 0)).|| * (K to_power 0) by POWER:24 ;
A11: S2[ 0 ] by A10;
A12: for k being Nat st S2[k] holds
S2[k + 1]
proof
let k be Nat; :: thesis: ( S2[k] implies S2[k + 1] )
assume A13: S2[k] ; :: thesis: S2[k + 1]
A14: g . ((k + 1) + 1) = f . (g . (k + 1)) by A2;
A15: g . (k + 1) = f . (g . k) by A2;
A16: ||.((f . (g . (k + 1))) - (f . (g . k))).|| <= K * ||.((g . (k + 1)) - (g . k)).|| by A5;
K * ||.((g . (k + 1)) - (g . k)).|| <= K * (||.((g . 1) - (g . 0)).|| * (K to_power k)) by A13, A3, XREAL_1:64;
then ||.((f . (g . (k + 1))) - (f . (g . k))).|| <= ||.((g . 1) - (g . 0)).|| * (K * (K to_power k)) by A16, XXREAL_0:2;
then ||.((f . (g . (k + 1))) - (f . (g . k))).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power 1) * (K to_power k)) by POWER:25;
hence S2[k + 1] by A14, A15, A3, POWER:27; :: thesis: verum
end;
for n being Nat holds S2[n] from NAT_1:sch 2(A11, A12);
hence for n being Nat holds ||.((g . (n + 1)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (K to_power n) ; :: thesis: verum
end;
A17: for k, n being Nat holds ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K))
proof
defpred S2[ Nat] means for n being Nat holds ||.((g . (n + X)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + X))) / (1 - K));
now :: thesis: for n being Nat holds ||.((g . (n + 0)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + 0))) / (1 - K))
let n be Nat; :: thesis: ||.((g . (n + 0)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + 0))) / (1 - K))
||.((g . (n + 0)) - (g . n)).|| = ||.(0. X).|| by RLVECT_1:15
.= 0 ;
hence ||.((g . (n + 0)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + 0))) / (1 - K)) ; :: thesis: verum
end;
then A18: S2[ 0 ] ;
A19: now :: thesis: for k being Nat st S2[k] holds
S2[k + 1]
let k be Nat; :: thesis: ( S2[k] implies S2[k + 1] )
assume A20: S2[k] ; :: thesis: S2[k + 1]
now :: thesis: for n being Nat holds ||.((g . (n + (k + 1))) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + (k + 1)))) / (1 - K))
let n be Nat; :: thesis: ||.((g . (n + (k + 1))) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + (k + 1)))) / (1 - K))
A21: ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K)) by A20;
A22: ||.((g . (n + (k + 1))) - (g . n)).|| <= ||.((g . (n + (k + 1))) - (g . (n + k))).|| + ||.((g . (n + k)) - (g . n)).|| by NORMSP_1:10;
||.((g . ((n + k) + 1)) - (g . (n + k))).|| <= ||.((g . 1) - (g . 0)).|| * (K to_power (n + k)) by A9;
then A23: ||.((g . (n + (k + 1))) - (g . (n + k))).|| + ||.((g . (n + k)) - (g . n)).|| <= (||.((g . 1) - (g . 0)).|| * (K to_power (n + k))) + (||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K))) by A21, XREAL_1:7;
A24: 1 - K <> 0 by A4;
(||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K))) + (||.((g . 1) - (g . 0)).|| * (K to_power (n + k))) = (||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K))) + (((||.((g . 1) - (g . 0)).|| * (K to_power (n + k))) * (1 - K)) / (1 - K)) by A24, XCMPLX_1:89
.= (||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K))) + ((||.((g . 1) - (g . 0)).|| * ((K to_power (n + k)) * (1 - K))) / (1 - K))
.= (||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K))) + (||.((g . 1) - (g . 0)).|| * (((K to_power (n + k)) * (1 - K)) / (1 - K))) by XCMPLX_1:74
.= ||.((g . 1) - (g . 0)).|| * ((((K to_power n) - (K to_power (n + k))) / (1 - K)) + (((K to_power (n + k)) * (1 - K)) / (1 - K)))
.= ||.((g . 1) - (g . 0)).|| * ((((K to_power n) - (K to_power (n + k))) + ((1 - K) * (K to_power (n + k)))) / (1 - K)) by XCMPLX_1:62
.= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K * (K to_power (n + k)))) / (1 - K))
.= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - ((K to_power 1) * (K to_power (n + k)))) / (1 - K)) by POWER:25
.= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power ((n + k) + 1))) / (1 - K)) by A3, POWER:27 ;
hence ||.((g . (n + (k + 1))) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + (k + 1)))) / (1 - K)) by A22, A23, XXREAL_0:2; :: thesis: verum
end;
hence S2[k + 1] ; :: thesis: verum
end;
for k being Nat holds S2[k] from NAT_1:sch 2(A18, A19);
hence for k, n being Nat holds ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K)) ; :: thesis: verum
end;
A25: for k, n being Nat holds ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K))
proof
let k be Nat; :: thesis: for n being Nat holds ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K))
now :: thesis: for n being Nat holds ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K))
let n be Nat; :: thesis: ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K))
A26: ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K)) by A17;
A27: ((K to_power n) - (K to_power (n + k))) / (1 - K) <= (K to_power n) / (1 - K)
proof
A28: K to_power (n + k) > 0 by A3, POWER:34;
A29: 1 - K > 1 - 1 by A4, XREAL_1:10;
(K to_power n) - (K to_power (n + k)) <= (K to_power n) - 0 by A28, XREAL_1:10;
hence ((K to_power n) - (K to_power (n + k))) / (1 - K) <= (K to_power n) / (1 - K) by A29, XREAL_1:72; :: thesis: verum
end;
||.((g . 1) - (g . 0)).|| * (((K to_power n) - (K to_power (n + k))) / (1 - K)) <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K)) by A27, XREAL_1:64;
hence ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K)) by A26, XXREAL_0:2; :: thesis: verum
end;
hence for n being Nat holds ||.((g . (n + k)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K)) ; :: thesis: verum
end;
g is Cauchy_sequence_by_Norm
proof
now :: thesis: for e being Real st e > 0 holds
ex nn being Nat st
for n, m being Nat st n >= nn & m >= nn holds
||.((g . n) - (g . m)).|| < e
let e be Real; :: thesis: ( e > 0 implies ex nn being Nat st
for n, m being Nat st n >= nn & m >= nn holds
||.((g . n) - (g . m)).|| < e )

assume A30: e > 0 ; :: thesis: ex nn being Nat st
for n, m being Nat st n >= nn & m >= nn holds
||.((g . n) - (g . m)).|| < e

e / 2 > 0 by A30, XREAL_1:139;
then consider n being Nat such that
A31: |.((||.((g . 1) - (g . 0)).|| / (1 - K)) * (K to_power n)).| < e / 2 by Th5, A3, A4;
(||.((g . 1) - (g . 0)).|| / (1 - K)) * (K to_power n) <= |.((||.((g . 1) - (g . 0)).|| / (1 - K)) * (K to_power n)).| by ABSVALUE:4;
then (||.((g . 1) - (g . 0)).|| / (1 - K)) * (K to_power n) < e / 2 by A31, XXREAL_0:2;
then A32: ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K)) < e / 2 by XCMPLX_1:75;
reconsider nn = n + 1 as Nat ;
take nn = nn; :: thesis: for n, m being Nat st n >= nn & m >= nn holds
||.((g . n) - (g . m)).|| < e

now :: thesis: for m, l being Nat st nn <= m & nn <= l holds
||.((g . l) - (g . m)).|| < e
let m, l be Nat; :: thesis: ( nn <= m & nn <= l implies ||.((g . l) - (g . m)).|| < e )
assume that
A33: nn <= m and
A34: nn <= l ; :: thesis: ||.((g . l) - (g . m)).|| < e
A35: n < m by A33, NAT_1:16, XXREAL_0:2;
A36: n < l by A34, NAT_1:16, XXREAL_0:2;
consider k1 being Nat such that
A37: n + k1 = m by A35, NAT_1:10;
consider k2 being Nat such that
A38: n + k2 = l by A36, NAT_1:10;
||.((g . (n + k1)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K)) by A25;
then A39: ||.((g . m) - (g . n)).|| < e / 2 by A32, A37, XXREAL_0:2;
||.((g . (n + k2)) - (g . n)).|| <= ||.((g . 1) - (g . 0)).|| * ((K to_power n) / (1 - K)) by A25;
then ||.((g . l) - (g . n)).|| < e / 2 by A32, A38, XXREAL_0:2;
hence ||.((g . l) - (g . m)).|| < e by Lm1, A39; :: thesis: verum
end;
hence for n, m being Nat st n >= nn & m >= nn holds
||.((g . n) - (g . m)).|| < e ; :: thesis: verum
end;
hence g is Cauchy_sequence_by_Norm by RSSPACE3:8; :: thesis: verum
end;
then A40: g is convergent by LOPBAN_1:def 15;
A41: lim g = f . (lim g)
proof
A42: ( g ^\ 1 is convergent & lim (g ^\ 1) = lim g ) by A40, LOPBAN_3:9;
A43: now :: thesis: for n being Nat holds ||.(((g ^\ 1) . n) - (f . (lim g))).|| <= K * ||.((g . n) - (lim g)).||
let n be Nat; :: thesis: ||.(((g ^\ 1) . n) - (f . (lim g))).|| <= K * ||.((g . n) - (lim g)).||
||.(((g ^\ 1) . n) - (f . (lim g))).|| = ||.((g . (n + 1)) - (f . (lim g))).|| by NAT_1:def 3
.= ||.((f . (g . n)) - (f . (lim g))).|| by A2 ;
hence ||.(((g ^\ 1) . n) - (f . (lim g))).|| <= K * ||.((g . n) - (lim g)).|| by A5; :: thesis: verum
end;
A44: K (#) ||.(g - (lim g)).|| is convergent by A40, NORMSP_1:24, SEQ_2:7;
A45: lim (K (#) ||.(g - (lim g)).||) = K * (lim ||.(g - (lim g)).||) by A40, NORMSP_1:24, SEQ_2:8
.= K * 0 by A40, NORMSP_1:24 ;
for e being Real st e > 0 holds
ex n being Nat st
for m being Nat st n <= m holds
||.(((g ^\ 1) . m) - (f . (lim g))).|| < e
proof
let e be Real; :: thesis: ( e > 0 implies ex n being Nat st
for m being Nat st n <= m holds
||.(((g ^\ 1) . m) - (f . (lim g))).|| < e )

assume A46: e > 0 ; :: thesis: ex n being Nat st
for m being Nat st n <= m holds
||.(((g ^\ 1) . m) - (f . (lim g))).|| < e

consider n being Nat such that
A47: for m being Nat st n <= m holds
|.(((K (#) ||.(g - (lim g)).||) . m) - 0).| < e by A44, A45, A46, SEQ_2:def 7;
take n ; :: thesis: for m being Nat st n <= m holds
||.(((g ^\ 1) . m) - (f . (lim g))).|| < e

let m be Nat; :: thesis: ( n <= m implies ||.(((g ^\ 1) . m) - (f . (lim g))).|| < e )
assume A48: n <= m ; :: thesis: ||.(((g ^\ 1) . m) - (f . (lim g))).|| < e
|.(((K (#) ||.(g - (lim g)).||) . m) - 0).| < e by A48, A47;
then |.(K * (||.(g - (lim g)).|| . m)).| < e by SEQ_1:9;
then |.(K * ||.((g - (lim g)) . m).||).| < e by NORMSP_0:def 4;
then A49: |.(K * ||.((g . m) - (lim g)).||).| < e by NORMSP_1:def 4;
A50: K * ||.((g . m) - (lim g)).|| <= |.(K * ||.((g . m) - (lim g)).||).| by ABSVALUE:4;
A51: K * ||.((g . m) - (lim g)).|| < e by A49, A50, XXREAL_0:2;
||.(((g ^\ 1) . m) - (f . (lim g))).|| <= K * ||.((g . m) - (lim g)).|| by A43;
hence ||.(((g ^\ 1) . m) - (f . (lim g))).|| < e by A51, XXREAL_0:2; :: thesis: verum
end;
hence lim g = f . (lim g) by A42, NORMSP_1:def 7; :: thesis: verum
end;
set xp = lim g;
A52: lim g is_a_fixpoint_of f by A41;
A53: now :: thesis: for x being Point of X st f . x = x holds
x = lim g
let x be Point of X; :: thesis: ( f . x = x implies x = lim g )
assume A54: f . x = x ; :: thesis: x = lim g
A55: for k being Nat holds ||.(x - (lim g)).|| <= ||.(x - (lim g)).|| * (K to_power k)
proof
defpred S2[ Nat] means ||.(x - (lim g)).|| <= ||.(x - (lim g)).|| * (K to_power X);
A56: ||.(x - (lim g)).|| = ||.(x - (lim g)).|| * 1
.= ||.(x - (lim g)).|| * (K to_power 0) by POWER:24 ;
A57: S2[ 0 ] by A56;
A58: for k being Nat st S2[k] holds
S2[k + 1]
proof
let k be Nat; :: thesis: ( S2[k] implies S2[k + 1] )
assume A59: S2[k] ; :: thesis: S2[k + 1]
A60: ||.((f . x) - (f . (lim g))).|| <= K * ||.(x - (lim g)).|| by A5;
K * ||.(x - (lim g)).|| <= K * (||.(x - (lim g)).|| * (K to_power k)) by A59, A3, XREAL_1:64;
then ||.((f . x) - (f . (lim g))).|| <= ||.(x - (lim g)).|| * (K * (K to_power k)) by A60, XXREAL_0:2;
then ||.((f . x) - (f . (lim g))).|| <= ||.(x - (lim g)).|| * ((K to_power 1) * (K to_power k)) by POWER:25;
hence S2[k + 1] by A54, A41, A3, POWER:27; :: thesis: verum
end;
for n being Nat holds S2[n] from NAT_1:sch 2(A57, A58);
hence for k being Nat holds ||.(x - (lim g)).|| <= ||.(x - (lim g)).|| * (K to_power k) ; :: thesis: verum
end;
for e being Real st 0 < e holds
||.(x - (lim g)).|| < e
proof
let e be Real; :: thesis: ( 0 < e implies ||.(x - (lim g)).|| < e )
assume A61: 0 < e ; :: thesis: ||.(x - (lim g)).|| < e
consider n being Nat such that
A62: |.(||.(x - (lim g)).|| * (K to_power n)).| < e by Th5, A61, A3, A4;
A63: ||.(x - (lim g)).|| * (K to_power n) <= |.(||.(x - (lim g)).|| * (K to_power n)).| by ABSVALUE:4;
A64: ||.(x - (lim g)).|| * (K to_power n) < e by A63, A62, XXREAL_0:2;
||.(x - (lim g)).|| <= ||.(x - (lim g)).|| * (K to_power n) by A55;
hence ||.(x - (lim g)).|| < e by A64, XXREAL_0:2; :: thesis: verum
end;
hence x = lim g by Th4; :: thesis: verum
end;
A65: dom f = the carrier of X by FUNCT_2:def 1;
take lim g ; :: according to ORDEQ_01:def 1 :: thesis: ( lim g is_a_fixpoint_of f & ( for y being set st y is_a_fixpoint_of f holds
lim g = y ) )

thus lim g is_a_fixpoint_of f by A52; :: thesis: for y being set st y is_a_fixpoint_of f holds
lim g = y

let y be set ; :: thesis: ( y is_a_fixpoint_of f implies lim g = y )
assume A66: y is_a_fixpoint_of f ; :: thesis: lim g = y
then reconsider x1 = lim g, y1 = y as Point of X by A65;
A67: ( f . x1 = x1 & f . y1 = y1 ) by A66, A52;
thus y = lim g by A53, A67; :: thesis: verum