let n be non zero Nat; :: thesis: for X, Y being non-empty n -element FinSequence st ( for i being Nat st i in Seg n holds
X . i c= Y . i ) holds
CarProduct X c= CarProduct Y

let X, Y be non-empty n -element FinSequence; :: thesis: ( ( for i being Nat st i in Seg n holds
X . i c= Y . i ) implies CarProduct X c= CarProduct Y )

assume A1: for i being Nat st i in Seg n holds
X . i c= Y . i ; :: thesis: CarProduct X c= CarProduct Y
now :: thesis: for x being object st x in CarProduct X holds
x in CarProduct Y
let x be object ; :: thesis: ( x in CarProduct X implies x in CarProduct Y )
assume x in CarProduct X ; :: thesis: x in CarProduct Y
then consider px being n -element FinSequence such that
A2: ( px in product X & x = PtCarProduct px ) by Th6;
consider g being Function such that
A3: ( px = g & dom g = dom X & ( for i being object st i in dom X holds
g . i in X . i ) ) by A2, CARD_3:def 5;
dom X = Seg (len X) by FINSEQ_1:def 3;
then A4: dom X = Seg n by CARD_1:def 7;
dom Y = Seg (len Y) by FINSEQ_1:def 3;
then A5: dom Y = Seg n by CARD_1:def 7;
for i being object st i in dom Y holds
g . i in Y . i
proof
let i be object ; :: thesis: ( i in dom Y implies g . i in Y . i )
assume A6: i in dom Y ; :: thesis: g . i in Y . i
then reconsider j = i as Nat ;
X . j c= Y . j by A1, A6, A5;
hence g . i in Y . i by A6, A5, A4, A3; :: thesis: verum
end;
then px in product Y by A3, A4, A5, CARD_3:def 5;
hence x in CarProduct Y by A2, Th6; :: thesis: verum
end;
hence CarProduct X c= CarProduct Y ; :: thesis: verum