[STATEMENT]
lemma delete_edges_wf: "wf_list_graph G \<Longrightarrow> wf_list_graph (delete_edges G E)"
[PROOF STATE]
proof (prove)
goal (1 subgoal):
 1. wf_list_graph G \<Longrightarrow> wf_list_graph (FiniteListGraph.delete_edges G E)
[PROOF STEP]
by (induction E arbitrary: G) (auto simp: delete_edge_wf)