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 Th49:
  'not' Ex(x,'not' p) => All(x,p) is valid & All(x,p) => 'not' Ex(
  x,'not' p) is valid
proof
A1: All(x,'not' 'not' p) => All(x,p) is valid by Th45;
A2: 'not' Ex(x,'not' p) = 'not' 'not' All(x,'not' 'not' p) by QC_LANG2:def 5;
  then 'not' Ex(x,'not' p) => All(x,'not' 'not' p) is valid;
  hence 'not' Ex(x,'not' p) => All(x,p) is valid by A1,LUKASI_1:42;
  All(x,p) => All(x,'not' 'not' p) is valid & All(x,'not' 'not' p) =>
  'not' 'not' All(x,'not' 'not' p) is valid by Th45;
  hence thesis by A2,LUKASI_1:42;
end;
