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 Th30:
  All(x,p => q) => (All(x,p) => All(x,q)) is valid
proof
  All(x,p => q) => (p => q) is valid by CQC_THE1:66;
  then
A1: p => (All(x,p => q) => q) is valid by LUKASI_1:44;
  All(x,p) => p is valid by CQC_THE1:66;
  then All(x,p) => (All(x,p => q) => q) is valid by A1,LUKASI_1:42;
  then
A2: (All(x,p => q) '&' All(x,p)) => q is valid by Th2;
  ( not x in still_not-bound_in All(x,p => q))& not x in
  still_not-bound_in All( x,p) by Th5;
  then not x in still_not-bound_in All(x,p => q) '&' All(x,p) by Th8;
  then (All(x,p => q) '&' All(x,p)) => All(x,q) is valid by A2,CQC_THE1:67;
  hence thesis by Th3;
end;
