theorem Th7:
  n in dom f & 1 <= m & m <= n implies f.m = (f|n).m
  proof
    assume
    A1: n in dom f & 1 <= m & m <= n; then
    m in Seg n;
    hence thesis by A1, RFINSEQ:6;
  end;
