AFTD Auto-Formalizing Theoretical Domains

op75_subset_encoding_cons

theoremverified

Encoding a nonempty weight list emits its marker, the head natural, then the remaining instance.

Statement

theorem op75_subset_encoding_cons (a : ℕ) (as : List ℕ) (t : ℕ) :
    op75_subset_encoding (a :: as) t = true :: (relu_encode_nat a ++ op75_subset_encoding as t)
Source
OP-75: canonical subset-sum input decoder for the width-three ReLU compiler.
Verified
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • op75_subset_encodingThe source word encodes each nonnegative integer weight as a true marker followed by its self-delimiting natural encoding, then a false…
  • relu_encode_natBinary encoding of a natural number as a self-delimiting Bool word: each base-2 digit, least significant first, is preceded by a true…
Used by 2

Lean source view module on GitHub

theorem op75_subset_encoding_cons (a : ℕ) (as : List ℕ) (t : ℕ) :
    op75_subset_encoding (a :: as) t = true :: (relu_encode_nat a ++ op75_subset_encoding as t) := by
  simp [op75_subset_encoding, List.append_assoc]
See it in the graphDiscuss this resultChallenge it