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

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