Theorem: Regex.NFA.pushNode_size (Regex/NFA/Compile.lean)

State before:
nfa : NFA
node : Node
inBounds : node.inBounds (nfa.nodes.size + 1)
⊢ (nfa.pushNode node inBounds).val.nodes.size = nfa.nodes.size + 1
Tactic:
simp [pushNode]
State after:
no goals