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

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