Theorem: Digraph.Iso.symm_apply_reachable (GraphProjects/DigraphConnectivity.lean)

State before:
V : Type u
V' : Type v
V'' : Type w
G✝ : Digraph V
G'✝ : Digraph V'
G'' : Digraph V''
G : Digraph V
G' : Digraph V'
φ : G ≃g G'
u : V
v : V'
⊢ Reachable G (↑(symm φ) v) u ↔ Reachable G' v (↑φ u)
Tactic:
rw [← Iso.reachable_iff, RelIso.apply_symm_apply]
State after:
no goals