AFTD Auto-Formalizing Theoretical Domains

binary_bool_sign_not

theoremverified

Negating a Boolean value negates its rational sign.

Statement

theorem binary_bool_sign_not (b : Bool) :
    binary_bool_sign (!b) = -binary_bool_sign b
Source
Reusable finite-cube and ordered-biclique helpers for the uniform OP-205 / RT-1 full-root-gap reduction following arXiv:2610.15635. The deficiency-one singular-coordinate/tree argument formalizes the Boolean setting of arXiv:1103.3693 Lemma 2.5.4 and Corollary 2.5.6; arXiv:2212.14685 Section 2.3 gives a related partition-size discussion. These are helper formalizations, not an original graph covering result; no advance is claimed.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • binary_bool_signThe rational sign of a Boolean value: true gives one and false gives minus one.
Used by 2

The proof, explained

The proof proceeds by case analysis on the Boolean variable b, which can only be false or true. In each case, unfolding the definition of binary_bool_sign reduces the identity to evaluating Boolean negation and elementary rational arithmetic. The norm_num tactic computes both sides and verifies that the equality holds in both cases.

  1. The equality binary_bool_sign (!b) = -binary_bool_sign b holds for all b : Bool.

    Case analysis on the Boolean b splits the goal into two subgoals: 1. When b is false, the left-hand side is binary_bool_sign (!false) = binary_bool_sign true = 1, while the right-hand side is -binary_bool_sign false = -(-1) = 1. 2. When b is true, the left-hand side is binary_bool_sign (!true) = binary_bool_sign false = -1, while the right-hand side is -binary_bool_sign true = -(1) = -1. In both branches, norm_num unfolds the definition of binary_bool_sign and computes the resulting Boolean operations and rational arithmetic to close the goal.

    line 7

    uses binary_bool_sign

      cases b <;> norm_num [binary_bool_sign]
binary_bool_sign
The sign of a Boolean: 1 if true, and -1 if false (as a rational number).

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

open Finsetset_option maxHeartbeats 1000000set_option maxRecDepth 4000theorem binary_bool_sign_not (b : Bool) :    binary_bool_sign (!b) = -binary_bool_sign b := by  cases b <;> norm_num [binary_bool_sign]
See it in the graphDiscuss this resultChallenge it