Exact expanded first-order arithmetic statement
forall a m. (exists eut_gap_eu_unit_domain. eut_gap_eu_unit_domain + S (1) = (m)) -> (forall eut_divisor_eu_unit_coprime_given. (exists eut_left_eu_unit_coprime_given. (a) = eut_divisor_eu_unit_coprime_given * eut_left_eu_unit_coprime_given) -> (exists eut_right_eu_unit_coprime_given. (m) = eut_divisor_eu_unit_coprime_given * eut_right_eu_unit_coprime_given) -> eut_divisor_eu_unit_coprime_given = 1) -> ((exists eut_gap_eu_unit_built_domain. eut_gap_eu_unit_built_domain + S (1) = (m)) /\ exists eu_inverse_unit_built. (exists eut_gap_eu_unit_built_bound. eut_gap_eu_unit_built_bound + S (eu_inverse_unit_built) = (m)) /\ (exists eu_mod_left_unit_built_inverse eu_mod_right_unit_built_inverse. ((a)*eu_inverse_unit_built) + (m) * eu_mod_left_unit_built_inverse = (1) + (m) * eu_mod_right_unit_built_inverse))Constructive proof overview
Generated structural guide
Above modulus one, coprimality constructs the blueprint's actual bounded inverse without assuming it.
The unchanged tactic script uses 2 declared prerequisites and contains 15 exact native proof lines.
Public research checkpoint: original HA and independently compiled Lean verified; not Alpha-enrolled, no Alpha checked-use authority; not Stable
Proof neighborhood
Direct dependencies
binary_modulus_nontrivial_nonzero Alpha theorem; checked-use authorized coprime_bounded_mod_inverse Alpha 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. The literal dependency-closed bundle is checked by original HA and the independently compiled Lean verifier. Public delivery grants no Alpha checked-use authority or 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–4
02Separate the logical casesL5–5
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L5
split
03Use earlier factsL6–9
04Fix variables and assumptionsL10–10
Work with arbitrary variables or the premises of the current implication.
- L10
intro hz
Original exact command ledger · 15 lines
- 0001
intro a - 0002
intro m - 0003
intro hm - 0004
intro hc - 0005
split - 0006
exact hm - 0007
specialize coprime_bounded_mod_inverse (a) - 0008
specialize coprime_bounded_mod_inverse (m) - 0009
apply coprime_bounded_mod_inverse - 0010
intro hz - 0011
specialize binary_modulus_nontrivial_nonzero (m) - 0012
apply binary_modulus_nontrivial_nonzero - 0013
exact hm - 0014
exact hz - 0015
exact hc