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

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