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 N F i. (exists dst_positive_code_any_lookup_table dst_positive_scale_any_lookup_table dst_negative_code_any_lookup_table dst_negative_scale_any_lookup_table. (((F) = (((((dst_positive_code_any_lookup_table) + (dst_positive_scale_any_lookup_table)) * S ((dst_positive_code_any_lookup_table) + (dst_positive_scale_any_lookup_table)) + ((dst_positive_scale_any_lookup_table) + (dst_positive_scale_any_lookup_table))) + (((dst_negative_code_any_lookup_table) + (dst_negative_scale_any_lookup_table)) * S ((dst_negative_code_any_lookup_table) + (dst_negative_scale_any_lookup_table)) + ((dst_negative_scale_any_lookup_table) + (dst_negative_scale_any_lookup_table)))) * S ((((dst_positive_code_any_lookup_table) + (dst_positive_scale_any_lookup_table)) * S ((dst_positive_code_any_lookup_table) + (dst_positive_scale_any_lookup_table)) + ((dst_positive_scale_any_lookup_table) + (dst_positive_scale_any_lookup_table))) + (((dst_negative_code_any_lookup_table) + (dst_negative_scale_any_lookup_table)) * S ((dst_negative_code_any_lookup_table) + (dst_negative_scale_any_lookup_table)) + ((dst_negative_scale_any_lookup_table) + (dst_negative_scale_any_lookup_table)))) + ((((dst_negative_code_any_lookup_table) + (dst_negative_scale_any_lookup_table)) * S ((dst_negative_code_any_lookup_table) + (dst_negative_scale_any_lookup_table)) + ((dst_negative_scale_any_lookup_table) + (dst_negative_scale_any_lookup_table))) + (((dst_negative_code_any_lookup_table) + (dst_negative_scale_any_lookup_table)) * S ((dst_negative_code_any_lookup_table) + (dst_negative_scale_any_lookup_table)) + ((dst_negative_scale_any_lookup_table) + (dst_negative_scale_any_lookup_table)))))) /\ (forall dst_index_any_lookup_table. (exists pvs_le_gap_any_lookup_tabledomain. pvs_le_gap_any_lookup_tabledomain + (dst_index_any_lookup_table) = (N)) -> exists dst_positive_any_lookup_table dst_negative_any_lookup_table dst_value_any_lookup_table. ((((exists ff_h_pvs_any_lookup_tableentrypositive. ff_h_pvs_any_lookup_tableentrypositive + S (dst_positive_any_lookup_table) = S ((S (dst_index_any_lookup_table)) * dst_positive_scale_any_lookup_table)) /\ exists ff_q_pvs_any_lookup_tableentrypositive. dst_positive_code_any_lookup_table = ff_q_pvs_any_lookup_tableentrypositive * S ((S (dst_index_any_lookup_table)) * dst_positive_scale_any_lookup_table) + (dst_positive_any_lookup_table))) /\ (((((exists ff_h_pvs_any_lookup_tableentrynegative. ff_h_pvs_any_lookup_tableentrynegative + S (dst_negative_any_lookup_table) = S ((S (dst_index_any_lookup_table)) * dst_negative_scale_any_lookup_table)) /\ exists ff_q_pvs_any_lookup_tableentrynegative. dst_negative_code_any_lookup_table = ff_q_pvs_any_lookup_tableentrynegative * S ((S (dst_index_any_lookup_table)) * dst_negative_scale_any_lookup_table) + (dst_negative_any_lookup_table))) /\ (exists ge_balance_positive_any_lookup_tableentryvalue ge_balance_negative_any_lookup_tableentryvalue. (((((dst_value_any_lookup_table) = 2 * (ge_balance_positive_any_lookup_tableentryvalue) /\ (ge_balance_negative_any_lookup_tableentryvalue) = 0) \/ exists ge_signed_half_any_lookup_tableentryvaluedecode. (((dst_value_any_lookup_table) = 2 * ge_signed_half_any_lookup_tableentryvaluedecode + 1 /\ (ge_balance_positive_any_lookup_tableentryvalue) = 0) /\ (ge_balance_negative_any_lookup_tableentryvalue) = S ge_signed_half_any_lookup_tableentryvaluedecode))) /\ ((dst_positive_any_lookup_table) + ge_balance_negative_any_lookup_tableentryvalue = (dst_negative_any_lookup_table) + ge_balance_positive_any_lookup_tableentryvalue))))))))) -> exists z. (exists dst_positive_code_any_lookup_result dst_positive_scale_any_lookup_result dst_negative_code_any_lookup_result dst_negative_scale_any_lookup_result dst_positive_any_lookup_result dst_negative_any_lookup_result. (((F) = (((((dst_positive_code_any_lookup_result) + (dst_positive_scale_any_lookup_result)) * S ((dst_positive_code_any_lookup_result) + (dst_positive_scale_any_lookup_result)) + ((dst_positive_scale_any_lookup_result) + (dst_positive_scale_any_lookup_result))) + (((dst_negative_code_any_lookup_result) + (dst_negative_scale_any_lookup_result)) * S ((dst_negative_code_any_lookup_result) + (dst_negative_scale_any_lookup_result)) + ((dst_negative_scale_any_lookup_result) + (dst_negative_scale_any_lookup_result)))) * S ((((dst_positive_code_any_lookup_result) + (dst_positive_scale_any_lookup_result)) * S ((dst_positive_code_any_lookup_result) + (dst_positive_scale_any_lookup_result)) + ((dst_positive_scale_any_lookup_result) + (dst_positive_scale_any_lookup_result))) + (((dst_negative_code_any_lookup_result) + (dst_negative_scale_any_lookup_result)) * S ((dst_negative_code_any_lookup_result) + (dst_negative_scale_any_lookup_result)) + ((dst_negative_scale_any_lookup_result) + (dst_negative_scale_any_lookup_result)))) + ((((dst_negative_code_any_lookup_result) + (dst_negative_scale_any_lookup_result)) * S ((dst_negative_code_any_lookup_result) + (dst_negative_scale_any_lookup_result)) + ((dst_negative_scale_any_lookup_result) + (dst_negative_scale_any_lookup_result))) + (((dst_negative_code_any_lookup_result) + (dst_negative_scale_any_lookup_result)) * S ((dst_negative_code_any_lookup_result) + (dst_negative_scale_any_lookup_result)) + ((dst_negative_scale_any_lookup_result) + (dst_negative_scale_any_lookup_result)))))) /\ (((((exists ff_h_pvs_any_lookup_resultpositive. ff_h_pvs_any_lookup_resultpositive + S (dst_positive_any_lookup_result) = S ((S (i)) * dst_positive_scale_any_lookup_result)) /\ exists ff_q_pvs_any_lookup_resultpositive. dst_positive_code_any_lookup_result = ff_q_pvs_any_lookup_resultpositive * S ((S (i)) * dst_positive_scale_any_lookup_result) + (dst_positive_any_lookup_result))) /\ (((((exists ff_h_pvs_any_lookup_resultnegative. ff_h_pvs_any_lookup_resultnegative + S (dst_negative_any_lookup_result) = S ((S (i)) * dst_negative_scale_any_lookup_result)) /\ exists ff_q_pvs_any_lookup_resultnegative. dst_negative_code_any_lookup_result = ff_q_pvs_any_lookup_resultnegative * S ((S (i)) * dst_negative_scale_any_lookup_result) + (dst_negative_any_lookup_result))) /\ (exists ge_balance_positive_any_lookup_resultvalue ge_balance_negative_any_lookup_resultvalue. (((((z) = 2 * (ge_balance_positive_any_lookup_resultvalue) /\ (ge_balance_negative_any_lookup_resultvalue) = 0) \/ exists ge_signed_half_any_lookup_resultvaluedecode. (((z) = 2 * ge_signed_half_any_lookup_resultvaluedecode + 1 /\ (ge_balance_positive_any_lookup_resultvalue) = 0) /\ (ge_balance_negative_any_lookup_resultvalue) = S ge_signed_half_any_lookup_resultvaluedecode))) /\ ((dst_positive_any_lookup_result) + ge_balance_negative_any_lookup_resultvalue = (dst_negative_any_lookup_result) + ge_balance_positive_any_lookup_resultvalue)))))))))Constructive proof overview
Generated structural guide
Every actual table supplies an actual signed value at any requested index, rather than a totality oracle.
The unchanged tactic script uses 3 declared prerequisites and contains 15 exact native proof lines.
Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
WS0001 signed_table_domain_resize divisor_signed_table_lookup Alpha theorem; checked-use authorized le_refl Stable theorem; checked-use authorizedDirect dependents
WS0006 signed_table_add_extensional_unique WS000A signed_table_multiply_extensional_unique WS000E signed_table_scalar_extensional_unique WS0010 signed_table_add_exists WS0013 signed_table_multiply_exists WS0016 signed_table_scalar_exists WS0024 signed_table_weighted_add_distributive WS0026 signed_table_weighted_scalar_commuteFormal 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.
Named ingredients (1)
01Fix variables and assumptionsL1–4
02Use earlier factsL5–14
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L5
specialize divisor_signed_table_lookup (i) - L6
specialize divisor_signed_table_lookup (F) - L7
specialize divisor_signed_table_lookup (i) - L8
apply divisor_signed_table_lookup - L9
specialize signed_table_domain_resize (N) - L10
specialize signed_table_domain_resize (i) - L11
specialize signed_table_domain_resize (F) - L12
apply signed_table_domain_resize - L13
exact ht - L14
specialize le_refl (i)
03Use earlier factsL15–15
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L15
apply le_refl
Original exact command ledger · 15 lines
- 0001
intro N - 0002
intro F - 0003
intro i - 0004
intro ht - 0005
specialize divisor_signed_table_lookup (i) - 0006
specialize divisor_signed_table_lookup (F) - 0007
specialize divisor_signed_table_lookup (i) - 0008
apply divisor_signed_table_lookup - 0009
specialize signed_table_domain_resize (N) - 0010
specialize signed_table_domain_resize (i) - 0011
specialize signed_table_domain_resize (F) - 0012
apply signed_table_domain_resize - 0013
exact ht - 0014
specialize le_refl (i) - 0015
apply le_refl