35-move certificate: exact rows 112–119
ProvedOAI.SnakyCertificate.MilestoneChecks.block03_group02_correctThe original certificate rows 112 through 119 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_group02_correct : (rowAt 112 = data_112 ∧ Good (rowAt 112) ∧ EntryGood 112) ∧ (rowAt 113 = data_113 ∧ Good (rowAt 113) ∧ EntryGood 113) ∧ (rowAt 114 = data_114 ∧ Good (rowAt 114) ∧ EntryGood 114) ∧ (rowAt 115 = data_115 ∧ Good (rowAt 115) ∧ EntryGood 115) ∧ (rowAt 116 = data_116 ∧ Good (rowAt 116) ∧ EntryGood 116) ∧ (rowAt 117 = data_117 ∧ Good (rowAt 117) ∧ EntryGood 117) ∧ (rowAt 118 = data_118 ∧ Good (rowAt 118) ∧ EntryGood 118) ∧ (rowAt 119 = data_119 ∧ Good (rowAt 119) ∧ EntryGood 119) ∧ True := by sorry
Source