let N, F be Function; ( F . 0 = N . 0 & ( for n being Element of NAT holds
( F . (n + 1) = (N . (n + 1)) \ (N . n) & N . n c= N . (n + 1) ) ) implies for n, m being Element of NAT st n < m holds
F . n misses F . m )
assume that
A1:
F . 0 = N . 0
and
A2:
for n being Element of NAT holds
( F . (n + 1) = (N . (n + 1)) \ (N . n) & N . n c= N . (n + 1) )
; for n, m being Element of NAT st n < m holds
F . n misses F . m
let n, m be Element of NAT ; ( n < m implies F . n misses F . m )
assume A3:
n < m
; F . n misses F . m
then
0 <> m
by NAT_1:2;
then consider k being Nat such that
A4:
m = k + 1
by NAT_1:6;
A5:
for n being Element of NAT holds F . n c= N . n
A8:
for n, m being Element of NAT st n <= m holds
F . n c= N . m
reconsider k = k as Element of NAT by ORDINAL1:def 13;
F . (k + 1) = (N . (k + 1)) \ (N . k)
by A2;
then A11:
N . k misses F . (k + 1)
by XBOOLE_1:79;
n <= k
by A3, A4, NAT_1:13;
then (F . n) /\ (F . (k + 1)) =
((F . n) /\ (N . k)) /\ (F . (k + 1))
by A8, XBOOLE_1:28
.=
(F . n) /\ ((N . k) /\ (F . (k + 1)))
by XBOOLE_1:16
.=
(F . n) /\ {}
by A11, XBOOLE_0:def 7
.=
{}
;
hence
F . n misses F . m
by A4, XBOOLE_0:def 7; verum