let k, n be Element of NAT ; :: thesis: for f being Function of n,k st f = id n & n > 0 holds
f is "increasing
let f be Function of n,k; :: thesis: ( f = id n & n > 0 implies f is "increasing )
assume that
A1: f = id n and
A2: n > 0 ; :: thesis: f is "increasing
A3: ex x being set st x in n by A2, XBOOLE_0:def 1;

A4: now

let l, m be Element of NAT ; :: thesis: ( l in rng f & m in rng f & l < m implies min* (f " {l}) < min* (f " {m}) )
assume that
A5: l in rng f and
A6: m in rng f and
A7: l < m ; :: thesis: min* (f " {l}) < min* (f " {m})
A8: ex x being set st f " {l} = {x} by A1, A5, FUNCT_1:144;
A9: l in {l} by TARSKI:def 1;
consider l' being set such that
A10: l' in dom f and
A11: f . l' = l by A5, FUNCT_1:def 5;
l = l' by A1, A10, A11, FUNCT_1:35;
then l in f " {l} by A10, A11, A9, FUNCT_1:def 13;
then f " {l} = {l} by A8, TARSKI:def 1;
then A12: min* (f " {l}) = l by Th5;
A13: m in {m} by TARSKI:def 1;
A14: ex x being set st f " {m} = {x} by A1, A6, FUNCT_1:144;
consider m' being set such that
A15: m' in dom f and
A16: f . m' = m by A6, FUNCT_1:def 5;
m = m' by A1, A15, A16, FUNCT_1:35;
then m in f " {m} by A15, A16, A13, FUNCT_1:def 13;
then f " {m} = {m} by A14, TARSKI:def 1;
hence min* (f " {l}) < min* (f " {m}) by A7, A12, Th5; :: thesis: verum

end;

rng f = n by A1, RELAT_1:71;
hence f is "increasing by A3, A4, Def1; :: thesis: verum