{ n where n is Prime : n is fermat } c= NAT
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in { n where n is Prime : n is fermat } or x in NAT )
assume x in { n where n is Prime : n is fermat } ; :: thesis: x in NAT
then consider n being Prime such that
A1: ( n = x & n is fermat ) ;
thus x in NAT by A1; :: thesis: verum
end;
hence { n where n is Prime : n is fermat } is Subset of NAT ; :: thesis: verum