Append is associative over a computed List

Identifier: F:list-append-assoc
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

For any three lists a, b, c over a common element type, appending (a then b) then c gives the same list as appending a then (b then c) -- List.append is associative.

Formal statement

theorem List.append_assoc : ((x0 : Sort (1)) -> ((x1 : List.{0} x0) -> ((x2 : List.{0} x0) -> ((x3 : List.{0} x0) -> Eq.{1} (List.{0} x0) (List.append x0 (List.append x0 x1 x2) x3) (List.append x0 x1 (List.append x0 x2 x3))))))

Dependencies

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

0 direct dependencies 1 direct dependents

Evidence

kernel-list-append-assoc

Kind: kernel-term
Status: checked

Supports: List.append_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 list_theorem_inventory -- List.append_assoc 2>/dev/null | grep -Fc '((x0 : Sort (1)) -> ((x1 : List.{0} x0) -> ((x2 : List.{0} x0) -> ((x3 : List.{0} x0) -> Eq.{1} (List.{0} x0) (List.append x0 (List.append x0 x1 x2) x3) (List.append x0 x1 (List.append x0 x2 x3))))))')" -ge 1

Evidence notes

The pattern is the FULL admitted type (rendered by Kernel::render_lean via list_theorem_inventory), not the theorem's name -- a drifted statement would fail this check. build_list_nat_bridge admits this theorem only through the trusted kernel gate, so a successful build IS the type-check.

footprint-list-append-assoc

Kind: instance-pin
Status: checked

Supports: axiom_footprint: [] -- read from Kernel::axiom_footprint for this declaration, not from a maintained list

Checker command

cargo test -q --release -p axeyum-lean-kernel --lib -- list_prelude::list_prelude_tests::the_list_prelude_declares_no_axioms --test-threads=1

Evidence notes

list_prelude::list_prelude_tests::the_list_prelude_declares_no_axioms asserts Kernel::axiom_footprint(name).is_empty() for this declaration (among others in the same coverage sweep), read directly from the kernel rather than asserted from a list.

evaluation-list-append-assoc

Kind: instance-pin
Status: checked

Supports: The List operations this statement is about COMPUTE the intended values, with negative controls -- the kernel cannot tell a Definition is wrong.

Checker command

cargo test -q --release -p axeyum-lean-kernel --lib -- list_prelude:: --test-threads=4

Evidence notes

list_prelude_tests.rs and bridge_tests.rs reduce List.length/append/map/foldr/reverse/sum/toMultiset/count to a concrete numeral or nil/cons skeleton at tiny discriminating arguments and pair every positive with the specific wrong formula its negative control rules out.

Provenance

{
  "date": "2026-09-03",
  "established_by": "axeyum-lean-kernel build_list_prelude",
  "source": "theorem name and canonical type read directly via list_theorem_inventory, which prints render_lean of the admitted type; declared by list_prelude.rs/theorems.rs/bridge.rs (lane list-carrier-1, ADR-1579)."
}