theorem :: LUKASI_1:75

for A being QC-alphabet
for p, q being Element of CQC-WFF A
for X being Subset of (CQC-WFF A) st X |- p => ('not' q) & X |- q holds
X |- 'not' p