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]
proof
let X be non-empty 1 -element FinSequence; :: thesis: for x being object holds
( x in CarProduct X iff ex px being 1 -element FinSequence st
( px in product X & x = PtCarProduct px ) )

set P = ProdFinSeq X;
A2: CarProduct X = X . 1 by MEASUR13:def 3;
let x be object ; :: thesis: ( x in CarProduct X iff ex px being 1 -element FinSequence st
( px in product X & x = PtCarProduct px ) )

hereby :: thesis: ( ex px being 1 -element FinSequence st
( px in product X & x = PtCarProduct px ) implies x in CarProduct X )
assume A3: x in CarProduct X ; :: thesis: ex px being 1 -element FinSequence st
( px in product X & x = PtCarProduct px )

reconsider px = <*x*> as 1 -element FinSequence ;
take px = px; :: thesis: ( px in product X & x = PtCarProduct px )
( dom px = Seg (len px) & dom X = Seg (len X) ) by FINSEQ_1:def 3;
then A4: ( dom px = Seg 1 & dom X = Seg 1 ) by CARD_1:def 7;
now :: thesis: for s being object st s in dom X holds
px . s in X . s
let s be object ; :: thesis: ( s in dom X implies px . s in X . s )
assume A5: s in dom X ; :: thesis: px . s in X . s
then reconsider i = s as Nat ;
i = 1 by A4, A5, FINSEQ_1:2, TARSKI:def 1;
hence px . s in X . s by A3, MEASUR13:def 3; :: thesis: verum
end;
hence px in product X by A4, CARD_3:def 5; :: thesis: x = PtCarProduct px
( (PtProdFinSeq px) . 1 = px . 1 & ( for i being non zero Nat st i < 1 holds
(PtProdFinSeq px) . (i + 1) = [((PtProdFinSeq px) . i),(px . (i + 1))] ) ) by Def1;
hence x = PtCarProduct px ; :: thesis: verum
end;
given px being 1 -element FinSequence such that A6: ( px in product X & x = PtCarProduct px ) ; :: thesis: x in CarProduct X
A7: 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 A6, CARD_3:def 5;
A8: PtCarProduct px = px . 1 by Def1;
1 in Seg 1 ;
then 1 in Seg (len X) by CARD_1:def 7;
then 1 in dom X by FINSEQ_1:def 3;
hence x in CarProduct X by A2, A6, A8, A7; :: thesis: verum
end;
A9: for n being non zero Nat st S1[n] holds
S1[n + 1]
proof
let n be non zero Nat; :: thesis: ( S1[n] implies S1[n + 1] )
assume A10: S1[n] ; :: thesis: S1[n + 1]
let X be non-empty n + 1 -element FinSequence; :: thesis: 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 ; :: thesis: ( 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 ) ) :: thesis: verum
proof
hereby :: thesis: ( 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 ; :: thesis: 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; :: thesis: ( 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 ; :: thesis: ( s in dom X implies px . s in X . s )
assume A21: s in dom X ; :: thesis: px . s in X . s
then reconsider i = s as Nat ;
A22: ( 1 <= i & i <= n + 1 ) by A20, A21, FINSEQ_1:1;
end;
hence px in product X by A19, A20, CARD_3:def 5; :: thesis: x = PtCarProduct px
reconsider 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; :: thesis: verum
end;
assume ex px being n + 1 -element FinSequence st
( px in product X & x = PtCarProduct px ) ; :: thesis: 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 ; :: thesis: ( s in dom (SubFin (X,n)) implies py . s in (SubFin (X,n)) . s )
assume A31: s in dom (SubFin (X,n)) ; :: thesis: 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; :: thesis: 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; :: thesis: 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 ) ) ; :: thesis: verum