reserve A for QC-alphabet;
reserve p, q, r, s for Element of CQC-WFF(A);

theorem
  ( p 'or' q ) in TAUT(A) & 'not' p in TAUT(A) implies q in TAUT(A)
proof
  assume that
A1: ( p 'or' q ) in TAUT(A) and
A2: 'not' p in TAUT(A);
  ( p 'or' q ) => ( 'not' p => q ) in TAUT(A) by Th5;
  then 'not' p => q in TAUT(A) by A1,CQC_THE1:46;
  hence thesis by A2,CQC_THE1:46;
end;
