reserve x,y for set;
reserve N for PT_net_Str;

theorem Th19:
  for N being Pnet for x being Element of Elements(N) holds
  Elements(N) <> {} implies exit(N,x) c= Elements(N)
proof
  let N be Pnet;
  let x be Element of Elements(N);
  assume
A1: Elements(N) <> {};
A2: exit(N,x) ={x} implies exit(N,x) c= Elements(N)
  proof
    x in Elements(N) by A1;
    then
A3: for y being object holds y in {x} implies y in Elements(N)
      by TARSKI:def 1;
    assume exit(N,x) ={x};
    hence thesis by A3,TARSKI:def 3;
  end;
  exit(N,x) ={x} or exit(N,x) = Post(N,x) by A1,Th18;
  hence thesis by A2,Th11;
end;
