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 u a b z. (((u) = 2 \/ (u) = 1)) -> (exists sto_ap_multiply_cancel_first sto_an_multiply_cancel_first sto_bp_multiply_cancel_first sto_bn_multiply_cancel_first sto_cp_multiply_cancel_first sto_cn_multiply_cancel_first. (((((a) = 2 * (sto_ap_multiply_cancel_first) /\ (sto_an_multiply_cancel_first) = 0) \/ exists ge_signed_half_multiply_cancel_firstleft. (((a) = 2 * ge_signed_half_multiply_cancel_firstleft + 1 /\ (sto_ap_multiply_cancel_first) = 0) /\ (sto_an_multiply_cancel_first) = S ge_signed_half_multiply_cancel_firstleft))) /\ ((((((u) = 2 * (sto_bp_multiply_cancel_first) /\ (sto_bn_multiply_cancel_first) = 0) \/ exists ge_signed_half_multiply_cancel_firstright. (((u) = 2 * ge_signed_half_multiply_cancel_firstright + 1 /\ (sto_bp_multiply_cancel_first) = 0) /\ (sto_bn_multiply_cancel_first) = S ge_signed_half_multiply_cancel_firstright))) /\ ((((((z) = 2 * (sto_cp_multiply_cancel_first) /\ (sto_cn_multiply_cancel_first) = 0) \/ exists ge_signed_half_multiply_cancel_firstoutput. (((z) = 2 * ge_signed_half_multiply_cancel_firstoutput + 1 /\ (sto_cp_multiply_cancel_first) = 0) /\ (sto_cn_multiply_cancel_first) = S ge_signed_half_multiply_cancel_firstoutput))) /\ ((sto_ap_multiply_cancel_first * sto_bp_multiply_cancel_first + sto_an_multiply_cancel_first * sto_bn_multiply_cancel_first) + sto_cn_multiply_cancel_first = (sto_ap_multiply_cancel_first * sto_bn_multiply_cancel_first + sto_an_multiply_cancel_first * sto_bp_multiply_cancel_first) + sto_cp_multiply_cancel_first))))))) -> (exists sto_ap_multiply_cancel_second sto_an_multiply_cancel_second sto_bp_multiply_cancel_second sto_bn_multiply_cancel_second sto_cp_multiply_cancel_second sto_cn_multiply_cancel_second. (((((b) = 2 * (sto_ap_multiply_cancel_second) /\ (sto_an_multiply_cancel_second) = 0) \/ exists ge_signed_half_multiply_cancel_secondleft. (((b) = 2 * ge_signed_half_multiply_cancel_secondleft + 1 /\ (sto_ap_multiply_cancel_second) = 0) /\ (sto_an_multiply_cancel_second) = S ge_signed_half_multiply_cancel_secondleft))) /\ ((((((u) = 2 * (sto_bp_multiply_cancel_second) /\ (sto_bn_multiply_cancel_second) = 0) \/ exists ge_signed_half_multiply_cancel_secondright. (((u) = 2 * ge_signed_half_multiply_cancel_secondright + 1 /\ (sto_bp_multiply_cancel_second) = 0) /\ (sto_bn_multiply_cancel_second) = S ge_signed_half_multiply_cancel_secondright))) /\ ((((((z) = 2 * (sto_cp_multiply_cancel_second) /\ (sto_cn_multiply_cancel_second) = 0) \/ exists ge_signed_half_multiply_cancel_secondoutput. (((z) = 2 * ge_signed_half_multiply_cancel_secondoutput + 1 /\ (sto_cp_multiply_cancel_second) = 0) /\ (sto_cn_multiply_cancel_second) = S ge_signed_half_multiply_cancel_secondoutput))) /\ ((sto_ap_multiply_cancel_second * sto_bp_multiply_cancel_second + sto_an_multiply_cancel_second * sto_bn_multiply_cancel_second) + sto_cn_multiply_cancel_second = (sto_ap_multiply_cancel_second * sto_bn_multiply_cancel_second + sto_an_multiply_cancel_second * sto_bp_multiply_cancel_second) + sto_cp_multiply_cancel_second))))))) -> a=bConstructive proof overview
Generated structural guide
An actual signed unit can be cancelled from a common right factor without cancelling arbitrary zero or nonunit factors.
The unchanged tactic script uses 2 declared prerequisites and contains 24 exact native proof lines.
Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
signed_mul_functional Alpha theorem; checked-use authorized ZU0006 dirichlet_signed_unit_multiply_involutionDirect 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–7
02Use earlier factsL8–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L8
specialize signed_mul_functional (z) - L9
specialize signed_mul_functional (u) - L10
specialize signed_mul_functional (a) - L11
specialize signed_mul_functional (b) - L12
apply signed_mul_functional - L13
specialize dirichlet_signed_unit_multiply_involution (u) - L14
specialize dirichlet_signed_unit_multiply_involution (a) - L15
specialize dirichlet_signed_unit_multiply_involution (z) - L16
apply dirichlet_signed_unit_multiply_involution - L17
exact hu
03Use earlier factsL18–24
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 24 lines
- 0001
intro u - 0002
intro a - 0003
intro b - 0004
intro z - 0005
intro hu - 0006
intro ha - 0007
intro hb - 0008
specialize signed_mul_functional (z) - 0009
specialize signed_mul_functional (u) - 0010
specialize signed_mul_functional (a) - 0011
specialize signed_mul_functional (b) - 0012
apply signed_mul_functional - 0013
specialize dirichlet_signed_unit_multiply_involution (u) - 0014
specialize dirichlet_signed_unit_multiply_involution (a) - 0015
specialize dirichlet_signed_unit_multiply_involution (z) - 0016
apply dirichlet_signed_unit_multiply_involution - 0017
exact hu - 0018
exact ha - 0019
specialize dirichlet_signed_unit_multiply_involution (u) - 0020
specialize dirichlet_signed_unit_multiply_involution (b) - 0021
specialize dirichlet_signed_unit_multiply_involution (z) - 0022
apply dirichlet_signed_unit_multiply_involution - 0023
exact hu - 0024
exact hb