35-move certificate: exact rows 208–215
ProvedOAI.SnakyCertificate.MilestoneChecks.block06_group02_correctThe original certificate rows 208 through 215 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_group02_correct : (rowAt 208 = data_208 ∧ Good (rowAt 208) ∧ EntryGood 208) ∧ (rowAt 209 = data_209 ∧ Good (rowAt 209) ∧ EntryGood 209) ∧ (rowAt 210 = data_210 ∧ Good (rowAt 210) ∧ EntryGood 210) ∧ (rowAt 211 = data_211 ∧ Good (rowAt 211) ∧ EntryGood 211) ∧ (rowAt 212 = data_212 ∧ Good (rowAt 212) ∧ EntryGood 212) ∧ (rowAt 213 = data_213 ∧ Good (rowAt 213) ∧ EntryGood 213) ∧ (rowAt 214 = data_214 ∧ Good (rowAt 214) ∧ EntryGood 214) ∧ (rowAt 215 = data_215 ∧ Good (rowAt 215) ∧ EntryGood 215) ∧ True := by sorry
Source