Sparse-entry miss copy — proof internals

theorem Complexity.RAM.RegisterStore.Machine.entryMissCopyTM_hoareTime_frame_internal {n : ℕ} (tapes : EntryMatchTapes n) (entry : Entry) (rest queryBits emitted : List Bool) (initialWork matchedWork : Fin n → Tape) (inp₀ out₀ : Tape) (hmatch : ReadableEntryMatch tapes entry rest queryBits initialWork matchedWork) (hinput : TM.Parked inp₀) (houtput : out₀.HasBinaryPrefix emitted) : (entryMissCopyTM tapes).HoareTime (fun (inp : Tape) (work : Fin n → Tape) (out : Tape) => inp = inp₀ ∧ work = matchedWork ∧ out = out₀) (fun (inp : Tape) (work : Fin n → Tape) (out : Tape) => inp = inp₀ ∧ EntryScanReady tapes rest queryBits initialWork work ∧ out.HasBinaryPrefix (emitted ++ entry.encode)) (entryMissCopyTime tapes entry queryBits initialWork matchedWork)