theorem
  a 'nand' a = 'not' a & 'not' (a 'nand' a) = a
proof
  a 'nand' a = 'not' (a '&' a) by th1
    .= 'not' a;
  hence thesis;
end;
