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

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