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

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