theorem :: CQC_THE1:26

for Al being QC-alphabet
for X being Subset of (CQC-WFF Al)
for f being FinSequence of [:(CQC-WFF Al),Proof_Step_Kinds:] st f is_a_proof_wrt X holds
not not (f . 1) `2 = 0 & ... & not (f . 1) `2 = 6