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 z a b c d. (exists ge_representation_real_code_normalization_source ge_representation_imaginary_code_normalization_source. (((z) = ((ge_representation_real_code_normalization_source) + (ge_representation_imaginary_code_normalization_source)) * S ((ge_representation_real_code_normalization_source) + (ge_representation_imaginary_code_normalization_source)) + ((ge_representation_imaginary_code_normalization_source) + (ge_representation_imaginary_code_normalization_source))) /\ ((exists ge_balance_positive_normalization_sourcereal ge_balance_negative_normalization_sourcereal. (((((ge_representation_real_code_normalization_source) = 2 * (ge_balance_positive_normalization_sourcereal) /\ (ge_balance_negative_normalization_sourcereal) = 0) \/ exists ge_signed_half_normalization_sourcerealdecode. (((ge_representation_real_code_normalization_source) = 2 * ge_signed_half_normalization_sourcerealdecode + 1 /\ (ge_balance_positive_normalization_sourcereal) = 0) /\ (ge_balance_negative_normalization_sourcereal) = S ge_signed_half_normalization_sourcerealdecode))) /\ ((a) + ge_balance_negative_normalization_sourcereal = (b) + ge_balance_positive_normalization_sourcereal))) /\ (exists ge_balance_positive_normalization_sourceimaginary ge_balance_negative_normalization_sourceimaginary. (((((ge_representation_imaginary_code_normalization_source) = 2 * (ge_balance_positive_normalization_sourceimaginary) /\ (ge_balance_negative_normalization_sourceimaginary) = 0) \/ exists ge_signed_half_normalization_sourceimaginarydecode. (((ge_representation_imaginary_code_normalization_source) = 2 * ge_signed_half_normalization_sourceimaginarydecode + 1 /\ (ge_balance_positive_normalization_sourceimaginary) = 0) /\ (ge_balance_negative_normalization_sourceimaginary) = S ge_signed_half_normalization_sourceimaginarydecode))) /\ ((c) + ge_balance_negative_normalization_sourceimaginary = (d) + ge_balance_positive_normalization_sourceimaginary)))))) -> exists e f g h. (((exists ge_real_code_normalization_decode ge_imaginary_code_normalization_decode. (((z) = ((ge_real_code_normalization_decode) + (ge_imaginary_code_normalization_decode)) * S ((ge_real_code_normalization_decode) + (ge_imaginary_code_normalization_decode)) + ((ge_imaginary_code_normalization_decode) + (ge_imaginary_code_normalization_decode))) /\ (((((ge_real_code_normalization_decode) = 2 * (e) /\ (f) = 0) \/ exists ge_signed_half_ge_normalization_decode_real. (((ge_real_code_normalization_decode) = 2 * ge_signed_half_ge_normalization_decode_real + 1 /\ (e) = 0) /\ (f) = S ge_signed_half_ge_normalization_decode_real))) /\ ((((ge_imaginary_code_normalization_decode) = 2 * (g) /\ (h) = 0) \/ exists ge_signed_half_ge_normalization_decode_imaginary. (((ge_imaginary_code_normalization_decode) = 2 * ge_signed_half_ge_normalization_decode_imaginary + 1 /\ (g) = 0) /\ (h) = S ge_signed_half_ge_normalization_decode_imaginary)))))) /\ (((((a) + (f)) = ((e) + (b))) /\ (((c) + (h)) = ((g) + (d)))))))Constructive proof overview
Generated structural guide
Every possibly overlapping signed representation yields actual unique normalized decoder coordinates of the same canonical code.
The unchanged tactic script uses 1 declared prerequisite and contains 35 exact native proof lines.
Alpha v34 checked-use · first admitted v28 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
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.
01Fix variables and assumptionsL1–6
02Separate the logical casesL7–16
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L7
cases hrepresentation - L8
cases hrepresentation_witness - L9
cases hrepresentation_witness_witness - L10
cases hrepresentation_witness_witness_right - L11
cases hrepresentation_witness_witness_right_left - L12
cases hrepresentation_witness_witness_right_left_witness - L13
cases hrepresentation_witness_witness_right_left_witness_witness - L14
cases hrepresentation_witness_witness_right_right - L15
cases hrepresentation_witness_witness_right_right_witness - L16
cases hrepresentation_witness_witness_right_right_witness_witness
03Construct an explicit witnessL17–20
04Separate the logical casesL21–21
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L21
split
05Construct an explicit witnessL22–23
06Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
split
07Use earlier factsL25–25
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L25
exact hrepresentation_witness_witness_left
08Separate the logical casesL26–26
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L26
split
09Use earlier factsL27–28
10Separate the logical casesL29–29
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L29
split
11Calculate and transport equalitiesL30–30
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L30
trans b + x2
12Use earlier factsL31–32
13Calculate and transport equalitiesL33–33
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L33
trans d + x4
Original exact command ledger · 35 lines
- 0001
intro z - 0002
intro a - 0003
intro b - 0004
intro c - 0005
intro d - 0006
intro hrepresentation - 0007
cases hrepresentation - 0008
cases hrepresentation_witness - 0009
cases hrepresentation_witness_witness - 0010
cases hrepresentation_witness_witness_right - 0011
cases hrepresentation_witness_witness_right_left - 0012
cases hrepresentation_witness_witness_right_left_witness - 0013
cases hrepresentation_witness_witness_right_left_witness_witness - 0014
cases hrepresentation_witness_witness_right_right - 0015
cases hrepresentation_witness_witness_right_right_witness - 0016
cases hrepresentation_witness_witness_right_right_witness_witness - 0017
exists x2 - 0018
exists x3 - 0019
exists x4 - 0020
exists x5 - 0021
split - 0022
exists x - 0023
exists x1 - 0024
split - 0025
exact hrepresentation_witness_witness_left - 0026
split - 0027
exact hrepresentation_witness_witness_right_left_witness_witness_left - 0028
exact hrepresentation_witness_witness_right_right_witness_witness_left - 0029
split - 0030
trans b + x2 - 0031
exact hrepresentation_witness_witness_right_left_witness_witness_right - 0032
apply add_comm - 0033
trans d + x4 - 0034
exact hrepresentation_witness_witness_right_right_witness_witness_right - 0035
apply add_comm