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.
Exact expanded first-order arithmetic statement
forall ac bc cc p n q m. (exists ge_balance_positive_bridge_first_add ge_balance_negative_bridge_first_add. (((((ac) = 2 * (ge_balance_positive_bridge_first_add) /\ (ge_balance_negative_bridge_first_add) = 0) \/ exists ge_signed_half_bridge_first_adddecode. (((ac) = 2 * ge_signed_half_bridge_first_adddecode + 1 /\ (ge_balance_positive_bridge_first_add) = 0) /\ (ge_balance_negative_bridge_first_add) = S ge_signed_half_bridge_first_adddecode))) /\ ((p) + ge_balance_negative_bridge_first_add = (n) + ge_balance_positive_bridge_first_add))) -> (exists ge_balance_positive_bridge_second_add ge_balance_negative_bridge_second_add. (((((bc) = 2 * (ge_balance_positive_bridge_second_add) /\ (ge_balance_negative_bridge_second_add) = 0) \/ exists ge_signed_half_bridge_second_adddecode. (((bc) = 2 * ge_signed_half_bridge_second_adddecode + 1 /\ (ge_balance_positive_bridge_second_add) = 0) /\ (ge_balance_negative_bridge_second_add) = S ge_signed_half_bridge_second_adddecode))) /\ ((q) + ge_balance_negative_bridge_second_add = (m) + ge_balance_positive_bridge_second_add))) -> (exists ge_balance_positive_bridge_output_add ge_balance_negative_bridge_output_add. (((((cc) = 2 * (ge_balance_positive_bridge_output_add) /\ (ge_balance_negative_bridge_output_add) = 0) \/ exists ge_signed_half_bridge_output_adddecode. (((cc) = 2 * ge_signed_half_bridge_output_adddecode + 1 /\ (ge_balance_positive_bridge_output_add) = 0) /\ (ge_balance_negative_bridge_output_add) = S ge_signed_half_bridge_output_adddecode))) /\ ((((p) + (q))) + ge_balance_negative_bridge_output_add = (((n) + (m))) + ge_balance_positive_bridge_output_add))) -> (exists sa_lp_gaussian_bridge_add sa_ln_gaussian_bridge_add sa_rp_gaussian_bridge_add sa_rn_gaussian_bridge_add sa_op_gaussian_bridge_add sa_on_gaussian_bridge_add. (((ac = 2 * sa_lp_gaussian_bridge_add /\ sa_ln_gaussian_bridge_add = 0) \/ exists sd_half_gaussian_bridge_add_left. ((ac = 2 * sd_half_gaussian_bridge_add_left + 1 /\ sa_lp_gaussian_bridge_add = 0) /\ sa_ln_gaussian_bridge_add = S sd_half_gaussian_bridge_add_left)) /\ (((bc = 2 * sa_rp_gaussian_bridge_add /\ sa_rn_gaussian_bridge_add = 0) \/ exists sd_half_gaussian_bridge_add_right. ((bc = 2 * sd_half_gaussian_bridge_add_right + 1 /\ sa_rp_gaussian_bridge_add = 0) /\ sa_rn_gaussian_bridge_add = S sd_half_gaussian_bridge_add_right)) /\ (((cc = 2 * sa_op_gaussian_bridge_add /\ sa_on_gaussian_bridge_add = 0) \/ exists sd_half_gaussian_bridge_add_output. ((cc = 2 * sd_half_gaussian_bridge_add_output + 1 /\ sa_op_gaussian_bridge_add = 0) /\ sa_on_gaussian_bridge_add = S sd_half_gaussian_bridge_add_output)) /\ (sa_lp_gaussian_bridge_add + sa_rp_gaussian_bridge_add) + sa_on_gaussian_bridge_add = (sa_ln_gaussian_bridge_add + sa_rn_gaussian_bridge_add) + sa_op_gaussian_bridge_add))))Constructive proof overview
Generated structural guide
Actual arbitrary signed-pair add contribution balances construct the unchanged historic canonical signed-add graph.
The unchanged tactic script uses 4 declared prerequisites and contains 58 exact native proof lines.
Alpha v34 checked-use · first admitted v28 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
integer_span_pair_add_congruence Alpha theorem; checked-use authorized GI003B gaussian_signed_balance_integer_transport signed_add_of_decoded_equation Alpha theorem; checked-use authorized add_comm 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.
Named ingredients (1)
01Fix variables and assumptionsL1–10
02Separate the logical casesL11–16
03Establish hequalL17–26
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply integer span pair add congruence.
- L17
have hequal : ((((p) + (q))) + (((x1) + (x3)))) = ((((x) + (x2))) + (((n) + (m)))) - L18
specialize integer_span_pair_add_congruence p - L19
specialize integer_span_pair_add_congruence n - L20
specialize integer_span_pair_add_congruence q - L21
specialize integer_span_pair_add_congruence m - L22
specialize integer_span_pair_add_congruence x - L23
specialize integer_span_pair_add_congruence x1 - L24
specialize integer_span_pair_add_congruence x2 - L25
specialize integer_span_pair_add_congruence x3 - L26
apply integer_span_pair_add_congruence
04Calculate and transport equalitiesL27–27
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L27
trans n + x
05Use earlier factsL28–29
06Calculate and transport equalitiesL30–30
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L30
trans m + x2
07Use earlier factsL31–32
08Establish hnormalizedL33–41
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian signed balance integer transport.
- L33
have hnormalized : SignedBalance(cc,x + x2,x1 + x3)Definitions: SignedBalance - L34
specialize gaussian_signed_balance_integer_transport cc - L35
specialize gaussian_signed_balance_integer_transport ((p) + (q)) - L36
specialize gaussian_signed_balance_integer_transport ((n) + (m)) - L37
specialize gaussian_signed_balance_integer_transport ((x) + (x2)) - L38
specialize gaussian_signed_balance_integer_transport ((x1) + (x3)) - L39
apply gaussian_signed_balance_integer_transport - L40
exact hequal - L41
exact houtput
09Separate the logical casesL42–44
10Use earlier factsL45–54
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L45
specialize signed_add_of_decoded_equation ac - L46
specialize signed_add_of_decoded_equation bc - L47
specialize signed_add_of_decoded_equation cc - L48
specialize signed_add_of_decoded_equation x - L49
specialize signed_add_of_decoded_equation x1 - L50
specialize signed_add_of_decoded_equation x2 - L51
specialize signed_add_of_decoded_equation x3 - L52
specialize signed_add_of_decoded_equation x4 - L53
specialize signed_add_of_decoded_equation x5 - L54
apply signed_add_of_decoded_equation
Original exact command ledger · 58 lines
- 0001
intro ac - 0002
intro bc - 0003
intro cc - 0004
intro p - 0005
intro n - 0006
intro q - 0007
intro m - 0008
intro hfirst - 0009
intro hsecond - 0010
intro houtput - 0011
cases hfirst - 0012
cases hfirst_witness - 0013
cases hfirst_witness_witness - 0014
cases hsecond - 0015
cases hsecond_witness - 0016
cases hsecond_witness_witness - 0017
have hequal : ((((p) + (q))) + (((x1) + (x3)))) = ((((x) + (x2))) + (((n) + (m)))) - 0018
specialize integer_span_pair_add_congruence p - 0019
specialize integer_span_pair_add_congruence n - 0020
specialize integer_span_pair_add_congruence q - 0021
specialize integer_span_pair_add_congruence m - 0022
specialize integer_span_pair_add_congruence x - 0023
specialize integer_span_pair_add_congruence x1 - 0024
specialize integer_span_pair_add_congruence x2 - 0025
specialize integer_span_pair_add_congruence x3 - 0026
apply integer_span_pair_add_congruence - 0027
trans n + x - 0028
exact hfirst_witness_witness_right - 0029
apply add_comm - 0030
trans m + x2 - 0031
exact hsecond_witness_witness_right - 0032
apply add_comm - 0033
have hnormalized : exists ge_balance_positive_signed_bridge_normalized_add ge_balance_negative_signed_bridge_normalized_add. (((((cc) = 2 * (ge_balance_positive_signed_bridge_normalized_add) /\ (ge_balance_negative_signed_bridge_normalized_add) = 0) \/ exists ge_signed_half_signed_bridge_normalized_adddecode. (((cc) = 2 * ge_signed_half_signed_bridge_normalized_adddecode + 1 /\ (ge_balance_positive_signed_bridge_normalized_add) = 0) /\ (ge_balance_negative_signed_bridge_normalized_add) = S ge_signed_half_signed_bridge_normalized_adddecode))) /\ ((((x) + (x2))) + ge_balance_negative_signed_bridge_normalized_add = (((x1) + (x3))) + ge_balance_positive_signed_bridge_normalized_add)) - 0034
specialize gaussian_signed_balance_integer_transport cc - 0035
specialize gaussian_signed_balance_integer_transport ((p) + (q)) - 0036
specialize gaussian_signed_balance_integer_transport ((n) + (m)) - 0037
specialize gaussian_signed_balance_integer_transport ((x) + (x2)) - 0038
specialize gaussian_signed_balance_integer_transport ((x1) + (x3)) - 0039
apply gaussian_signed_balance_integer_transport - 0040
exact hequal - 0041
exact houtput - 0042
cases hnormalized - 0043
cases hnormalized_witness - 0044
cases hnormalized_witness_witness - 0045
specialize signed_add_of_decoded_equation ac - 0046
specialize signed_add_of_decoded_equation bc - 0047
specialize signed_add_of_decoded_equation cc - 0048
specialize signed_add_of_decoded_equation x - 0049
specialize signed_add_of_decoded_equation x1 - 0050
specialize signed_add_of_decoded_equation x2 - 0051
specialize signed_add_of_decoded_equation x3 - 0052
specialize signed_add_of_decoded_equation x4 - 0053
specialize signed_add_of_decoded_equation x5 - 0054
apply signed_add_of_decoded_equation - 0055
exact hfirst_witness_witness_left - 0056
exact hsecond_witness_witness_left - 0057
exact hnormalized_witness_witness_left - 0058
exact hnormalized_witness_witness_right