let n, m be non zero Nat; for p being n -element FinSequence
for q being m -element FinSequence st m <= n & q = p | m holds
PtProdFinSeq q = (PtProdFinSeq p) | m
let p be n -element FinSequence; for q being m -element FinSequence st m <= n & q = p | m holds
PtProdFinSeq q = (PtProdFinSeq p) | m
let q be m -element FinSequence; ( m <= n & q = p | m implies PtProdFinSeq q = (PtProdFinSeq p) | m )
assume that
A1:
m <= n
and
A2:
q = p | m
; PtProdFinSeq q = (PtProdFinSeq p) | m
1 <= m
by NAT_1:14;
then A3:
1 in Seg m
;
then A4:
((PtProdFinSeq p) | m) . 1 = (PtProdFinSeq p) . 1
by FUNCT_1:49;
defpred S1[ Nat, object , object ] means $3 = [$2,(p . ($1 + 1))];
A5:
for k being Nat st 1 <= k & k < m holds
for x, y1, y2 being set st S1[k,x,y1] & S1[k,x,y2] holds
y1 = y2
;
A6:
for k being Nat st 1 <= k & k < m holds
S1[k,(PtProdFinSeq q) . k,(PtProdFinSeq q) . (k + 1)]
proof
let k be
Nat;
( 1 <= k & k < m implies S1[k,(PtProdFinSeq q) . k,(PtProdFinSeq q) . (k + 1)] )
assume that A7:
1
<= k
and A8:
k < m
;
S1[k,(PtProdFinSeq q) . k,(PtProdFinSeq q) . (k + 1)]
reconsider k1 =
k as non
zero Nat by A7;
( 1
<= k1 + 1 &
k1 + 1
<= m )
by A7, A8, NAT_1:13;
then
k1 + 1
in Seg m
;
then
q . (k1 + 1) = p . (k1 + 1)
by A2, FUNCT_1:49;
hence
S1[
k,
(PtProdFinSeq q) . k,
(PtProdFinSeq q) . (k + 1)]
by A8, Def1;
verum
end;
A9:
for k being Nat st 1 <= k & k < m holds
S1[k,((PtProdFinSeq p) | m) . k,((PtProdFinSeq p) | m) . (k + 1)]
proof
let k be
Nat;
( 1 <= k & k < m implies S1[k,((PtProdFinSeq p) | m) . k,((PtProdFinSeq p) | m) . (k + 1)] )
assume that A10:
1
<= k
and A11:
k < m
;
S1[k,((PtProdFinSeq p) | m) . k,((PtProdFinSeq p) | m) . (k + 1)]
reconsider k1 =
k as non
zero Nat by A10;
A12:
k1 < n
by A1, A11, XXREAL_0:2;
( 1
<= k1 + 1 &
k1 + 1
<= m )
by A10, A11, NAT_1:13;
then
k1 + 1
in Seg m
;
then A13:
((PtProdFinSeq p) | m) . (k + 1) = (PtProdFinSeq p) . (k + 1)
by FUNCT_1:49;
k in Seg m
by A10, A11;
then
((PtProdFinSeq p) | m) . k = (PtProdFinSeq p) . k
by FUNCT_1:49;
hence
S1[
k,
((PtProdFinSeq p) | m) . k,
((PtProdFinSeq p) | m) . (k + 1)]
by A13, A12, Def1;
verum
end;
(PtProdFinSeq q) . 1 = q . 1
by Def1;
then A14:
( len (PtProdFinSeq q) = m & ( (PtProdFinSeq q) . 1 = p . 1 or m = 0 ) & ( for k being Nat st 1 <= k & k < m holds
S1[k,(PtProdFinSeq q) . k,(PtProdFinSeq q) . (k + 1)] ) )
by A6, A2, A3, FUNCT_1:49, CARD_1:def 7;
len (PtProdFinSeq p) = n
by CARD_1:def 7;
then A15:
( len ((PtProdFinSeq p) | m) = m & ( ((PtProdFinSeq p) | m) . 1 = p . 1 or m = 0 ) & ( for k being Nat st 1 <= k & k < m holds
S1[k,((PtProdFinSeq p) | m) . k,((PtProdFinSeq p) | m) . (k + 1)] ) )
by A4, A9, A1, Def1, FINSEQ_1:59;
thus
PtProdFinSeq q = (PtProdFinSeq p) | m
from RECDEF_1:sch 7(A5, A14, A15); verum