35-move certificate: exact rows 96–127
ProvedOAI.SnakyCertificate.MilestoneChecks.block03_correctOriginal certificate rows 96 through 127 equal the explicit candidate required set, envelope and height; each row has the required subset/origin/height invariants. The nonbase entries have their exact indices, nonempty placement lists and strictly backward references.
Preamble
import Definitions.Def_Snaky35Cache03 open OAI.SnakyCertificate.MilestoneChecks OAI.SnakyCertificate
Formal statement
theorem OAI.SnakyCertificate.MilestoneChecks.block03_correct : (rowAt 96 = data_96 ∧ Good (rowAt 96) ∧ EntryGood 96) ∧ (rowAt 97 = data_97 ∧ Good (rowAt 97) ∧ EntryGood 97) ∧ (rowAt 98 = data_98 ∧ Good (rowAt 98) ∧ EntryGood 98) ∧ (rowAt 99 = data_99 ∧ Good (rowAt 99) ∧ EntryGood 99) ∧ (rowAt 100 = data_100 ∧ Good (rowAt 100) ∧ EntryGood 100) ∧ (rowAt 101 = data_101 ∧ Good (rowAt 101) ∧ EntryGood 101) ∧ (rowAt 102 = data_102 ∧ Good (rowAt 102) ∧ EntryGood 102) ∧ (rowAt 103 = data_103 ∧ Good (rowAt 103) ∧ EntryGood 103) ∧ (rowAt 104 = data_104 ∧ Good (rowAt 104) ∧ EntryGood 104) ∧ (rowAt 105 = data_105 ∧ Good (rowAt 105) ∧ EntryGood 105) ∧ (rowAt 106 = data_106 ∧ Good (rowAt 106) ∧ EntryGood 106) ∧ (rowAt 107 = data_107 ∧ Good (rowAt 107) ∧ EntryGood 107) ∧ (rowAt 108 = data_108 ∧ Good (rowAt 108) ∧ EntryGood 108) ∧ (rowAt 109 = data_109 ∧ Good (rowAt 109) ∧ EntryGood 109) ∧ (rowAt 110 = data_110 ∧ Good (rowAt 110) ∧ EntryGood 110) ∧ (rowAt 111 = data_111 ∧ Good (rowAt 111) ∧ EntryGood 111) ∧ (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) ∧ (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