reserve f for Function;
reserve p,q for FinSequence;
reserve A,B,C for set,x,x1,x2,y,z for object;
reserve k,l,m,n for Nat;
reserve a for Nat;
reserve D for non empty set;
reserve d,d1,d2,d3 for Element of D;
reserve L,M for Element of NAT;

theorem
  x in rng p implies (x..p = 1 iff p -| x = {})
proof
  assume
A1: x in rng p;
  thus x..p = 1 implies p -| x = {}
  proof
    assume
A2: x..p = 1;
    len(p -| x) = x..p - 1 by A1,Th34
      .= 0 by A2;
    hence thesis;
  end;
  assume p -| x = {};
  then
A3: len(p -| x) = 0;
  len(p -| x) = x..p - 1 by A1,Th34;
  hence thesis by A3;
end;
