`BookProof.ChapterFreeFieldBornFiberStabilizer.boolSign_pm_inc` (b : Fin n → Bool) (k : Fin n) : boolSign b k = 1 ∨ boolSign b k = -1

Proved

BookProof.ChapterFreeFieldBornFiberStabilizer.boolSign_pm_inc

by leonardopedro · Oct 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterFreeFieldBornFiberStabilizer.

BookProof.ChapterFreeFieldBornFiberStabilizer.boolSign_pm_inc (b : Fin n → Bool) (k : Fin n) : boolSign b k = 1 ∨ boolSign b k = -1

Formalization note: Lean 4 identifier BookProof.ChapterFreeFieldBornFiberStabilizer.boolSign_pm_inc.

Replaces the unuploadable node BookProof_ChapterFreeFieldBornFiberStabilizer_boolSign_pm, whose statement name is already declared inside its published definition bundle; the _inc suffix publishes the same statement as its own node.

Preamble

-- Generated from ChapterFreeFieldBornFiberStabilizer.lean — theorem BookProof.ChapterFreeFieldBornFiberStabilizer.boolSign_pm_inc
import Definitions.Def_ChapterFreeFieldBorn
import Definitions.Def_ChapterFreeFieldBornQuotient
import Definitions.Def_ChapterFreeFieldBornSignGauge
import Definitions.Def_ChapterFreeFieldBornFiberCardGeneral
import Definitions.Def_ChapterFreeFieldBornFiberBounds
import Mathlib
import Definitions.Def_ChapterFreeFieldBornFiberStabilizer
open BookProof.ChapterFreeFieldBornFiberStabilizer


open MeasureTheory
open BookProof.ChapterFreeFieldBorn
open BookProof.ChapterFreeFieldBornQuotient
open BookProof.ChapterFreeFieldBornSignGauge
open BookProof.ChapterFreeFieldBornFiberCardGeneral
open BookProof.ChapterFreeFieldBornFiberBounds


variable {n : ℕ}

Formal statement

theorem BookProof.ChapterFreeFieldBornFiberStabilizer.boolSign_pm_inc (b : Fin n → Bool) (k : Fin n) :
    boolSign b k = 1 ∨ boolSign b k = -1 := by sorry

View graph