reserve A for QC-alphabet;
reserve p, q, r, s, p1, q1 for Element of CQC-WFF(A),
  X, Y, Z, X1, X2 for Subset of CQC-WFF(A),
  h for QC-formula of A,
  x, y for bound_QC-variable of A,
  n for Element of NAT;

theorem
  p |-| q implies All(x,p) |-| All(y,q)
proof
  assume
A1: p |-| q;
A2: q |-| All(y,q) by Th36;
  All(x,p) |-| p by Th36;
  then All(x,p) |-| q by A1,Th28;
  hence thesis by A2,Th28;
end;
