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 Th90:
  X|- p implies X|- All(x,p)
proof
A1: X|- p => ((All(x,p) => All(x,p)) => p) by CQC_THE1:59;
  not x in still_not-bound_in All(x,p) by Th5;
  then
A2: not x in still_not-bound_in All(x,p) => All(x,p) by Th7;
  assume X|- p;
  then X|- (All(x,p) => All(x,p)) => p by A1,CQC_THE1:55;
  then
A3: X|- (All(x,p) => All(x,p)) => All(x,p) by A2,CQC_THE1:57;
  X|- All(x,p) => All(x,p) by CQC_THE1:59;
  hence thesis by A3,CQC_THE1:55;
end;
