35-move certificate: exact rows 192–199
ProvedOAI.SnakyCertificate.MilestoneChecks.block06_group00_correctThe original certificate rows 192 through 199 have their exact required sets, envelopes and heights and the specified subset/origin/height invariants. Nonbase entries have correct indices, nonempty term lists and backward references.
Preamble
import Definitions.Def_Snaky35Cache06 open OAI.SnakyCertificate.MilestoneChecks OAI.SnakyCertificate
Formal statement
theorem OAI.SnakyCertificate.MilestoneChecks.block06_group00_correct : (rowAt 192 = data_192 ∧ Good (rowAt 192) ∧ EntryGood 192) ∧ (rowAt 193 = data_193 ∧ Good (rowAt 193) ∧ EntryGood 193) ∧ (rowAt 194 = data_194 ∧ Good (rowAt 194) ∧ EntryGood 194) ∧ (rowAt 195 = data_195 ∧ Good (rowAt 195) ∧ EntryGood 195) ∧ (rowAt 196 = data_196 ∧ Good (rowAt 196) ∧ EntryGood 196) ∧ (rowAt 197 = data_197 ∧ Good (rowAt 197) ∧ EntryGood 197) ∧ (rowAt 198 = data_198 ∧ Good (rowAt 198) ∧ EntryGood 198) ∧ (rowAt 199 = data_199 ∧ Good (rowAt 199) ∧ EntryGood 199) ∧ True := by sorry
Source