reserve G, G1, G2 for _Graph, H for Subgraph of G;

theorem Th143:
  for G being non edgeless _Graph, e being Edge of G
  st not e in G.loops() holds createGraph(e) in G.allTrees()
proof
  let G be non edgeless _Graph, e be Edge of G;
  assume not e in G.loops();
  then createGraph(e) is connected acyclic by Th18;
  hence thesis by Th138;
end;
