defpred S1[ non zero Nat] means for X being non-empty $1 -element FinSequence
for x being object holds
( x in CarProduct X iff ex px being $1 -element FinSequence st
( px in product X & x = PtCarProduct px ) );
A1:
S1[1]
A9:
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 A10:
S1[
n]
;
S1[n + 1]
let X be
non-empty n + 1
-element FinSequence;
for x being object holds
( x in CarProduct X iff ex px being n + 1 -element FinSequence st
( px in product X & x = PtCarProduct px ) )
set Xn1 =
ElmFin (
X,
(n + 1));
A11:
ElmFin (
X,
(n + 1))
= X . (n + 1)
by MEASUR13:def 1;
set Xn =
SubFin (
X,
n);
A12:
SubFin (
X,
n)
= X | n
by NAT_1:11, MEASUR13:def 5;
A13:
CarProduct X = [:(CarProduct (SubFin (X,n))),(ElmFin (X,(n + 1))):]
by MEASUR13:6;
let x be
object ;
( x in CarProduct X iff ex px being n + 1 -element FinSequence st
( px in product X & x = PtCarProduct px ) )
thus
(
x in CarProduct X iff ex
px being
n + 1
-element FinSequence st
(
px in product X &
x = PtCarProduct px ) )
verumproof
hereby ( ex px being n + 1 -element FinSequence st
( px in product X & x = PtCarProduct px ) implies x in CarProduct X )
assume
x in CarProduct X
;
ex px being n + 1 -element FinSequence st
( px in product X & x = PtCarProduct px )then consider y,
z being
object such that A14:
(
y in CarProduct (SubFin (X,n)) &
z in X . (n + 1) &
x = [y,z] )
by A11, A13, ZFMISC_1:def 2;
consider py being
n -element FinSequence such that A15:
(
py in product (SubFin (X,n)) &
y = PtCarProduct py )
by A14, A10;
A16:
ex
g being
Function st
(
py = g &
dom g = dom (SubFin (X,n)) & ( for
y being
object st
y in dom (SubFin (X,n)) holds
g . y in (SubFin (X,n)) . y ) )
by CARD_3:def 5, A15;
reconsider px =
py ^ <*z*> as
n + 1
-element FinSequence ;
A17:
len py = n
by CARD_1:def 7;
then A18:
px . (n + 1) = z
by FINSEQ_1:42;
dom px = Seg (len px)
by FINSEQ_1:def 3;
then A19:
dom px = Seg (n + 1)
by CARD_1:def 7;
dom X = Seg (len X)
by FINSEQ_1:def 3;
then A20:
dom X = Seg (n + 1)
by CARD_1:def 7;
take px =
px;
( px in product X & x = PtCarProduct px )
for
s being
object st
s in dom X holds
px . s in X . s
proof
let s be
object ;
( s in dom X implies px . s in X . s )
assume A21:
s in dom X
;
px . s in X . s
then reconsider i =
s as
Nat ;
A22:
( 1
<= i &
i <= n + 1 )
by A20, A21, FINSEQ_1:1;
per cases
( i <> n + 1 or i = n + 1 )
;
suppose
i <> n + 1
;
px . s in X . sthen
i < n + 1
by A22, XXREAL_0:1;
then
i <= n
by NAT_1:13;
then A23:
i in Seg n
by A22;
then
i in Seg (len (SubFin (X,n)))
by CARD_1:def 7;
then
i in dom (SubFin (X,n))
by FINSEQ_1:def 3;
then A24:
py . i in (SubFin (X,n)) . i
by A16;
A25:
X . i = (SubFin (X,n)) . i
by A12, A23, FUNCT_1:49;
i in dom py
by A23, A17, FINSEQ_1:def 3;
hence
px . s in X . s
by A25, A24, FINSEQ_1:def 7;
verum end; end;
end; hence
px in product X
by A19, A20, CARD_3:def 5;
x = PtCarProduct pxreconsider px1 =
px | n as
n -element FinSequence ;
dom py = Seg n
by A17, FINSEQ_1:def 3;
then
py = px | n
by FINSEQ_1:21;
hence
x = PtCarProduct px
by A18, A14, A15, Th4;
verum
end;
assume
ex
px being
n + 1
-element FinSequence st
(
px in product X &
x = PtCarProduct px )
;
x in CarProduct X
then consider px being
n + 1
-element FinSequence such that A26:
(
px in product X &
x = PtCarProduct px )
;
A27:
ex
g being
Function st
(
px = g &
dom g = dom X & ( for
y being
object st
y in dom X holds
g . y in X . y ) )
by A26, CARD_3:def 5;
reconsider py =
px | n as
n -element FinSequence ;
A28:
PtCarProduct px = [(PtCarProduct py),(px . (n + 1))]
by Th4;
dom py = Seg (len py)
by FINSEQ_1:def 3;
then A29:
dom py = Seg n
by CARD_1:def 7;
dom (SubFin (X,n)) = Seg (len (SubFin (X,n)))
by FINSEQ_1:def 3;
then A30:
dom (SubFin (X,n)) = Seg n
by CARD_1:def 7;
set y =
PtCarProduct py;
for
s being
object st
s in dom (SubFin (X,n)) holds
py . s in (SubFin (X,n)) . s
proof
let s be
object ;
( s in dom (SubFin (X,n)) implies py . s in (SubFin (X,n)) . s )
assume A31:
s in dom (SubFin (X,n))
;
py . s in (SubFin (X,n)) . s
then reconsider i =
s as
Nat ;
A32:
(
(SubFin (X,n)) . i = X . i &
py . i = px . i )
by A12, A31, A30, FUNCT_1:49;
Seg n c= Seg (n + 1)
by FINSEQ_3:18;
then
i in Seg (n + 1)
by A31, A30;
then
i in Seg (len X)
by CARD_1:def 7;
then
i in dom X
by FINSEQ_1:def 3;
hence
py . s in (SubFin (X,n)) . s
by A27, A32;
verum
end;
then
py in product (SubFin (X,n))
by A29, A30, CARD_3:def 5;
then A33:
PtCarProduct py in CarProduct (SubFin (X,n))
by A10;
n + 1
in Seg (n + 1)
by FINSEQ_1:4;
then
n + 1
in Seg (len X)
by CARD_1:def 7;
then
n + 1
in dom X
by FINSEQ_1:def 3;
then
px . (n + 1) in ElmFin (
X,
(n + 1))
by A11, A27;
hence
x in CarProduct X
by A28, A33, A13, A26, ZFMISC_1:87;
verum
end;
end;
for n being non zero Nat holds S1[n]
from NAT_1:sch 10(A1, A9);
hence
for n being non zero Nat
for X being non-empty b1 -element FinSequence
for x being object holds
( x in CarProduct X iff ex px being b1 -element FinSequence st
( px in product X & x = PtCarProduct px ) )
; verum