defpred S1[ non zero Nat] means for X being $1 -element RealNormSpace-Sequence
for x being object holds
( x is Point of (CarProduct X) iff ex px being $1 -element FinSequence st
( x = PtCarProduct px & ( for i being non zero Nat st i <= $1 holds
ex pxi being Point of (ElmFin (X,i)) st pxi = px . i ) ) );
A1:
S1[1]
A6:
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 A7:
S1[
n]
;
S1[n + 1]
let X be
n + 1
-element RealNormSpace-Sequence;
for x being object holds
( x is Point of (CarProduct X) iff ex px being n + 1 -element FinSequence st
( x = PtCarProduct px & ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st pxi = px . i ) ) )let x be
object ;
( x is Point of (CarProduct X) iff ex px being n + 1 -element FinSequence st
( x = PtCarProduct px & ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st pxi = px . i ) ) )
set Xn =
SubFin (
X,
n);
set Xn1 =
ElmFin (
X,
(n + 1));
A8:
n <= n + 1
by NAT_1:11;
A9:
(
SubFin (
X,
n)
= X | n &
ElmFin (
X,
(n + 1))
= X . (n + 1) )
by Def6, Def3, NAT_1:11;
A10:
CarProduct X = [:(CarProduct (SubFin (X,n))),(ElmFin (X,(n + 1))):]
by Th10;
hereby ( ex px being n + 1 -element FinSequence st
( x = PtCarProduct px & ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st pxi = px . i ) ) implies x is Point of (CarProduct X) )
assume
x is
Point of
(CarProduct X)
;
ex px being n + 1 -element FinSequence st
( x = PtCarProduct px & ( for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st pxi = px . i ) )then consider y being
Point of
(CarProduct (SubFin (X,n))),
z being
Point of
(ElmFin (X,(n + 1))) such that A12:
x = [y,z]
by A10, PRVECT_3:18;
consider py being
n -element FinSequence such that A13:
(
y = PtCarProduct py & ( for
i being non
zero Nat st
i <= n holds
ex
pyi being
Point of
(ElmFin ((SubFin (X,n)),i)) st
pyi = py . i ) )
by A7;
reconsider px =
py ^ <*z*> as
n + 1
-element FinSequence ;
A14:
len py = n
by CARD_1:def 7;
then A15:
px . (n + 1) = z
by FINSEQ_1:42;
A16:
for
i being non
zero Nat st
i <= n + 1 holds
ex
pxi being
Point of
(ElmFin (X,i)) st
pxi = px . i
proof
let i be non
zero Nat;
( i <= n + 1 implies ex pxi being Point of (ElmFin (X,i)) st pxi = px . i )
assume A17:
i <= n + 1
;
ex pxi being Point of (ElmFin (X,i)) st pxi = px . i
A18:
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 . ithen
i < n + 1
by A17, XXREAL_0:1;
then A19:
i <= n
by NAT_1:13;
then
i in dom py
by A14, A18, FINSEQ_3:25;
then A20:
px . i = py . i
by FINSEQ_1:def 7;
ElmFin (
X,
i)
= ElmFin (
(SubFin (X,n)),
i)
by A8, A19, Th13;
hence
ex
pxi being
Point of
(ElmFin (X,i)) st
pxi = px . i
by A13, A19, A20;
verum end; end;
end;
dom py = Seg n
by A14, FINSEQ_1:def 3;
then A21:
py = px | n
by FINSEQ_1:21;
reconsider px1 =
px | n as
n -element FinSequence ;
PtCarProduct px = [(PtCarProduct px1),(px . (n + 1))]
by Th4;
hence
ex
px being
n + 1
-element FinSequence st
(
x = PtCarProduct px & ( for
i being non
zero Nat st
i <= n + 1 holds
ex
pxi being
Point of
(ElmFin (X,i)) st
pxi = px . i ) )
by A16, A15, A21, A12, A13;
verum
end;
assume
ex
px being
n + 1
-element FinSequence st
(
x = PtCarProduct px & ( for
i being non
zero Nat st
i <= n + 1 holds
ex
pxi being
Point of
(ElmFin (X,i)) st
pxi = px . i ) )
;
x is Point of (CarProduct X)
then consider px being
n + 1
-element FinSequence such that A22:
( ( for
i being non
zero Nat st
i <= n + 1 holds
ex
pxi being
Point of
(ElmFin (X,i)) st
pxi = px . i ) &
x = PtCarProduct px )
;
A23:
n <= n + 1
by NAT_1:11;
reconsider py =
px | n as
n -element FinSequence ;
for
i being non
zero Nat st
i <= n holds
ex
pyi being
Point of
(ElmFin ((SubFin (X,n)),i)) st
pyi = py . i
proof
let i be non
zero Nat;
( i <= n implies ex pyi being Point of (ElmFin ((SubFin (X,n)),i)) st pyi = py . i )
assume A24:
i <= n
;
ex pyi being Point of (ElmFin ((SubFin (X,n)),i)) st pyi = py . i
1
<= i
by NAT_1:14;
then
i in Seg n
by A24;
then A25:
(
(SubFin (X,n)) . i = X . i &
py . i = px . i )
by A9, FUNCT_1:49;
ElmFin (
(SubFin (X,n)),
i)
= ElmFin (
X,
i)
by A23, A24, Th13;
hence
ex
pyi being
Point of
(ElmFin ((SubFin (X,n)),i)) st
pyi = py . i
by A22, A25, A23, A24, XXREAL_0:2;
verum
end;
then reconsider y =
PtCarProduct py as
Point of
(CarProduct (SubFin (X,n))) by A7;
ex
pxi being
Point of
(ElmFin (X,(n + 1))) st
pxi = px . (n + 1)
by A22;
then reconsider z =
px . (n + 1) as
Point of
(ElmFin (X,(n + 1))) ;
PtCarProduct px = [y,z]
by Th4;
hence
x is
Point of
(CarProduct X)
by A22, Th10;
verum
end;
for n being non zero Nat holds S1[n]
from NAT_1:sch 10(A1, A6);
hence
for n being non zero Nat
for X being b1 -element RealNormSpace-Sequence
for x being object holds
( x is Point of (CarProduct X) iff ex px being b1 -element FinSequence st
( x = PtCarProduct px & ( for i being non zero Nat st i <= n holds
ex pxi being Point of (ElmFin (X,i)) st pxi = px . i ) ) )
; verum