reserve x,y,z for object,
  i,j,n,m for Nat,
  D for non empty set,
  s,t for FinSequence,
  a,a1,a2,b1,b2,d for Element of D,
  p, p1,p2,q,r for FinSequence of D;

theorem Th3:
  <*s*> is tabular
proof
  take len s;
  let x;
  assume x in rng <*s*>;
  then
A1: x in {s} by FINSEQ_1:38;
  then reconsider t=x as FinSequence by TARSKI:def 1;
  take t;
  thus thesis by A1,TARSKI:def 1;
end;
