Theorem: Network.Graph.Path.Child.class_eq_class (Runtime/Network/Graph/Path/Child.lean)

State before:
graph✝ : Graph
a✝ : Class graph✝
path : Path graph✝ a✝
child : Child path
⊢ Class.Child.class (class child) = Path.class child.val
Tactic:
sorry
State after:
no goals