Theorem: Digraph.deleteEdges_empty_eq (GraphProjects/Digraph.lean)

State before:
ι : Sort ?u.61543
𝕜 : Type ?u.61546
V : Type u
W : Type v
X : Type w
G : Digraph V
G' : Digraph W
a b c u v w : V
⊢ deleteEdges G ∅ = G
Tactic:
ext
State after:
case Adj.h.h.a
ι : Sort ?u.61543
𝕜 : Type ?u.61546
V : Type u
W : Type v
X : Type w
G : Digraph V
G' : Digraph W
a b c u v w x✝¹ x✝ : V
⊢ (deleteEdges G ∅).Adj x✝¹ x✝ ↔ G.Adj x✝¹ x✝

State before:
case Adj.h.h.a
ι : Sort ?u.61543
𝕜 : Type ?u.61546
V : Type u
W : Type v
X : Type w
G : Digraph V
G' : Digraph W
a b c u v w x✝¹ x✝ : V
⊢ (deleteEdges G ∅).Adj x✝¹ x✝ ↔ G.Adj x✝¹ x✝
Tactic:
simp
State after:
no goals