reserve p,q,r,s for boolean object;

theorem
  p 'nand' (p => q) = 'not' (p '&' q)
proof
  p = FALSE or p = TRUE by Def3;
  hence thesis;
end;
