DL00A3

matrix_lattice_absolute_nonzero_of_pair

A nonzero represented integer has a nonzero actual absolute difference, in either sign orientation.

Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.

This branch proves the finite determinant/rank/span substrate. It does not claim Smith or Hermite normal form, lattice index equals determinant, determinant multiplicativity, lattice reduction, or geometry-of-numbers theorems.

Exact theorem in conservative defined notation

∀ p. ∀ n. ∀ D. ¬p = n → p = n + D ∨ n = p + D → ¬D = 0

Every linked abbreviation expands hygienically to the identical original native formula.

Definition DAG

none

Actual proof prerequisites

none
Original expanded first-order statement
forall p n D. ~(p = n) -> (((p) = (n) + (D)) \/ ((n) = (p) + (D))) -> ~(D = 0)

Complete tactic proof in conservative notation

All 17 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.

Read the argument

Proof checkpoints

17 script commands · 11 reading checkpoints · 0 local claims

This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.

Definition notation is shown below. Open the paired exact edition for the original native formulas. Source pairing is not a new equivalence certificate.

01Fix variables and assumptionsL1–6

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro p
  2. L2
    intro n
  3. L3
    intro D
  4. L4
    intro hpair
  5. L5
    intro habsolute
  6. L6
    intro hzero
02Use earlier factsL7–7

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L7
    apply hpair
03Separate the logical casesL8–8

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L8
    cases habsolute
04Calculate and transport equalitiesL9–9

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L9
    trans n + D
05Use earlier factsL10–10

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L10
    exact habsolute_left
06Calculate and transport equalitiesL11–11

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L11
    rewrite hzero
07Use earlier factsL12–12

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L12
    apply PA3
08Calculate and transport equalitiesL13–14

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L13
    symm
  2. L14
    trans p + D
09Use earlier factsL15–15

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L15
    exact habsolute_right
10Calculate and transport equalitiesL16–16

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L16
    rewrite hzero
11Use earlier factsL17–17

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L17
    apply PA3

Library-wide reading audit

Original defined command ledger · 17 lines
  1. 0001intro p
  2. 0002intro n
  3. 0003intro D
  4. 0004intro hpair
  5. 0005intro habsolute
  6. 0006intro hzero
  7. 0007apply hpair
  8. 0008cases habsolute
  9. 0009trans n + D
  10. 0010exact habsolute_left
  11. 0011rewrite hzero
  12. 0012apply PA3
  13. 0013symm
  14. 0014trans p + D
  15. 0015exact habsolute_right
  16. 0016rewrite hzero
  17. 0017apply PA3