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

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