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

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