Identifier
F:int-modeq-symm
Proof route
kernel-lean
External status
proved
Axiom footprint
Empty

Recorded description

For all integers n, a and b: if a is congruent to b modulo n, then b is congruent to a modulo n.

Formal statement
theorem Int.modEq_symm : ((x0 : Int) -> ((x1 : Int) -> ((x2 : Int) -> ((x3 : Int.ModEq x0 x1 x2) -> Int.ModEq x0 x2 x1))))

Dependencies

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

Direct dependencies appear to the left. The current fact is in the center. Facts that depend directly on it appear to the right. Congruence mod n is reflexive o Current fact [generated] kernel theorem Int. [generated] kernel theorem Int. [generated] kernel theorem Int. [generated] kernel theorem Int. [generated] kernel theorem Int. [generated] kernel theorem Int. [generated] kernel theorem Int. [generated] kernel theorem Int.
1 direct dependencies 31 direct dependents Graph shows the first 8 on each side.

Evidence

kernel-Int.modEq_symm

Kind
kernel-term
Status
checked

Supports: For all integers n, a and b: if a is congruent to b modulo n, then b is congruent to a modulo n.

Checker command
test "$(cargo run -q -p axeyum-lean-kernel --example int_theorem_inventory -- modEq_symm 2>/dev/null | grep -Ec '^theorem[[:space:]]+Int\.modEq_symm[[:space:]]')" -ge 1
Evidence notes

`build_int_prelude` admits this theorem through the trusted `Kernel::add_declaration` gate, which re-checks the proof term against the stated type, so producing this row at all is a machine-checked proof. `int_theorem_inventory` exits non-zero for a name that does not exist, and the `grep -q` requires the admitted `theorem`-kind row to be printed.

footprint-Int.modEq_symm

Kind
exhaustive-enumeration
Status
checked

Supports: axiom_footprint: [] -- the Int prelude's trusted surface is empty

Checker command
cargo run -q -p axeyum-lean-kernel --example nat_axiom_inventory -- --require-axiom-free integer
Evidence notes

`nat_axiom_inventory --require-axiom-free integer` enumerates the built Int environment (which nests the Nat development) and exits non-zero unless it admits no Axiom, Opaque or Quotient declaration (measured: axiom=0 opaque=0 quotient=0). A theorem cannot depend on a trusted declaration the environment does not contain, so an empty trusted surface bounds every individual theorem's footprint by [].

Provenance

{
  "date": "2026-08-25",
  "established_by": "axeyum-lean-kernel build_int_prelude, lane rado-claim-ledger",
  "source": "one of the theorems build_int_prelude admits; registered to close the flywheel's fact-ledger arrow for recently landed Int theorems"
}