lor decodes through a bit-appended argument

Identifier: F:nat-lor-bit
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

For every Bool a, Nat m, Bool b, Nat n: lor(bit(a, m), bit(b, n)) = bit(a || b, lor(m, n)).

Formal statement

theorem Nat.lor_bit : ((x0 : Bool) -> ((x1 : AxNat) -> ((x2 : Bool) -> ((x3 : AxNat) -> Eq.{1} AxNat (AxNat.lor (AxNat.bit x0 x1) (AxNat.bit x2 x3)) (AxNat.bit ((fun (x4 : Bool) => fun (x5 : Bool) => Bool.rec.{1} (fun (x6 : Bool) => Bool) x5 Bool.true x4) x0 x2) (AxNat.lor x1 x3))))))

Dependencies

The graph shows direct ledger edges. Follow a node to open its artifact page.

5 direct dependencies 0 direct dependents

Evidence

kernel-Nat.lor_bit

Kind: kernel-term
Status: checked

Supports: Nat.lor_bit is admitted by the trusted kernel gate with the type recorded in formal.statement.

Checker command

test "$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- lor_bit 2>/dev/null | grep -Ec '^Nat\.lor_bit[[:space:]]')" -ge 1

Evidence notes

`build_nat_prelude` admits this theorem only through the trusted `Kernel::add_declaration` gate, which re-checks the proof term against the stated type. `nat_theorem_inventory` exits non-zero for a name that does not exist, and `grep -Ec` consumes the pipe so the tested count decides the exit status. Anchored with `^Nat\.lor_bit[[:space:]]` so a future sibling cannot satisfy this row.

compute-Nat.lor_bit

Kind: kernel-term
Status: checked

Supports: lor(bit(true, 2), bit(false, 3)) = lor(5, 6) = 7 (0b101 | 0b110 = 0b111), against bit(true || false, lor(2, 3)) = bit(true, 3) = 7 (lor(2,3)=3, 0b10 | 0b11 = 0b11) -- a DISCRIMINATING instance shared with F:nat-land-bit's (a=true, m=2, b=false, n=3): land gives 4, lor gives 7 at the same operands, so a wrong-way `||`/`&&` swap or a swapped `bit` encoding does not land on 7 here.

Checker command

cargo test -p axeyum-lean-kernel --lib nat_prelude::nat_prelude_tests::lor_bit_applies_at_a_concrete_discriminating_instance

Evidence notes

Applies `Nat.lor_bit` both against fully free (a, m, b, n) -- by re-declaring the statement as a fresh closed theorem over Pi/lambda-bound variables and requiring the kernel admit it -- and at the concrete, bit-differing instance (a=true, m=2, b=false, n=3), confirming both instantiations compute to the stated values.

footprint-Nat.lor_bit

Kind: instance-pin
Status: checked

Supports: axiom_footprint: [] -- the Nat environment admits no trusted declaration

Checker command

cargo run -q -p axeyum-lean-kernel --example nat_axiom_inventory -- --require-axiom-free nat

Evidence notes

Reports `nat: axiom=0 opaque=0 quotient=0 total_trusted=0`, over the FULL trusted surface rather than `Declaration::Axiom` alone. The enumeration is per-environment, not per-theorem; it bounds this theorem's footprint because a proof cannot depend on a trusted declaration the environment does not contain.

Provenance

{
  "date": "2026-08-29",
  "established_by": "axeyum-lean-kernel build_nat_prelude, lane nat-lor-ldiff-bit",
  "source": "theorem name and canonical type read directly via nat_theorem_inventory, which prints render_lean of the admitted type."
}