Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Block-0 slot-owner certificates, chunks 12–13

Definition
IntMul_Kappa_R8_Data_BitOppbankBlock0SlotsC2

by Ethan Cheung Wang · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

bitnbblock0complexity-theoryinteger-multiplicationoppbankprefixqhnetrecrr8round-eight

Block-0 slot owners, chunks 12–13

Map-rfl owner certificates for chunks 12–13 of gateSlotCert. Depends on published Block0SlotsData. Prefix / block-0 helper only; not a full-word W1F certificate.

Definition code
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0SlotsData

set_option maxRecDepth 1000000
set_option maxHeartbeats 8000000
set_option autoImplicit false
set_option linter.unusedSimpArgs false

open IntMul.Kappa.R8.Bit.Oppbank.Block0SlotsData

namespace IntMul.Kappa.R8.Bit.Oppbank.Block0SlotsC2

theorem slot_c12_srcP :
    slot_c12.map slotSrcP = slot_c12.map (fun p => srcAt (slotTp p)) := rfl

theorem slot_c12_hiP :
    slot_c12.map slotHiP = slot_c12.map (fun p => hiAt (slotTp p)) := rfl

theorem slot_c12_srcB :
    slot_c12.map slotSrcB = slot_c12.map (fun p => srcAt (slotTb p)) := rfl

theorem slot_c12_hiB :
    slot_c12.map slotHiB = slot_c12.map (fun p => hiAt (slotTb p)) := rfl

theorem slot_c12_owners :
    ∀ p ∈ slot_c12,
      slotSrcP p = srcAt (slotTp p) ∧ slotHiP p = hiAt (slotTp p) ∧
        slotSrcB p = srcAt (slotTb p) ∧ slotHiB p = hiAt (slotTb p) := by
  intro p hp
  refine ⟨forall_of_map_eq slot_c12_srcP p hp,
    forall_of_map_eq slot_c12_hiP p hp,
    forall_of_map_eq slot_c12_srcB p hp,
    forall_of_map_eq slot_c12_hiB p hp⟩

theorem slot_c13_srcP :
    slot_c13.map slotSrcP = slot_c13.map (fun p => srcAt (slotTp p)) := rfl

theorem slot_c13_hiP :
    slot_c13.map slotHiP = slot_c13.map (fun p => hiAt (slotTp p)) := rfl

theorem slot_c13_srcB :
    slot_c13.map slotSrcB = slot_c13.map (fun p => srcAt (slotTb p)) := rfl

theorem slot_c13_hiB :
    slot_c13.map slotHiB = slot_c13.map (fun p => hiAt (slotTb p)) := rfl

theorem slot_c13_owners :
    ∀ p ∈ slot_c13,
      slotSrcP p = srcAt (slotTp p) ∧ slotHiP p = hiAt (slotTp p) ∧
        slotSrcB p = srcAt (slotTb p) ∧ slotHiB p = hiAt (slotTb p) := by
  intro p hp
  refine ⟨forall_of_map_eq slot_c13_srcP p hp,
    forall_of_map_eq slot_c13_hiP p hp,
    forall_of_map_eq slot_c13_srcB p hp,
    forall_of_map_eq slot_c13_hiB p hp⟩

end IntMul.Kappa.R8.Bit.Oppbank.Block0SlotsC2
Source
IntMul Kappa R8 Bit Oppbank FormalOK: block-0 chunk certificates. Prefix / block-0 pack only; not a full-word W1F certificate.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me