
theorem
NAT meets bool NAT
proof
0 in NAT; then
{0} c= NAT by TARSKI:def 1; then
NAT /\ bool NAT <> {} by CARD_1:49,XBOOLE_0:def 4;
hence thesis by XBOOLE_0:def 7;
end;
