AFTD Auto-Formalizing Theoretical Domains

CodingTheory.Johnson.BitVec

abbrevimported Lean

The type of binary words of length $n$, namely functions $\mathrm{Fin}\,n \to \mathrm{Bool}$.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators RealInnerProductSpace in
open Finset in
noncomputable abbrev CodingTheory.Johnson.BitVec (n : ℕ)
Defined in
TCSlib, `CodingTheory.Johnson.BitVec`
Lean proof
By Allan Li, Frederick Dehmel, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
none listed
Used by 14

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators RealInnerProductSpace in
open Finset in
noncomputable abbrev CodingTheory.Johnson.BitVec (n : ℕ) := Fin n → Bool
See it in the graphDiscuss this resultChallenge it