Theorem: Network.Graph.Class.reactionInputScheme_type_right (Runtime/Network/Graph/Basic.lean)

State before:
graph : Graph
cls : Class graph
child : Child cls
childOutput : ((fun child => interface (Child.class child) Reactor.InterfaceKind.outputs) child).vars
⊢ Interface.Scheme.type (reactionInputScheme cls) (Sum.inr { fst := child, snd := childOutput }) =
    Interface.Scheme.type (interface (Child.class child) Reactor.InterfaceKind.outputs) childOutput
Tactic:
simp [Interface.Scheme.bUnion_type]
State after:
no goals