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
  x<>y implies (Ex(x,p)).y = Ex(x,p.y)
proof
  assume
A1: x<>y;
  thus (Ex(x,p)).y = ('not' All(x,'not' p)).y by QC_LANG2:def 5
    .= 'not'(All(x,'not' p).y) by CQC_LANG:19
    .= 'not'(All(x,('not' p).y)) by A1,CQC_LANG:25
    .= 'not' All(x,'not'(p.y)) by CQC_LANG:19
    .= Ex(x,p.y) by QC_LANG2:def 5;
end;
