lor is associative

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

Recorded description

For every natural a, b, c: lor(lor(a, b), c) = lor(a, lor(b, c)).

Formal statement

theorem Nat.lor_assoc : ((x0 : AxNat) -> ((x1 : AxNat) -> ((x2 : AxNat) -> Eq.{1} AxNat (AxNat.lor (AxNat.lor x0 x1) x2) (AxNat.lor x0 (AxNat.lor x1 x2)))))

Dependencies

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

4 direct dependencies 0 direct dependents

Evidence

kernel-Nat.lor_assoc

Kind: kernel-term
Status: checked

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

Checker command

test "$(cargo run -q --release -p axeyum-lean-kernel --example nat_theorem_inventory -- lor_assoc 2>/dev/null | grep -Ec '^Nat\.lor_assoc[[: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 -- producing this row at all is a machine-checked proof. `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_assoc[[:space:]]` so a sibling name cannot satisfy this row. Run `--release` -- the debug build of this inventory example SIGABRTs on stack depth (unrelated to this proof).

compute-Nat.lor_assoc

Kind: kernel-term
Status: checked

Supports: lor(lor(3, 5), 6) = lor(3, lor(5, 6)) = 7, with BOTH intermediate values (lor(3,5)=7, lor(5,6)=7) genuinely NONZERO -- the fully-generic sub-case of the hard leaf (both nested lorAux applications stuck, neither settling for the easy zero-corner), not a degenerate instance a wrong proof of the easy leaves alone could pass.

Checker command

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

Evidence notes

Applies `Nat.lor_assoc` symbolically (against free `a`, `b`, `c`) and at the concrete instance `(a, b, c) = (3, 5, 6)`, confirming the admitted type matches `Eq (lor (lor 3 5) 6) (lor 3 (lor 5 6))`, that `lor 3 5` and `lor 5 6` are each nonzero (non-vacuity of the hard-leaf exercise), and that both sides compute to `7`.

footprint-Nat.lor_assoc

Kind: instance-pin
Status: checked

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

Checker command

cargo run -q --release -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-assoc-exec",
  "source": "theorem name and canonical type read directly via nat_theorem_inventory, which prints render_lean of the admitted type."
}