let n be non zero Nat; :: thesis: for D being non-empty n -element FinSequence
for px being n -element FinSequence holds
( PtCarProduct px in CarProduct D iff for i being Nat st i in Seg n holds
px . i in D . i )

let D be non-empty n -element FinSequence; :: thesis: for px being n -element FinSequence holds
( PtCarProduct px in CarProduct D iff for i being Nat st i in Seg n holds
px . i in D . i )

let px be n -element FinSequence; :: thesis: ( PtCarProduct px in CarProduct D iff for i being Nat st i in Seg n holds
px . i in D . i )

dom D = Seg (len D) by FINSEQ_1:def 3;
then A1: dom D = Seg n by CARD_1:def 7;
dom px = Seg (len px) by FINSEQ_1:def 3;
then A2: dom px = Seg n by CARD_1:def 7;
hereby :: thesis: ( ( for i being Nat st i in Seg n holds
px . i in D . i ) implies PtCarProduct px in CarProduct D )
assume PtCarProduct px in CarProduct D ; :: thesis: for i being Nat st i in Seg n holds
px . i in D . i

then consider py being n -element FinSequence such that
A3: ( py in product D & PtCarProduct px = PtCarProduct py ) by Th6;
px = py by A3, Th5;
then ex g being Function st
( px = g & dom g = dom D & ( for i being object st i in dom D holds
g . i in D . i ) ) by A3, CARD_3:def 5;
hence for i being Nat st i in Seg n holds
px . i in D . i by A1; :: thesis: verum
end;
assume for i being Nat st i in Seg n holds
px . i in D . i ; :: thesis: PtCarProduct px in CarProduct D
then for i being object st i in dom D holds
px . i in D . i by A1;
then px in product D by A1, A2, CARD_3:def 5;
hence PtCarProduct px in CarProduct D by Th6; :: thesis: verum