reserve k,m,n for Element of NAT,
  a,X,Y for set,
  D,D1,D2 for non empty set;
reserve p,q for FinSequence of NAT;
reserve x,y,z,t for Variable;
reserve F,F1,G,G1,H,H1 for ZF-formula;
reserve sq,sq9 for FinSequence;
reserve L,L9 for FinSequence;
reserve j,j1 for Element of NAT;

theorem Th80:
  Subformulae x '=' y = { x '=' y }
proof
  now
    let a be object;
    thus a in Subformulae x '=' y implies a in { x '=' y }
    proof
      assume a in Subformulae x '=' y;
      then consider F such that
A1:   F = a and
A2:   F is_subformula_of x '=' y by Def42;
      F = x '=' y by A2,Th76;
      hence thesis by A1,TARSKI:def 1;
    end;
    assume a in { x '=' y };
    then
A3: a = x '=' y by TARSKI:def 1;
    x '=' y is_subformula_of x '=' y by Th59;
    hence a in Subformulae x '=' y by A3,Def42;
  end;
  hence thesis by TARSKI:2;
end;
