CookLevin.bridge_seqCompose_to_turingMachine_and_compose_wf
ProvedA graph bridge connecting the sequential composition well-formedness frontier leaf to the accepted turingMachine_and_compose_wf sketch.
Formal statement
import Definitions.Def_CookLevin_Basic import Definitions.Def_CookLevin_Satisfiability import Definitions.Def_CookLevin_Complexity import Definitions.Def_CookLevin_Verifier open CookLevin theorem CookLevin.bridge_seqCompose_to_turingMachine_and_compose_wf : True := by sorry