reserve A for QC-alphabet;
reserve X,T for Subset of CQC-WFF(A);
reserve F,G,H,p,q,r,t for Element of CQC-WFF(A);
reserve s,h for QC-formula of A;
reserve x,y for bound_QC-variable of A;
reserve f for FinSequence of [:CQC-WFF(A),Proof_Step_Kinds:];
reserve i,j for Element of NAT;

theorem
  (s 'or' h).x = (s.x) 'or' (h.x)
proof
  thus (s 'or' h).x = ('not'('not' s '&' 'not' h)).x by QC_LANG2:def 3
    .= 'not'(('not' s '&' 'not' h).x) by CQC_LANG:19
    .= 'not'((('not' s).x) '&' (('not' h).x)) by CQC_LANG:21
    .= 'not'('not'(s.x) '&' (('not' h).x)) by CQC_LANG:19
    .= 'not'('not'(s.x) '&' 'not'(h.x)) by CQC_LANG:19
    .= (s.x) 'or' (h.x) by QC_LANG2:def 3;
end;
