Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
The zero window is half-open and its order hypothesis is essential. All folds retain actual beta-coded traces. These are support lemmas for the separately verified full inversion endpoint.
Exact theorem in conservative defined notation
∀ F. ∀ k. ∀ l. ∀ L. Le(l,L) → SignedZeroWindow(F,k,L) → SignedZeroWindow(F,k,l)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 22 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
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.
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro hi
03Use earlier factsL12–21
04Use earlier factsL22–22
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
exact hi
Original defined command ledger · 22 lines
- 0001
intro F - 0002
intro k - 0003
intro l - 0004
intro L - 0005
intro hl - 0006
intro hz - 0007
intro i - 0008
intro z - 0009
intro hki - 0010
intro hil - 0011
intro hi - 0012
specialize hz (i) - 0013
specialize hz (z) - 0014
apply hz - 0015
exact hki - 0016
specialize le_trans (S i) - 0017
specialize le_trans (l) - 0018
specialize le_trans (L) - 0019
apply le_trans - 0020
exact hil - 0021
exact hl - 0022
exact hi