35-move certificate: exact rows 120–127
ProvedOAI.SnakyCertificate.MilestoneChecks.block03_group03_correctThe original certificate rows 120 through 127 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_Snaky35Cache03 open OAI.SnakyCertificate.MilestoneChecks OAI.SnakyCertificate
Formal statement
theorem OAI.SnakyCertificate.MilestoneChecks.block03_group03_correct : (rowAt 120 = data_120 ∧ Good (rowAt 120) ∧ EntryGood 120) ∧ (rowAt 121 = data_121 ∧ Good (rowAt 121) ∧ EntryGood 121) ∧ (rowAt 122 = data_122 ∧ Good (rowAt 122) ∧ EntryGood 122) ∧ (rowAt 123 = data_123 ∧ Good (rowAt 123) ∧ EntryGood 123) ∧ (rowAt 124 = data_124 ∧ Good (rowAt 124) ∧ EntryGood 124) ∧ (rowAt 125 = data_125 ∧ Good (rowAt 125) ∧ EntryGood 125) ∧ (rowAt 126 = data_126 ∧ Good (rowAt 126) ∧ EntryGood 126) ∧ (rowAt 127 = data_127 ∧ Good (rowAt 127) ∧ EntryGood 127) ∧ True := by sorry
Source