Lax Lean Archive

Proof of `FO(≤, +, ×) = FO(≤, +, BIT)` (2nd statement)

groundedproofs/Lax895169Proofs/Bridge.lean · lax-895169

What this proof establishes

no assumptions

thm✓Lax895169.ACZeroIsBitLogic (2nd statement)

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The library's translation, with the powers of two defined from addition and multiplication.