let n be non zero Nat; :: thesis: for p being n + 1 -element FinSequence
for q being n -element FinSequence st q = p | n holds
PtCarProduct p = [(PtCarProduct q),(p . (n + 1))]

let p be n + 1 -element FinSequence; :: thesis: for q being n -element FinSequence st q = p | n holds
PtCarProduct p = [(PtCarProduct q),(p . (n + 1))]

let q be n -element FinSequence; :: thesis: ( q = p | n implies PtCarProduct p = [(PtCarProduct q),(p . (n + 1))] )
assume q = p | n ; :: thesis: PtCarProduct p = [(PtCarProduct q),(p . (n + 1))]
then A1: PtCarProduct q = ((PtProdFinSeq p) | n) . n by Th3, NAT_1:12;
n < n + 1 by NAT_1:13;
then PtCarProduct p = [((PtProdFinSeq p) . n),(p . (n + 1))] by Def1;
hence PtCarProduct p = [(PtCarProduct q),(p . (n + 1))] by A1, FINSEQ_1:3, FUNCT_1:49; :: thesis: verum