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

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