set d = Del (f,n);
per cases
( n in dom f or not n in dom f )
;
suppose A1:
n in dom f
;
Del (f,n) is decreasing then consider m being
Nat such that A2:
len f = m + 1
and A3:
len (Del (f,n)) = m
by FINSEQ_3:104;
let i,
j be
Nat;
SEQM_3:def 2 ( not i in proj1 (Del (f,n)) or not j in proj1 (Del (f,n)) or j <= i or not (Del (f,n)) . i <= (Del (f,n)) . j )assume that A4:
i in dom (Del (f,n))
and A5:
j in dom (Del (f,n))
and A6:
i < j
;
not (Del (f,n)) . i <= (Del (f,n)) . jA7:
dom (Del (f,n)) c= dom f
by WSIERP_1:39;
A8:
(
i <= len (Del (f,n)) &
j <= len (Del (f,n)) )
by A4, A5, FINSEQ_3:25;
A9:
1
<= j + 1
by NAT_1:11;
per cases
( j < n or i >= n or ( i < n & j >= n ) )
;
suppose A10:
j < n
;
not (Del (f,n)) . i <= (Del (f,n)) . jthen A11:
f . j = (Del (f,n)) . j
by FINSEQ_3:110;
i < n
by A6, A10, XXREAL_0:2;
then
f . i = (Del (f,n)) . i
by FINSEQ_3:110;
hence
not
(Del (f,n)) . i <= (Del (f,n)) . j
by A4, A5, A6, A7, A11, VALUED_0:def 14;
verum end; suppose A12:
i >= n
;
not (Del (f,n)) . i <= (Del (f,n)) . jthen
j > n
by A6, XXREAL_0:2;
then A13:
(Del (f,n)) . j = f . (j + 1)
by A1, A2, A3, A8, FINSEQ_3:111;
A14:
(Del (f,n)) . i = f . (i + 1)
by A1, A2, A3, A8, A12, FINSEQ_3:111;
1
<= i + 1
by NAT_1:11;
then A15:
i + 1
in dom f
by A2, A3, A8, FINSEQ_3:25, XREAL_1:6;
A16:
j + 1
in dom f
by A2, A3, A8, A9, FINSEQ_3:25, XREAL_1:6;
i + 1
< j + 1
by A6, XREAL_1:6;
hence
not
(Del (f,n)) . i <= (Del (f,n)) . j
by A13, A14, A15, A16, VALUED_0:def 14;
verum end; suppose that A17:
i < n
and A18:
j >= n
;
not (Del (f,n)) . i <= (Del (f,n)) . jA19:
(Del (f,n)) . i = f . i
by A17, FINSEQ_3:110;
A20:
(Del (f,n)) . j = f . (j + 1)
by A1, A2, A3, A8, A18, FINSEQ_3:111;
A21:
j + 1
in dom f
by A2, A3, A8, A9, FINSEQ_3:25, XREAL_1:6;
j + 0 < j + 1
by XREAL_1:6;
then
i < j + 1
by A6, XXREAL_0:2;
hence
not
(Del (f,n)) . i <= (Del (f,n)) . j
by A4, A7, A19, A20, A21, VALUED_0:def 14;
verum end; end; end; end;