Documentation

Regex.NFA.Compile.ProofData.Lemmas

theorem Regex.NFA.pushNode_wf {nfa : NFA} {node : Node} (wf : nfa.WellFormed) (inBounds : node.inBounds (nfa.nodes.size + 1)) :
(nfa.pushNode node).WellFormed
theorem Regex.NFA.pushRegex_wf {nfa : NFA} {next : Nat} {e : Data.Expr} (wf : nfa.WellFormed) (next_lt : next < nfa.nodes.size) :
(nfa.pushRegex next e).WellFormed