Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Source slots of densified LocSlots lie strictly below NR (QHNetRec)

Proved
IntMul.Kappa.R8.Bit.Oppbank.net0O2_srcS_lt_NR_rec

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

bitnbeoko2formalokintmulkappalocslotsqhnetrecr8

Every densified LocSlots source index srcS(t)\mathrm{srcS}(t)srcS(t) for t<v=1771t<v=1771t<v=1771 is strictly below NR=27794NR=27794NR=27794.

Formally,

∀ t<v,srcS(t)<NR.\forall\, t < v,\qquad \mathrm{srcS}(t) < NR.∀t<v,srcS(t)<NR.

Used by copyo wires in W1FW_{1F}W1F​ (wS(srcS t)w_S(\mathrm{srcS}\,t)wS​(srcSt)).

Formalization Note. Chunked List.all/decide over the SRC table (no native_decide).

This is the same slot-bound certificate as net0O2_srcS_lt_NR, restated against the total-decoder fork IntMul_Kappa_R8_Data_BitOppbankQHNetRec (the accessors retS, srcS, injS, and pts are unchanged; only the GREC decoder is total). It does not import the parent module Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankQHNet.

Preamble
import Definitions.Def_IntMul_Kappa_R6_Defs4
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankQHNetRec
import Mathlib
set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxRecDepth 100000
Formal statement
namespace IntMul.Kappa.R8.Bit.Oppbank
open IntMul.Kappa.R8.Bit.Oppbank.NB
open IntMul.Kappa.R8.Bit.Oppbank (NR v)
theorem net0O2_srcS_lt_NR_rec (t : ℕ) (ht : t < v) : srcS t < NR := by sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK densify: LocSlots numeral certificates Restated on QHNetRec (Nat.rec chunkDec fork d127abea) as IntMul.Kappa.R8.Bit.Oppbank.net0O2_srcS_lt_NR_rec; does not close the parent theorem.

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