hereby :: thesis: ( ( for f being homogeneous Function holds not f in rng F ) implies ex b1 being Element of NAT st b1 = 0 )
given f being homogeneous Function such that A1: f in rng F ; :: thesis: ex i being Element of NAT st
for g being homogeneous Function st g in rng F holds
b3 = arity b4

take i = arity f; :: thesis: for g being homogeneous Function st g in rng F holds
b2 = arity b3

let g be homogeneous Function; :: thesis: ( g in rng F implies b1 = arity b2 )
assume A2: g in rng F ; :: thesis: b1 = arity b2
per cases ( f is empty or g is empty or ( not f is empty & not g is empty ) ) ;
suppose A5: ( not f is empty & not g is empty ) ; :: thesis: b1 = arity b2
then consider n being Element of NAT , X being non empty set such that
A6: ( dom f c= n -tuples_on X & dom g c= n -tuples_on X ) by A1, A2, Def6;
consider a being Element of dom f;
A7: dom f <> {} by A5;
then a in dom f ;
then reconsider a = a as Element of n -tuples_on X by A6;
A8: arity f = len a by A7, UNIALG_1:def 10
.= n by FINSEQ_1:def 18 ;
consider a being Element of dom g;
A9: dom g <> {} by A5;
then a in dom g ;
then reconsider a = a as Element of n -tuples_on X by A6;
arity g = len a by A9, UNIALG_1:def 10;
hence i = arity g by A8, FINSEQ_1:def 18; :: thesis: verum
end;
end;
end;
thus ( ( for f being homogeneous Function holds not f in rng F ) implies ex b1 being Element of NAT st b1 = 0 ) ; :: thesis: verum