35-move certificate: exact rows 200–207
ProvedOAI.SnakyCertificate.MilestoneChecks.block06_group01_correctThe original certificate rows 200 through 207 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_group01_correct : (rowAt 200 = data_200 ∧ Good (rowAt 200) ∧ EntryGood 200) ∧ (rowAt 201 = data_201 ∧ Good (rowAt 201) ∧ EntryGood 201) ∧ (rowAt 202 = data_202 ∧ Good (rowAt 202) ∧ EntryGood 202) ∧ (rowAt 203 = data_203 ∧ Good (rowAt 203) ∧ EntryGood 203) ∧ (rowAt 204 = data_204 ∧ Good (rowAt 204) ∧ EntryGood 204) ∧ (rowAt 205 = data_205 ∧ Good (rowAt 205) ∧ EntryGood 205) ∧ (rowAt 206 = data_206 ∧ Good (rowAt 206) ∧ EntryGood 206) ∧ (rowAt 207 = data_207 ∧ Good (rowAt 207) ∧ EntryGood 207) ∧ True := by sorry
Source