# Prove Lemma (Switch Edges). Suppose that, starting from some embeddings of planar graphs with di…

Prove Lemma (Switch Edges). Suppose that, starting from some embeddings of planar graphs with disjoint sets of vertices, it is possible by two successive applications of constructor operations to add edges e and then f to obtain a planar embedding, F. Then starting from the same embeddings, it is also possible to obtain F by adding f and then e with two successive applications of constructor operations. Prove Corollary (Permute Edges). Suppose that, starting from some embeddings of planar graphs with disjoint sets of vertices, it is possible to add a sequence of edges e_0, e_1, ellipsis, e_n by successive applications of constructor operations to obtain a planar embedding, F. Then starting from the same embeddings, it is also possible to obtain F by applications of constructor operations that successively add any permutation of the edges e_0, e_1, ellipsis, e_n. Prove Corollary (Delete Edge). Deleting an edge from a planar graph leaves a planar graph. Conclude that any subgraph of a planar graph is planar.