Exact expanded first-order arithmetic statement
forall p a b. (~((p) = 1) /\ forall pfa_factor_left_inverse_symmetric_domain pfa_factor_right_inverse_symmetric_domain. (p) = pfa_factor_left_inverse_symmetric_domain * pfa_factor_right_inverse_symmetric_domain -> pfa_factor_left_inverse_symmetric_domain = 1 \/ pfa_factor_right_inverse_symmetric_domain = 1) -> (((~((a) = 0)) /\ ((((exists pfa_gap_inverse_symmetric_sourcemultiplicationleft. pfa_gap_inverse_symmetric_sourcemultiplicationleft + S (a) = (p)) /\ (((exists pfa_gap_inverse_symmetric_sourcemultiplicationright. pfa_gap_inverse_symmetric_sourcemultiplicationright + S (b) = (p)) /\ ((((exists pfa_gap_inverse_symmetric_sourcemultiplicationresultbound. pfa_gap_inverse_symmetric_sourcemultiplicationresultbound + S (1) = (p)) /\ ((exists pfa_offset_left_inverse_symmetric_sourcemultiplicationresultcongruence pfa_offset_right_inverse_symmetric_sourcemultiplicationresultcongruence. ((a) * (b)) + (p) * pfa_offset_left_inverse_symmetric_sourcemultiplicationresultcongruence = (1) + (p) * pfa_offset_right_inverse_symmetric_sourcemultiplicationresultcongruence)))))))))))) -> (((~((b) = 0)) /\ ((((exists pfa_gap_inverse_symmetric_targetmultiplicationleft. pfa_gap_inverse_symmetric_targetmultiplicationleft + S (b) = (p)) /\ (((exists pfa_gap_inverse_symmetric_targetmultiplicationright. pfa_gap_inverse_symmetric_targetmultiplicationright + S (a) = (p)) /\ ((((exists pfa_gap_inverse_symmetric_targetmultiplicationresultbound. pfa_gap_inverse_symmetric_targetmultiplicationresultbound + S (1) = (p)) /\ ((exists pfa_offset_left_inverse_symmetric_targetmultiplicationresultcongruence pfa_offset_right_inverse_symmetric_targetmultiplicationresultcongruence. ((b) * (a)) + (p) * pfa_offset_left_inverse_symmetric_targetmultiplicationresultcongruence = (1) + (p) * pfa_offset_right_inverse_symmetric_targetmultiplicationresultcongruence))))))))))))Constructive proof overview
Generated structural guide
Inversion is symmetric on the nonzero elements, with both domains proved.
The unchanged tactic script uses 2 declared prerequisites and contains 21 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
Direct 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.
Named ingredients (2)
01Fix variables and assumptionsL1–5
02Separate the logical casesL6–6
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L6
split
03Fix variables and assumptionsL7–7
Work with arbitrary variables or the premises of the current implication.
- L7
intro hz
04Use earlier factsL8–14
Instantiate or apply named facts and discharge the corresponding proof obligations.
05Separate the logical casesL15–15
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L15
cases hi
06Use earlier factsL16–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 21 lines
- 0001
intro p - 0002
intro a - 0003
intro b - 0004
intro hp - 0005
intro hi - 0006
split - 0007
intro hz - 0008
specialize prime_field_inverse_output_nonzero (p) - 0009
specialize prime_field_inverse_output_nonzero (a) - 0010
specialize prime_field_inverse_output_nonzero (b) - 0011
apply prime_field_inverse_output_nonzero - 0012
exact hp - 0013
exact hi - 0014
exact hz - 0015
cases hi - 0016
specialize prime_field_multiply_commutative (p) - 0017
specialize prime_field_multiply_commutative (a) - 0018
specialize prime_field_multiply_commutative (b) - 0019
specialize prime_field_multiply_commutative (1) - 0020
apply prime_field_multiply_commutative - 0021
exact hi_right