Locals stored by genF already appear on the input word W (QHNetRec)
ProvedIntMul.Kappa.R8.Bit.Oppbank.net0O2_genF_locals_of_W_recEvery local endpoint stored in the chunk list of the densified generator already appears on some instruction of the input word , on the total-decoder network QHNetRec.
Let be a seed code map and let be a list of local instructions. Write for the generated chunk list. If a local index occurs as a move source or as an XOR endpoint in some chunk of that list, then the same index already occurs on some instruction :
This is the local-preservation lemma for . Combined with the wire bound it is the data-bound leaf of the densify in the QHNetRec environment.
Formalization Note. The statement is identical to net0O2_genF_locals_of_W, with preamble importing Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankQHNetRec rather than Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankQHNet. It does not import the parent QHNet module and does not close or replace 3b01b3bc-cc37-4a0d-82aa-08d002a558ff.
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
namespace IntMul.Kappa.R8.Bit.Oppbank
open IntMul.Kappa.R8.Bit.Oppbank.NB
theorem net0O2_genF_locals_of_W_rec (f : ℕ → ℕ) (W : List LInstr) (ℓ : ℕ)
(hℓ : ∃ ch ∈ (genF f W).2,
(∃ mv ∈ ch.2.1, mv.1 = ℓ) ∨ (∃ p ∈ ch.2.2, p.1 = ℓ ∨ p.2 = ℓ)) :
∃ i ∈ W, ℓ ∈ i.2.1 ∨ ∃ p ∈ i.2.2, p.1 = ℓ ∨ p.2 = ℓ := by sorry
end IntMul.Kappa.R8.Bit.Oppbank