reserve A for QC-alphabet;
reserve a,b,b1,b2,c,d for object,
  i,j,k,n for Nat,
  x,y,x1,x2 for bound_QC-variable of A,
  P for QC-pred_symbol of k,A,
  ll for CQC-variable_list of k,A,
  l1 ,l2 for FinSequence of QC-variables(A),
  p for QC-formula of A,
  s,t for QC-symbol of A;
reserve Sub for CQC_Substitution of A;
reserve finSub for finite CQC_Substitution of A;
reserve e for Element of vSUB(A);
reserve S,S9,S1,S2,S19,S29,T1,T2 for Element of QC-Sub-WFF(A);
reserve B for Element of [:QC-Sub-WFF(A),bound_QC-variables(A):];
reserve SQ for second_Q_comp of B;

theorem
  Sub_not(S) = Sub_not(S9) implies S = S9
proof
  assume Sub_not(S) = Sub_not(S9);
  then
A1: 'not' S`1 = 'not' (S9)`1 & S`2 = (S9)`2 by XTUPLE_0:1;
  S = [S`1,S`2] & S9 = [(S9)`1,(S9)`2] by Th10;
  hence thesis by A1,FINSEQ_1:33;
end;
