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

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