set A = { f where f is Element of HFuncs NAT : ( f is k -ary & f is primitive-recursive ) } ;
{ f where f is Element of HFuncs NAT : ( f is k -ary & f is primitive-recursive ) } c= HFuncs NAT
proof
let a be object ; :: according to TARSKI:def 3 :: thesis: ( not a in { f where f is Element of HFuncs NAT : ( f is k -ary & f is primitive-recursive ) } or a in HFuncs NAT )
assume a in { f where f is Element of HFuncs NAT : ( f is k -ary & f is primitive-recursive ) } ; :: thesis: a in HFuncs NAT
then ex f being Element of HFuncs NAT st
( a = f & f is k -ary & f is primitive-recursive ) ;
hence a in HFuncs NAT ; :: thesis: verum
end;
hence { f where f is Element of HFuncs NAT : ( f is k -ary & f is primitive-recursive ) } is Subset of (HFuncs NAT) ; :: thesis: verum