defpred S1[ non zero Nat] means for X being $1 -element RealNormSpace-Sequence
for r being Real
for x being Point of (CarProduct X)
for px being $1 -element FinSequence st x = PtCarProduct px holds
ex prx being $1 -element FinSequence st r * x = PtCarProduct prx;
A1:
S1[1]
A4:
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 A5:
S1[
n]
;
S1[n + 1]
let X be
n + 1
-element RealNormSpace-Sequence;
for r being Real
for x being Point of (CarProduct X)
for px being n + 1 -element FinSequence st x = PtCarProduct px holds
ex prx being n + 1 -element FinSequence st r * x = PtCarProduct prx
set n1 =
n + 1;
set Xn1 =
SubFin (
X,
n);
set Xn11 =
ElmFin (
X,
(n + 1));
A6:
n <= n + 1
by NAT_1:11;
A7:
(
SubFin (
X,
n)
= X | n &
ElmFin (
X,
(n + 1))
= X . (n + 1) )
by Def6, Def3, NAT_1:11;
A8:
CarProduct X = [:(CarProduct (SubFin (X,n))),(ElmFin (X,(n + 1))):]
by Th10;
let r be
Real;
for x being Point of (CarProduct X)
for px being n + 1 -element FinSequence st x = PtCarProduct px holds
ex prx being n + 1 -element FinSequence st r * x = PtCarProduct prxlet x be
Point of
(CarProduct X);
for px being n + 1 -element FinSequence st x = PtCarProduct px holds
ex prx being n + 1 -element FinSequence st r * x = PtCarProduct prxlet px be
n + 1
-element FinSequence;
( x = PtCarProduct px implies ex prx being n + 1 -element FinSequence st r * x = PtCarProduct prx )
assume A9:
x = PtCarProduct px
;
ex prx being n + 1 -element FinSequence st r * x = PtCarProduct prx
reconsider px1 =
px | n as
n -element FinSequence ;
A10:
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 A11:
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 A11;
then A12:
(
(SubFin (X,n)) . i = X . i &
px1 . i = px . i )
by A7, FUNCT_1:49;
ElmFin (
(SubFin (X,n)),
i)
= ElmFin (
X,
i)
by A6, A11, Th13;
hence
ex
px1i being
Point of
(ElmFin ((SubFin (X,n)),i)) st
px1i = px1 . i
by A9, A12, A6, A11, Th17, XXREAL_0:2;
verum
end;
then reconsider x1 =
PtCarProduct px1 as
Point of
(CarProduct (SubFin (X,n))) by Th16;
consider prx1 being
n -element FinSequence such that A13:
r * x1 = PtCarProduct prx1
by A5;
ex
pxi being
Point of
(ElmFin (X,(n + 1))) st
pxi = px . (n + 1)
by A9, Th17;
then reconsider pxn =
px . (n + 1) as
Point of
(ElmFin (X,(n + 1))) ;
A14:
r * x = [(PtCarProduct prx1),(r * pxn)]
by A10, A9, A13, A8, PRVECT_3:18;
reconsider prx =
prx1 ^ <*(r * pxn)*> as
n + 1
-element FinSequence ;
take
prx
;
r * x = PtCarProduct prx
A15:
len prx1 = n
by CARD_1:def 7;
then A16:
prx . (n + 1) = r * pxn
by FINSEQ_1:42;
dom prx1 = Seg n
by A15, FINSEQ_1:def 3;
then
prx1 = prx | n
by FINSEQ_1:21;
hence
r * x = PtCarProduct prx
by A16, A14, Th4;
verum
end;
for n being non zero Nat holds S1[n]
from NAT_1:sch 10(A1, A4);
hence
for n being non zero Nat
for X being b1 -element RealNormSpace-Sequence
for r being Real
for x being Point of (CarProduct X)
for px being b1 -element FinSequence st x = PtCarProduct px holds
ex prx being b1 -element FinSequence st r * x = PtCarProduct prx
; verum