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 e f g h. (((((a) + (f)) = ((e) + (b))) /\ (((c) + (h)) = ((g) + (d))))) -> (exists ge_representation_real_code_representation_transport_source ge_representation_imaginary_code_representation_transport_source. (((z) = ((ge_representation_real_code_representation_transport_source) + (ge_representation_imaginary_code_representation_transport_source)) * S ((ge_representation_real_code_representation_transport_source) + (ge_representation_imaginary_code_representation_transport_source)) + ((ge_representation_imaginary_code_representation_transport_source) + (ge_representation_imaginary_code_representation_transport_source))) /\ ((exists ge_balance_positive_representation_transport_sourcereal ge_balance_negative_representation_transport_sourcereal. (((((ge_representation_real_code_representation_transport_source) = 2 * (ge_balance_positive_representation_transport_sourcereal) /\ (ge_balance_negative_representation_transport_sourcereal) = 0) \/ exists ge_signed_half_representation_transport_sourcerealdecode. (((ge_representation_real_code_representation_transport_source) = 2 * ge_signed_half_representation_transport_sourcerealdecode + 1 /\ (ge_balance_positive_representation_transport_sourcereal) = 0) /\ (ge_balance_negative_representation_transport_sourcereal) = S ge_signed_half_representation_transport_sourcerealdecode))) /\ ((a) + ge_balance_negative_representation_transport_sourcereal = (b) + ge_balance_positive_representation_transport_sourcereal))) /\ (exists ge_balance_positive_representation_transport_sourceimaginary ge_balance_negative_representation_transport_sourceimaginary. (((((ge_representation_imaginary_code_representation_transport_source) = 2 * (ge_balance_positive_representation_transport_sourceimaginary) /\ (ge_balance_negative_representation_transport_sourceimaginary) = 0) \/ exists ge_signed_half_representation_transport_sourceimaginarydecode. (((ge_representation_imaginary_code_representation_transport_source) = 2 * ge_signed_half_representation_transport_sourceimaginarydecode + 1 /\ (ge_balance_positive_representation_transport_sourceimaginary) = 0) /\ (ge_balance_negative_representation_transport_sourceimaginary) = S ge_signed_half_representation_transport_sourceimaginarydecode))) /\ ((c) + ge_balance_negative_representation_transport_sourceimaginary = (d) + ge_balance_positive_representation_transport_sourceimaginary)))))) -> (exists ge_representation_real_code_representation_transport_target ge_representation_imaginary_code_representation_transport_target. (((z) = ((ge_representation_real_code_representation_transport_target) + (ge_representation_imaginary_code_representation_transport_target)) * S ((ge_representation_real_code_representation_transport_target) + (ge_representation_imaginary_code_representation_transport_target)) + ((ge_representation_imaginary_code_representation_transport_target) + (ge_representation_imaginary_code_representation_transport_target))) /\ ((exists ge_balance_positive_representation_transport_targetreal ge_balance_negative_representation_transport_targetreal. (((((ge_representation_real_code_representation_transport_target) = 2 * (ge_balance_positive_representation_transport_targetreal) /\ (ge_balance_negative_representation_transport_targetreal) = 0) \/ exists ge_signed_half_representation_transport_targetrealdecode. (((ge_representation_real_code_representation_transport_target) = 2 * ge_signed_half_representation_transport_targetrealdecode + 1 /\ (ge_balance_positive_representation_transport_targetreal) = 0) /\ (ge_balance_negative_representation_transport_targetreal) = S ge_signed_half_representation_transport_targetrealdecode))) /\ ((e) + ge_balance_negative_representation_transport_targetreal = (f) + ge_balance_positive_representation_transport_targetreal))) /\ (exists ge_balance_positive_representation_transport_targetimaginary ge_balance_negative_representation_transport_targetimaginary. (((((ge_representation_imaginary_code_representation_transport_target) = 2 * (ge_balance_positive_representation_transport_targetimaginary) /\ (ge_balance_negative_representation_transport_targetimaginary) = 0) \/ exists ge_signed_half_representation_transport_targetimaginarydecode. (((ge_representation_imaginary_code_representation_transport_target) = 2 * ge_signed_half_representation_transport_targetimaginarydecode + 1 /\ (ge_balance_positive_representation_transport_targetimaginary) = 0) /\ (ge_balance_negative_representation_transport_targetimaginary) = S ge_signed_half_representation_transport_targetimaginarydecode))) /\ ((g) + ge_balance_negative_representation_transport_targetimaginary = (h) + ge_balance_positive_representation_transport_targetimaginary))))))Constructive proof overview
Generated structural guide
A canonical Gaussian coordinate code is invariant under arbitrary equal signed representatives.
The unchanged tactic script uses 1 declared prerequisite and contains 37 exact native proof lines.
Alpha v34 checked-use · first admitted v28 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
Direct 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
02Fix variables and assumptionsL11–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro hrepresentation
03Separate the logical casesL12–16
04Construct an explicit witnessL17–18
05Separate the logical casesL19–19
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L19
split
06Use earlier factsL20–20
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L20
exact hrepresentation_witness_witness_left
07Separate the logical casesL21–21
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L21
split
08Use earlier factsL22–31
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
specialize gaussian_signed_balance_integer_transport x - L23
specialize gaussian_signed_balance_integer_transport a - L24
specialize gaussian_signed_balance_integer_transport b - L25
specialize gaussian_signed_balance_integer_transport e - L26
specialize gaussian_signed_balance_integer_transport f - L27
apply gaussian_signed_balance_integer_transport - L28
exact hequal_left - L29
exact hrepresentation_witness_witness_right_left - L30
specialize gaussian_signed_balance_integer_transport x1 - L31
specialize gaussian_signed_balance_integer_transport c
09Use earlier factsL32–37
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 37 lines
- 0001
intro z - 0002
intro a - 0003
intro b - 0004
intro c - 0005
intro d - 0006
intro e - 0007
intro f - 0008
intro g - 0009
intro h - 0010
intro hequal - 0011
intro hrepresentation - 0012
cases hequal - 0013
cases hrepresentation - 0014
cases hrepresentation_witness - 0015
cases hrepresentation_witness_witness - 0016
cases hrepresentation_witness_witness_right - 0017
exists x - 0018
exists x1 - 0019
split - 0020
exact hrepresentation_witness_witness_left - 0021
split - 0022
specialize gaussian_signed_balance_integer_transport x - 0023
specialize gaussian_signed_balance_integer_transport a - 0024
specialize gaussian_signed_balance_integer_transport b - 0025
specialize gaussian_signed_balance_integer_transport e - 0026
specialize gaussian_signed_balance_integer_transport f - 0027
apply gaussian_signed_balance_integer_transport - 0028
exact hequal_left - 0029
exact hrepresentation_witness_witness_right_left - 0030
specialize gaussian_signed_balance_integer_transport x1 - 0031
specialize gaussian_signed_balance_integer_transport c - 0032
specialize gaussian_signed_balance_integer_transport d - 0033
specialize gaussian_signed_balance_integer_transport g - 0034
specialize gaussian_signed_balance_integer_transport h - 0035
apply gaussian_signed_balance_integer_transport - 0036
exact hequal_right - 0037
exact hrepresentation_witness_witness_right_right