Exact expanded first-order arithmetic statement
forall p B C a b v. (forall pft_index_multiplyreflect_table. (exists pfa_gap_multiplyreflect_tableprefix. pfa_gap_multiplyreflect_tableprefix + S (pft_index_multiplyreflect_table) = ((p) * (p))) -> exists pft_value_multiplyreflect_table. (((((exists ff_h_pft_multiplyreflect_tablepointentry. ff_h_pft_multiplyreflect_tablepointentry + S (pft_value_multiplyreflect_table) = S ((S (pft_index_multiplyreflect_table)) * C)) /\ exists ff_q_pft_multiplyreflect_tablepointentry. B = ff_q_pft_multiplyreflect_tablepointentry * S ((S (pft_index_multiplyreflect_table)) * C) + (pft_value_multiplyreflect_table))) /\ ((exists pft_row_multiplyreflect_tablepointvalue pft_column_multiplyreflect_tablepointvalue. (((pft_index_multiplyreflect_table) = pft_row_multiplyreflect_tablepointvalue * (p) + pft_column_multiplyreflect_tablepointvalue) /\ ((((exists pfa_gap_multiplyreflect_tablepointvalueoperationleft. pfa_gap_multiplyreflect_tablepointvalueoperationleft + S (pft_row_multiplyreflect_tablepointvalue) = (p)) /\ (((exists pfa_gap_multiplyreflect_tablepointvalueoperationright. pfa_gap_multiplyreflect_tablepointvalueoperationright + S (pft_column_multiplyreflect_tablepointvalue) = (p)) /\ ((((exists pfa_gap_multiplyreflect_tablepointvalueoperationresultbound. pfa_gap_multiplyreflect_tablepointvalueoperationresultbound + S (pft_value_multiplyreflect_table) = (p)) /\ ((exists pfa_offset_left_multiplyreflect_tablepointvalueoperationresultcongruence pfa_offset_right_multiplyreflect_tablepointvalueoperationresultcongruence. ((pft_row_multiplyreflect_tablepointvalue) * (pft_column_multiplyreflect_tablepointvalue)) + (p) * pfa_offset_left_multiplyreflect_tablepointvalueoperationresultcongruence = (pft_value_multiplyreflect_table) + (p) * pfa_offset_right_multiplyreflect_tablepointvalueoperationresultcongruence)))))))))))))))) -> (((exists pfa_gap_multiplyreflect_graphleft. pfa_gap_multiplyreflect_graphleft + S (a) = (p)) /\ (((exists pfa_gap_multiplyreflect_graphright. pfa_gap_multiplyreflect_graphright + S (b) = (p)) /\ ((((exists pfa_gap_multiplyreflect_graphresultbound. pfa_gap_multiplyreflect_graphresultbound + S (v) = (p)) /\ ((exists pfa_offset_left_multiplyreflect_graphresultcongruence pfa_offset_right_multiplyreflect_graphresultcongruence. ((a) * (b)) + (p) * pfa_offset_left_multiplyreflect_graphresultcongruence = (v) + (p) * pfa_offset_right_multiplyreflect_graphresultcongruence))))))))) -> (((exists ff_h_pft_multiplyreflect_at. ff_h_pft_multiplyreflect_at + S (v) = S ((S (a*p+b)) * C)) /\ exists ff_q_pft_multiplyreflect_at. B = ff_q_pft_multiplyreflect_at * S ((S (a*p+b)) * C) + (v)))Constructive proof overview
Generated structural guide
Every genuine canonical multiply result occurs at its actual finite table index.
The unchanged tactic script uses 3 declared prerequisites and contains 40 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
beta_at_exists Alpha theorem; checked-use authorized FP003C prime_field_multiply_table_lookup FP000D prime_field_multiply_functionalDirect 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–8
02Separate the logical casesL9–10
03Establish hatL11–15
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at exists.
- L11
have hat : exists w. (((exists ff_h_pft_multiplyreflect_exists. ff_h_pft_multiplyreflect_exists + S (w) = S ((S (a*p+b)) * C)) /\ exists ff_q_pft_multiplyreflect_exists. B = ff_q_pft_multiplyreflect_exists * S ((S (a*p+b)) * C) + (w))) - L12
specialize beta_at_exists (B) - L13
specialize beta_at_exists (C) - L14
specialize beta_at_exists (a*p+b) - L15
apply beta_at_exists
04Separate the logical casesL16–16
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L16
cases hat
05Establish houtL17–26
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field multiply table lookup.
- L17
have hout : ((exists pfa_gap_multiplyreflect_lookupleft. pfa_gap_multiplyreflect_lookupleft + S (a) = (p)) /\ (((exists pfa_gap_multiplyreflect_lookupright. pfa_gap_multiplyreflect_lookupright + S (b) = (p)) /\ ((((exists pfa_gap_multiplyreflect_lookupresultbound. pfa_gap_multiplyreflect_lookupresultbound + S (x) = (p)) /\ ((exists pfa_offset_left_multiplyreflect_lookupresultcongruence pfa_offset_right_multiplyreflect_lookupresultcongruence. ((a) * (b)) + (p) * pfa_offset_left_multiplyreflect_lookupresultcongruence = (x) + (p) * pfa_offset_right_multiplyreflect_lookupresultcongruence)))))))) - L18
specialize prime_field_multiply_table_lookup (p) - L19
specialize prime_field_multiply_table_lookup (B) - L20
specialize prime_field_multiply_table_lookup (C) - L21
specialize prime_field_multiply_table_lookup (a) - L22
specialize prime_field_multiply_table_lookup (b) - L23
specialize prime_field_multiply_table_lookup (x) - L24
apply prime_field_multiply_table_lookup - L25
exact htable - L26
exact hop_left
06Use earlier factsL27–28
07Establish heqL29–38
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field multiply functional.
- L29
have heq : x = v - L30
specialize prime_field_multiply_functional (p) - L31
specialize prime_field_multiply_functional (a) - L32
specialize prime_field_multiply_functional (b) - L33
specialize prime_field_multiply_functional (x) - L34
specialize prime_field_multiply_functional (v) - L35
apply prime_field_multiply_functional - L36
exact hout - L37
exact hop - L38
rewrite heq at hat_witness
08Calculate and transport equalitiesL39–39
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L39
rewrite heq at hat_witness
09Use earlier factsL40–40
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L40
exact hat_witness
Original exact command ledger · 40 lines
- 0001
intro p - 0002
intro B - 0003
intro C - 0004
intro a - 0005
intro b - 0006
intro v - 0007
intro htable - 0008
intro hop - 0009
cases hop - 0010
cases hop_right - 0011
have hat : exists w. (((exists ff_h_pft_multiplyreflect_exists. ff_h_pft_multiplyreflect_exists + S (w) = S ((S (a*p+b)) * C)) /\ exists ff_q_pft_multiplyreflect_exists. B = ff_q_pft_multiplyreflect_exists * S ((S (a*p+b)) * C) + (w))) - 0012
specialize beta_at_exists (B) - 0013
specialize beta_at_exists (C) - 0014
specialize beta_at_exists (a*p+b) - 0015
apply beta_at_exists - 0016
cases hat - 0017
have hout : ((exists pfa_gap_multiplyreflect_lookupleft. pfa_gap_multiplyreflect_lookupleft + S (a) = (p)) /\ (((exists pfa_gap_multiplyreflect_lookupright. pfa_gap_multiplyreflect_lookupright + S (b) = (p)) /\ ((((exists pfa_gap_multiplyreflect_lookupresultbound. pfa_gap_multiplyreflect_lookupresultbound + S (x) = (p)) /\ ((exists pfa_offset_left_multiplyreflect_lookupresultcongruence pfa_offset_right_multiplyreflect_lookupresultcongruence. ((a) * (b)) + (p) * pfa_offset_left_multiplyreflect_lookupresultcongruence = (x) + (p) * pfa_offset_right_multiplyreflect_lookupresultcongruence)))))))) - 0018
specialize prime_field_multiply_table_lookup (p) - 0019
specialize prime_field_multiply_table_lookup (B) - 0020
specialize prime_field_multiply_table_lookup (C) - 0021
specialize prime_field_multiply_table_lookup (a) - 0022
specialize prime_field_multiply_table_lookup (b) - 0023
specialize prime_field_multiply_table_lookup (x) - 0024
apply prime_field_multiply_table_lookup - 0025
exact htable - 0026
exact hop_left - 0027
exact hop_right_left - 0028
exact hat_witness - 0029
have heq : x = v - 0030
specialize prime_field_multiply_functional (p) - 0031
specialize prime_field_multiply_functional (a) - 0032
specialize prime_field_multiply_functional (b) - 0033
specialize prime_field_multiply_functional (x) - 0034
specialize prime_field_multiply_functional (v) - 0035
apply prime_field_multiply_functional - 0036
exact hout - 0037
exact hop - 0038
rewrite heq at hat_witness - 0039
rewrite heq at hat_witness - 0040
exact hat_witness