theorem :: LUKASI_1:76

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