reserve a,a1,a2,v,v1,v2,x for object;
reserve V,A for set;
reserve m,n for Nat;
reserve S,S1,S2 for FinSequence;

theorem Th27:
  <*NDSS(V,A)*> IsNDRankSeq V,A
  proof
    set S = <*NDSS(V,A)*>;
    thus S.1 = NDSS(V,A);
    let n be Nat such that
A1: n in dom S & n+1 in dom S;
    dom S = {1} by FINSEQ_1:2,def 8;
    then n = 1 & n+1 = 1 by A1,TARSKI:def 1;
    hence thesis;
  end;
