bool_parent_pair_moments
A Boolean parent implication remains valid after multiplication by any bit or its complement, giving two pair-moment inequalities.
Statement
theorem bool_parent_pair_moments :
∀ a b c : Bool, (a = true → b = true) →
(a && c).toNat ≤ (b && c).toNat ∧
a.toNat + (b && c).toNat ≤ b.toNat + (a && c).toNat- Source
- Uniform helper for the OP-205 / RT-1 campaign, following arXiv:2610.15635 Section 3. These class-model, pruning and colour-rigidity lemmas do not establish the unresolved graph covering value. No research advance is claimed.
- Verified
- 27 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
The proof, explained
The theorem establishes two numerical inequalities for the indicator values of Boolean variables $a, b, c$ under the assumption that $a$ implies $b$. Because the variables are Booleans, the proposition is decidable with only eight possible truth assignments. Lean's `decide` tactic verifies the claim by exhaustive evaluation over all cases.
The inequalities hold for all Boolean choices of $a, b,$ and $c$ whenever $a = \mathrm{true} \implies b = \mathrm{true}$. automation
Because $a, b,$ and $c$ are Booleans, there are only $2^3 = 8$ possible combinations of values. For each combination, evaluating the implication and the two numerical inequalities on the natural numbers $0$ and $1$ is a finite computation. The automated tactic `decide` verifies all cases exhaustively.
decide
- The proof relies on Lean's kernel computation to verify the claim across all $2^3 = 8$ possible valuations of the Boolean variables.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Finsettheorem bool_parent_pair_moments : ∀ a b c : Bool, (a = true → b = true) → (a && c).toNat ≤ (b && c).toNat ∧ a.toNat + (b && c).toNat ≤ b.toNat + (a && c).toNat := by decide