reserve x,y,z for object, X,Y for set,
  i,k,n for Nat,
  p,q,r,s for FinSequence,
  w for FinSequence of NAT,
  f for Function;

theorem
  X is constituted-FinTrees iff X c= FinTrees
proof
  thus X is constituted-FinTrees implies X c= FinTrees
  proof
    assume
A1: for x st x in X holds x is finite Tree;
    let x be object;
    assume x in X;
    then x is finite Tree by A1;
    hence thesis by Def2;
  end;
  assume
A2: X c= FinTrees;
  let x;
  assume x in X;
  hence thesis by A2,Def2;
end;
