Exact expanded first-order arithmetic statement
forall p a b v. (exists pfa_gap_addlookup_column. pfa_gap_addlookup_column + S (b) = (p)) -> (exists pft_row_addlookup_grid pft_column_addlookup_grid. (((a*p+b) = pft_row_addlookup_grid * (p) + pft_column_addlookup_grid) /\ ((((exists pfa_gap_addlookup_gridoperationleft. pfa_gap_addlookup_gridoperationleft + S (pft_row_addlookup_grid) = (p)) /\ (((exists pfa_gap_addlookup_gridoperationright. pfa_gap_addlookup_gridoperationright + S (pft_column_addlookup_grid) = (p)) /\ ((((exists pfa_gap_addlookup_gridoperationresultbound. pfa_gap_addlookup_gridoperationresultbound + S (v) = (p)) /\ ((exists pfa_offset_left_addlookup_gridoperationresultcongruence pfa_offset_right_addlookup_gridoperationresultcongruence. ((pft_row_addlookup_grid) + (pft_column_addlookup_grid)) + (p) * pfa_offset_left_addlookup_gridoperationresultcongruence = (v) + (p) * pfa_offset_right_addlookup_gridoperationresultcongruence)))))))))))) -> (((exists pfa_gap_addlookup_resultleft. pfa_gap_addlookup_resultleft + S (a) = (p)) /\ (((exists pfa_gap_addlookup_resultright. pfa_gap_addlookup_resultright + S (b) = (p)) /\ ((((exists pfa_gap_addlookup_resultresultbound. pfa_gap_addlookup_resultresultbound + S (v) = (p)) /\ ((exists pfa_offset_left_addlookup_resultresultcongruence pfa_offset_right_addlookup_resultresultcongruence. ((a) + (b)) + (p) * pfa_offset_left_addlookup_resultresultcongruence = (v) + (p) * pfa_offset_right_addlookup_resultresultcongruence)))))))))Constructive proof overview
Generated structural guide
Actual quotient/remainder uniqueness identifies both row-major coordinates of a add table entry.
The unchanged tactic script uses 2 declared prerequisites and contains 36 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
division_remainder_unique Alpha theorem; checked-use authorized mul_comm 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–6
02Separate the logical casesL7–12
03Establish heqL13–22
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply division remainder unique.
- L13
have heq : x = a /\ x1 = b - L14
specialize division_remainder_unique (p) - L15
specialize division_remainder_unique (a * p + b) - L16
specialize division_remainder_unique (x) - L17
specialize division_remainder_unique (x1) - L18
specialize division_remainder_unique (a) - L19
specialize division_remainder_unique (b) - L20
apply division_remainder_unique - L21
specialize mul_comm x - L22
specialize mul_comm p
04Calculate and transport equalitiesL23–23
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L23
rewrite mul_comm at hg_witness_witness_left
05Use earlier factsL24–27
06Calculate and transport equalitiesL28–29
07Use earlier factsL30–30
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L30
exact hb
08Separate the logical casesL31–31
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L31
cases heq
09Calculate and transport equalitiesL32–35
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
10Use earlier factsL36–36
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L36
exact hg_witness_witness_right
Original exact command ledger · 36 lines
- 0001
intro p - 0002
intro a - 0003
intro b - 0004
intro v - 0005
intro hb - 0006
intro hg - 0007
cases hg - 0008
cases hg_witness - 0009
cases hg_witness_witness - 0010
cases hg_witness_witness_right - 0011
cases hg_witness_witness_right_right - 0012
cases hg_witness_witness_right_right_right - 0013
have heq : x = a /\ x1 = b - 0014
specialize division_remainder_unique (p) - 0015
specialize division_remainder_unique (a * p + b) - 0016
specialize division_remainder_unique (x) - 0017
specialize division_remainder_unique (x1) - 0018
specialize division_remainder_unique (a) - 0019
specialize division_remainder_unique (b) - 0020
apply division_remainder_unique - 0021
specialize mul_comm x - 0022
specialize mul_comm p - 0023
rewrite mul_comm at hg_witness_witness_left - 0024
exact hg_witness_witness_left - 0025
exact hg_witness_witness_right_right_left - 0026
specialize mul_comm a - 0027
specialize mul_comm p - 0028
rewrite mul_comm - 0029
refl - 0030
exact hb - 0031
cases heq - 0032
rewrite heq_left at hg_witness_witness_right - 0033
rewrite heq_left at hg_witness_witness_right - 0034
rewrite heq_right at hg_witness_witness_right - 0035
rewrite heq_right at hg_witness_witness_right - 0036
exact hg_witness_witness_right