theorem Th19: :: CQC_LANG:19

for A being QC-alphabet
for x being bound_QC-variable of A
for p being Element of QC-WFF A holds ('not' p) . x = 'not' (p . x)