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 expanded first-order arithmetic statement
forall F k. (forall sfs_index_empty_window sfs_value_empty_window. (exists pvs_le_gap_empty_windowlower. pvs_le_gap_empty_windowlower + (k) = (sfs_index_empty_window)) -> (exists pvs_gap_empty_windowupper. pvs_gap_empty_windowupper + S (sfs_index_empty_window) = (k)) -> (exists dst_positive_code_empty_windowentry dst_positive_scale_empty_windowentry dst_negative_code_empty_windowentry dst_negative_scale_empty_windowentry dst_positive_empty_windowentry dst_negative_empty_windowentry. (((F) = (((((dst_positive_code_empty_windowentry) + (dst_positive_scale_empty_windowentry)) * S ((dst_positive_code_empty_windowentry) + (dst_positive_scale_empty_windowentry)) + ((dst_positive_scale_empty_windowentry) + (dst_positive_scale_empty_windowentry))) + (((dst_negative_code_empty_windowentry) + (dst_negative_scale_empty_windowentry)) * S ((dst_negative_code_empty_windowentry) + (dst_negative_scale_empty_windowentry)) + ((dst_negative_scale_empty_windowentry) + (dst_negative_scale_empty_windowentry)))) * S ((((dst_positive_code_empty_windowentry) + (dst_positive_scale_empty_windowentry)) * S ((dst_positive_code_empty_windowentry) + (dst_positive_scale_empty_windowentry)) + ((dst_positive_scale_empty_windowentry) + (dst_positive_scale_empty_windowentry))) + (((dst_negative_code_empty_windowentry) + (dst_negative_scale_empty_windowentry)) * S ((dst_negative_code_empty_windowentry) + (dst_negative_scale_empty_windowentry)) + ((dst_negative_scale_empty_windowentry) + (dst_negative_scale_empty_windowentry)))) + ((((dst_negative_code_empty_windowentry) + (dst_negative_scale_empty_windowentry)) * S ((dst_negative_code_empty_windowentry) + (dst_negative_scale_empty_windowentry)) + ((dst_negative_scale_empty_windowentry) + (dst_negative_scale_empty_windowentry))) + (((dst_negative_code_empty_windowentry) + (dst_negative_scale_empty_windowentry)) * S ((dst_negative_code_empty_windowentry) + (dst_negative_scale_empty_windowentry)) + ((dst_negative_scale_empty_windowentry) + (dst_negative_scale_empty_windowentry)))))) /\ (((((exists ff_h_pvs_empty_windowentrypositive. ff_h_pvs_empty_windowentrypositive + S (dst_positive_empty_windowentry) = S ((S (sfs_index_empty_window)) * dst_positive_scale_empty_windowentry)) /\ exists ff_q_pvs_empty_windowentrypositive. dst_positive_code_empty_windowentry = ff_q_pvs_empty_windowentrypositive * S ((S (sfs_index_empty_window)) * dst_positive_scale_empty_windowentry) + (dst_positive_empty_windowentry))) /\ (((((exists ff_h_pvs_empty_windowentrynegative. ff_h_pvs_empty_windowentrynegative + S (dst_negative_empty_windowentry) = S ((S (sfs_index_empty_window)) * dst_negative_scale_empty_windowentry)) /\ exists ff_q_pvs_empty_windowentrynegative. dst_negative_code_empty_windowentry = ff_q_pvs_empty_windowentrynegative * S ((S (sfs_index_empty_window)) * dst_negative_scale_empty_windowentry) + (dst_negative_empty_windowentry))) /\ (exists ge_balance_positive_empty_windowentryvalue ge_balance_negative_empty_windowentryvalue. (((((sfs_value_empty_window) = 2 * (ge_balance_positive_empty_windowentryvalue) /\ (ge_balance_negative_empty_windowentryvalue) = 0) \/ exists ge_signed_half_empty_windowentryvaluedecode. (((sfs_value_empty_window) = 2 * ge_signed_half_empty_windowentryvaluedecode + 1 /\ (ge_balance_positive_empty_windowentryvalue) = 0) /\ (ge_balance_negative_empty_windowentryvalue) = S ge_signed_half_empty_windowentryvaluedecode))) /\ ((dst_positive_empty_windowentry) + ge_balance_negative_empty_windowentryvalue = (dst_negative_empty_windowentry) + ge_balance_positive_empty_windowentryvalue))))))))) -> sfs_value_empty_window=0)Constructive proof overview
Generated structural guide
A half-open zero window with coinciding endpoints is genuinely empty.
The unchanged tactic script uses 1 declared prerequisite and contains 13 exact native proof lines.
Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
lt_not_le Stable theorem; checked-use authorizedDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
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–7
02Separate the logical casesL8–8
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L8
exfalso