defpred S1[ non zero Nat] means for X being $1 -element RealNormSpace-Sequence
for x being Point of (CarProduct X)
for px being $1 -element FinSequence st x = PtCarProduct px holds
ex nrx being Element of REAL $1 st
( ( for i being non zero Nat st i <= $1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| );
A1:
S1[1]
proof
let X be 1
-element RealNormSpace-Sequence;
for x being Point of (CarProduct X)
for px being 1 -element FinSequence st x = PtCarProduct px holds
ex nrx being Element of REAL 1 st
( ( for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| )
set X1 =
ElmFin (
X,1);
ElmFin (
X,1)
= X . 1
by Def3;
then A2:
CarProduct X = ElmFin (
X,1)
by Def4;
let x be
Point of
(CarProduct X);
for px being 1 -element FinSequence st x = PtCarProduct px holds
ex nrx being Element of REAL 1 st
( ( for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| )let px be 1
-element FinSequence;
( x = PtCarProduct px implies ex nrx being Element of REAL 1 st
( ( for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| ) )
assume A3:
x = PtCarProduct px
;
ex nrx being Element of REAL 1 st
( ( for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| )
then
ex
pxi being
Point of
(ElmFin (X,1)) st
pxi = px . 1
by Th17;
then reconsider px1 =
px . 1 as
Point of
(ElmFin (X,1)) ;
<*||.px1.||*> in 1
-tuples_on REAL
by FINSEQ_2:98;
then reconsider nrx =
<*||.px1.||*> as
Element of
REAL 1
by EUCLID:def 1;
take
nrx
;
( ( for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| )
A4:
x = px1
by A3, Def1;
A5:
|.nrx.| = |.||.px1.||.|
by Lm3;
hence
( ( for
i being non
zero Nat st
i <= 1 holds
ex
pxi being
Point of
(ElmFin (X,i)) st
(
pxi = px . i &
nrx . i = ||.pxi.|| ) ) &
||.x.|| = |.nrx.| )
by A5, A4, A2, COMPLEX1:43;
verum
end;
A7:
for n being non zero Nat st S1[n] holds
S1[n + 1]
proof
let n be non
zero Nat;
( S1[n] implies S1[n + 1] )
assume A8:
S1[
n]
;
S1[n + 1]
let X be
n + 1
-element RealNormSpace-Sequence;
for x being Point of (CarProduct X)
for px being n + 1 -element FinSequence st x = PtCarProduct px holds
ex nrx being Element of REAL (n + 1) st
( ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| )
set Xn =
SubFin (
X,
n);
set Xn1 =
ElmFin (
X,
(n + 1));
A9:
n <= n + 1
by NAT_1:11;
A10:
(
SubFin (
X,
n)
= X | n &
ElmFin (
X,
(n + 1))
= X . (n + 1) )
by Def6, Def3, NAT_1:11;
A11:
CarProduct X = [:(CarProduct (SubFin (X,n))),(ElmFin (X,(n + 1))):]
by Th10;
let x be
Point of
(CarProduct X);
for px being n + 1 -element FinSequence st x = PtCarProduct px holds
ex nrx being Element of REAL (n + 1) st
( ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| )let px be
n + 1
-element FinSequence;
( x = PtCarProduct px implies ex nrx being Element of REAL (n + 1) st
( ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| ) )
assume A12:
x = PtCarProduct px
;
ex nrx being Element of REAL (n + 1) st
( ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| )
reconsider px1 =
px | n as
n -element FinSequence ;
A13:
PtCarProduct px = [(PtCarProduct px1),(px . (n + 1))]
by Th4;
for
i being non
zero Nat st
i <= n holds
ex
px1i being
Point of
(ElmFin ((SubFin (X,n)),i)) st
px1i = px1 . i
proof
let i be non
zero Nat;
( i <= n implies ex px1i being Point of (ElmFin ((SubFin (X,n)),i)) st px1i = px1 . i )
assume A14:
i <= n
;
ex px1i being Point of (ElmFin ((SubFin (X,n)),i)) st px1i = px1 . i
1
<= i
by NAT_1:14;
then
i in Seg n
by A14;
then A15:
(
(SubFin (X,n)) . i = X . i &
px1 . i = px . i )
by A10, FUNCT_1:49;
ElmFin (
(SubFin (X,n)),
i)
= ElmFin (
X,
i)
by A9, A14, Th13;
hence
ex
px1i being
Point of
(ElmFin ((SubFin (X,n)),i)) st
px1i = px1 . i
by A12, A15, A9, A14, Th17, XXREAL_0:2;
verum
end;
then reconsider x1 =
PtCarProduct px1 as
Point of
(CarProduct (SubFin (X,n))) by Th16;
consider prx1 being
Element of
REAL n such that A16:
( ( for
i being non
zero Nat st
i <= n holds
ex
px1i being
Point of
(ElmFin ((SubFin (X,n)),i)) st
(
px1i = px1 . i &
prx1 . i = ||.px1i.|| ) ) &
||.x1.|| = |.prx1.| )
by A8;
ex
pxi being
Point of
(ElmFin (X,(n + 1))) st
pxi = px . (n + 1)
by A12, Th17;
then reconsider pxn =
px . (n + 1) as
Point of
(ElmFin (X,(n + 1))) ;
consider w being
Element of
REAL 2
such that A17:
(
w = <*||.x1.||,||.pxn.||*> &
||.x.|| = |.w.| )
by A11, A13, A12, PRVECT_3:18;
reconsider pp =
||.pxn.|| as
Element of
REAL ;
set qq =
<*pp*>;
set prx =
prx1 ^ <*pp*>;
A18:
len prx1 = n
by CARD_1:def 7;
len (prx1 ^ <*pp*>) = n + 1
by CARD_1:def 7;
then
prx1 ^ <*pp*> is
Element of
(n + 1) -tuples_on REAL
by FINSEQ_2:92;
then reconsider prx =
prx1 ^ <*pp*> as
Element of
REAL (n + 1) by EUCLID:def 1;
take
prx
;
( ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & prx . i = ||.pxi.|| ) ) & ||.x.|| = |.prx.| )
for
i being non
zero Nat st
i <= n + 1 holds
ex
pxi being
Point of
(ElmFin (X,i)) st
(
pxi = px . i &
prx . i = ||.pxi.|| )
proof
let i be non
zero Nat;
( i <= n + 1 implies ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & prx . i = ||.pxi.|| ) )
assume A19:
i <= n + 1
;
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & prx . i = ||.pxi.|| )
A20:
1
<= i
by NAT_1:14;
per cases
( i <> n + 1 or i = n + 1 )
;
suppose
i <> n + 1
;
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & prx . i = ||.pxi.|| )then
i < n + 1
by A19, XXREAL_0:1;
then A21:
i <= n
by NAT_1:13;
then A22:
i in Seg n
by A20;
i in dom prx1
by A18, A20, A21, FINSEQ_3:25;
then A23:
prx . i = prx1 . i
by FINSEQ_1:def 7;
A24:
ex
px1i being
Point of
(ElmFin ((SubFin (X,n)),i)) st
(
px1i = px1 . i &
prx1 . i = ||.px1i.|| )
by A16, A21;
ElmFin (
X,
i)
= ElmFin (
(SubFin (X,n)),
i)
by A21, A9, Th13;
hence
ex
pxi being
Point of
(ElmFin (X,i)) st
(
pxi = px . i &
prx . i = ||.pxi.|| )
by A22, A23, A24, FUNCT_1:49;
verum end; end;
end;
hence
( ( for
i being non
zero Nat st
i <= n + 1 holds
ex
pxi being
Point of
(ElmFin (X,i)) st
(
pxi = px . i &
prx . i = ||.pxi.|| ) ) &
||.x.|| = |.prx.| )
by A17, A16, Lm4;
verum
end;
for n being non zero Nat holds S1[n]
from NAT_1:sch 10(A1, A7);
hence
for n being non zero Nat
for X being b1 -element RealNormSpace-Sequence
for x being Point of (CarProduct X)
for px being b1 -element FinSequence st x = PtCarProduct px holds
ex nrx being Element of REAL n st
( ( for i being non zero Nat st i <= n holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & nrx . i = ||.pxi.|| ) ) & ||.x.|| = |.nrx.| )
; verum