CookLevin.isFormulaStringB_machine_unary_child
OpenChild lemma for CookLevin.isFormulaStringB_machine_unary
Formal statement
import Definitions.Def_CookLevin_Verifier
open CookLevin
theorem CookLevin.isFormulaStringB_machine_unary_child :
∃ (M : Machine) (k G : Nat) (c0 : Nat),
TuringMachine k G M ∧
∀ x w : List Bool,
DecidesIn M k (boolsToSymbols x) (boolsToSymbols w)
(c0 * (x.length + 1) ^ 2)
(isFormulaStringB x) := by sorry