defpred S1[ non zero Nat] means for X being $1 -element RealNormSpace-Sequence ex CX being non-empty $1 -element FinSequence st
( CarProduct CX = the carrier of (CarProduct X) & ( for i being non zero Nat st i <= $1 holds
CX . i = the carrier of (ElmFin (X,i)) ) );
A1:
S1[1]
A3:
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 A4:
S1[
n]
;
S1[n + 1]
let X be
n + 1
-element RealNormSpace-Sequence;
ex CX being non-empty n + 1 -element FinSequence st
( CarProduct CX = the carrier of (CarProduct X) & ( for i being non zero Nat st i <= n + 1 holds
CX . i = the carrier of (ElmFin (X,i)) ) )
set Xn1 =
SubFin (
X,
n);
set Xn11 =
ElmFin (
X,
(n + 1));
A5:
CarProduct X = [:(CarProduct (SubFin (X,n))),(ElmFin (X,(n + 1))):]
by Th10;
consider CXn1 being
non-empty n -element FinSequence such that A6:
(
CarProduct CXn1 = the
carrier of
(CarProduct (SubFin (X,n))) & ( for
i being non
zero Nat st
i <= n holds
CXn1 . i = the
carrier of
(ElmFin ((SubFin (X,n)),i)) ) )
by A4;
reconsider CX =
CXn1 ^ <* the carrier of (ElmFin (X,(n + 1)))*> as
n + 1
-element FinSequence ;
A7:
len CXn1 = n
by CARD_1:def 7;
not
{} in rng CX
then reconsider CX =
CX as
non-empty n + 1
-element FinSequence by RELAT_1:def 9;
take
CX
;
( CarProduct CX = the carrier of (CarProduct X) & ( for i being non zero Nat st i <= n + 1 holds
CX . i = the carrier of (ElmFin (X,i)) ) )
A11:
CX . (n + 1) = the
carrier of
(ElmFin (X,(n + 1)))
by A7, FINSEQ_1:42;
A12:
ElmFin (
CX,
(n + 1))
= CX . (n + 1)
by MEASUR13:def 1;
A13:
dom CXn1 = Seg n
by A7, FINSEQ_1:def 3;
then A14:
CX | n = CXn1
by FINSEQ_1:21;
SubFin (
CX,
n)
= CX | n
by NAT_1:11, MEASUR13:def 5;
hence
CarProduct CX = the
carrier of
(CarProduct X)
by A5, A6, A11, A12, A14, MEASUR13:6;
for i being non zero Nat st i <= n + 1 holds
CX . i = the carrier of (ElmFin (X,i))
now for i being non zero Nat st i <= n + 1 holds
CX . i = the carrier of (ElmFin (X,i))let i be non
zero Nat;
( i <= n + 1 implies CX . b1 = the carrier of (ElmFin (X,b1)) )assume A15:
i <= n + 1
;
CX . b1 = the carrier of (ElmFin (X,b1))per cases
( i <> n + 1 or i = n + 1 )
;
suppose
i <> n + 1
;
CX . b1 = the carrier of (ElmFin (X,b1))then
i < n + 1
by A15, XXREAL_0:1;
then A16:
i <= n
by NAT_1:13;
then A17:
CXn1 . i = the
carrier of
(ElmFin ((SubFin (X,n)),i))
by A6;
1
<= i
by NAT_1:14;
then A18:
i in Seg n
by A16;
SubFin (
X,
n)
= X | n
by Def6, NAT_1:11;
then
X . i = (SubFin (X,n)) . i
by A18, FUNCT_1:49;
then
ElmFin (
X,
i)
= (SubFin (X,n)) . i
by A15, Def3;
then
ElmFin (
X,
i)
= ElmFin (
(SubFin (X,n)),
i)
by A16, Def3;
hence
CX . i = the
carrier of
(ElmFin (X,i))
by A13, A18, A17, FINSEQ_1:def 7;
verum end; end; end;
hence
for
i being non
zero Nat st
i <= n + 1 holds
CX . i = the
carrier of
(ElmFin (X,i))
;
verum
end;
for n being non zero Nat holds S1[n]
from NAT_1:sch 10(A1, A3);
hence
for n being non zero Nat
for X being b1 -element RealNormSpace-Sequence ex CX being non-empty b1 -element FinSequence st
( CarProduct CX = the carrier of (CarProduct X) & ( for i being non zero Nat st i <= n holds
CX . i = the carrier of (ElmFin (X,i)) ) )
; verum