Exact expanded first-order arithmetic statement
forall p a b c. (((exists pfa_gap_addcomm_sourceleft. pfa_gap_addcomm_sourceleft + S (a) = (p)) /\ (((exists pfa_gap_addcomm_sourceright. pfa_gap_addcomm_sourceright + S (b) = (p)) /\ ((((exists pfa_gap_addcomm_sourceresultbound. pfa_gap_addcomm_sourceresultbound + S (c) = (p)) /\ ((exists pfa_offset_left_addcomm_sourceresultcongruence pfa_offset_right_addcomm_sourceresultcongruence. ((a) + (b)) + (p) * pfa_offset_left_addcomm_sourceresultcongruence = (c) + (p) * pfa_offset_right_addcomm_sourceresultcongruence))))))))) -> (((exists pfa_gap_addcomm_targetleft. pfa_gap_addcomm_targetleft + S (b) = (p)) /\ (((exists pfa_gap_addcomm_targetright. pfa_gap_addcomm_targetright + S (a) = (p)) /\ ((((exists pfa_gap_addcomm_targetresultbound. pfa_gap_addcomm_targetresultbound + S (c) = (p)) /\ ((exists pfa_offset_left_addcomm_targetresultcongruence pfa_offset_right_addcomm_targetresultcongruence. ((b) + (a)) + (p) * pfa_offset_left_addcomm_targetresultcongruence = (c) + (p) * pfa_offset_right_addcomm_targetresultcongruence)))))))))Constructive proof overview
Generated structural guide
Commutativity of actual canonical add, not an assumed table axiom.
The unchanged tactic script uses 2 declared prerequisites and contains 20 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 (1)
01Fix variables and assumptionsL1–5
02Separate the logical casesL6–8
03Use earlier factsL9–9
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L9
exact h_right_left
04Separate the logical casesL10–10
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L10
split
05Use earlier factsL11–20
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L11
exact h_left - L12
specialize prime_field_residue_input_equal (p) - L13
specialize prime_field_residue_input_equal (b + a) - L14
specialize prime_field_residue_input_equal (a + b) - L15
specialize prime_field_residue_input_equal (c) - L16
apply prime_field_residue_input_equal - L17
specialize add_comm (b) - L18
specialize add_comm (a) - L19
apply add_comm - L20
exact h_right_right
Original exact command ledger · 20 lines
- 0001
intro p - 0002
intro a - 0003
intro b - 0004
intro c - 0005
intro h - 0006
cases h - 0007
cases h_right - 0008
split - 0009
exact h_right_left - 0010
split - 0011
exact h_left - 0012
specialize prime_field_residue_input_equal (p) - 0013
specialize prime_field_residue_input_equal (b + a) - 0014
specialize prime_field_residue_input_equal (a + b) - 0015
specialize prime_field_residue_input_equal (c) - 0016
apply prime_field_residue_input_equal - 0017
specialize add_comm (b) - 0018
specialize add_comm (a) - 0019
apply add_comm - 0020
exact h_right_right