theorem Th35:
  x in rng p & n = x..p - 1 implies dom(p -| x) = Seg n
proof
  assume x in rng p;
  then len(p -| x) = x..p - 1 by Th34;
  hence thesis by FINSEQ_1:def 3;
end;
