reserve G for Graph,
  v, v1, v2 for Vertex of G,
  c for Chain of G,
  p, p1, p2 for Path of G,
  vs, vs1, vs2 for FinSequence of the carrier of G,
  e, X for set,
  n, m for Nat;

theorem Th20:
  Edges_In(v, X) c= Edges_In v
proof
  let e be object;
  assume
A1: e in Edges_In(v, X);
  then (the Target of G).e = v by Def1;
  hence thesis by A1,Def1;
end;
