defpred S1[ non zero Nat] means for p1, p2 being $1 -element FinSequence holds
( PtCarProduct p1 = PtCarProduct p2 iff p1 = p2 );
A1: S1[1]
proof
let p1, p2 be 1 -element FinSequence; :: thesis: ( PtCarProduct p1 = PtCarProduct p2 iff p1 = p2 )
hereby :: thesis: ( p1 = p2 implies PtCarProduct p1 = PtCarProduct p2 )
assume A2: PtCarProduct p1 = PtCarProduct p2 ; :: thesis: p1 = p2
A3: PtCarProduct p2 = p2 . 1 by Def1;
A4: ( len p1 = 1 & len p2 = 1 ) by CARD_1:def 7;
then p1 = <*(p1 . 1)*> by FINSEQ_1:40;
hence p1 = p2 by A2, A3, A4, Def1, FINSEQ_1:40; :: thesis: verum
end;
thus ( p1 = p2 implies PtCarProduct p1 = PtCarProduct p2 ) ; :: thesis: verum
end;
A5: 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 A6: S1[n] ; :: thesis: S1[n + 1]
let p1, p2 be n + 1 -element FinSequence; :: thesis: ( PtCarProduct p1 = PtCarProduct p2 iff p1 = p2 )
hereby :: thesis: ( p1 = p2 implies PtCarProduct p1 = PtCarProduct p2 )
assume A7: PtCarProduct p1 = PtCarProduct p2 ; :: thesis: p1 = p2
reconsider q1 = p1 | n, q2 = p2 | n as n -element FinSequence ;
( PtCarProduct p1 = [(PtCarProduct q1),(p1 . (n + 1))] & PtCarProduct p2 = [(PtCarProduct q2),(p2 . (n + 1))] ) by Th4;
then A8: ( PtCarProduct q1 = PtCarProduct q2 & p1 . (n + 1) = p2 . (n + 1) ) by A7, XTUPLE_0:1;
A9: ( len p1 = n + 1 & len p2 = n + 1 ) by CARD_1:def 7;
then p1 = q1 ^ <*(p1 . (n + 1))*> by FINSEQ_3:55;
hence p1 = p2 by A6, A8, A9, FINSEQ_3:55; :: thesis: verum
end;
thus ( p1 = p2 implies PtCarProduct p1 = PtCarProduct p2 ) ; :: thesis: verum
end;
for n being non zero Nat holds S1[n] from NAT_1:sch 10(A1, A5);
hence for n being non zero Nat
for p1, p2 being b1 -element FinSequence holds
( PtCarProduct p1 = PtCarProduct p2 iff p1 = p2 ) ; :: thesis: verum