Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Boolean-to-symbol encoding distributes over conjunction

Proved
boolSym_and

by junyihjy · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

The boolean-to-symbol encoding distributes over conjunction: encoding the AND of two booleans equals the conditional encoding based on the first boolean.

Formal statement
import Definitions.Def_CookLevin_Cost

open CookLevin

theorem boolSym_and (b1 b2 : Bool) :
    boolSym (b1 && b2) = if b1 then boolSym b2 else zeroSymbol := by sorry

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me