Theorem: Graph.Subgraph.bar_edges (GroupComp/Subgraph.lean)

State before:
V : Type u_2
E : Type u_1
G : Graph V E
H : Subgraph G
e : E
ebH : G.bar e ∈ H.edges
⊢ e ∈ H.edges
Tactic:
rw [← G.bar_bar e]
State after:
V : Type u_2
E : Type u_1
G : Graph V E
H : Subgraph G
e : E
ebH : G.bar e ∈ H.edges
⊢ G.bar (G.bar e) ∈ H.edges

State before:
V : Type u_2
E : Type u_1
G : Graph V E
H : Subgraph G
e : E
ebH : G.bar e ∈ H.edges
⊢ G.bar (G.bar e) ∈ H.edges
Tactic:
apply edges_bar
State after:
case a
V : Type u_2
E : Type u_1
G : Graph V E
H : Subgraph G
e : E
ebH : G.bar e ∈ H.edges
⊢ G.bar e ∈ H.edges

State before:
case a
V : Type u_2
E : Type u_1
G : Graph V E
H : Subgraph G
e : E
ebH : G.bar e ∈ H.edges
⊢ G.bar e ∈ H.edges
Tactic:
assumption
State after:
no goals