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
  p=h.x & q=h.y & not x in still_not-bound_in h & not y in
  still_not-bound_in p implies All(x,p) => All(y,q) is valid
proof
  assume p=h.x & q=h.y & not x in still_not-bound_in h & not y in
  still_not-bound_in p;
  then ( not y in still_not-bound_in All(x,p))& All(x,p) => q is valid by Th5
,Th25;
  hence thesis by CQC_THE1:67;
end;
