Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Exact expanded first-order arithmetic statement
forall p n r s. (~((p) = 1) /\ forall pfa_factor_left_multiple_unique_domain pfa_factor_right_multiple_unique_domain. (p) = pfa_factor_left_multiple_unique_domain * pfa_factor_right_multiple_unique_domain -> pfa_factor_left_multiple_unique_domain = 1 \/ pfa_factor_right_multiple_unique_domain = 1) -> (exists pff_history_code_multiple_unique_first pff_history_scale_multiple_unique_first. (((((exists ff_h_pft_multiple_unique_firsthistorystart. ff_h_pft_multiple_unique_firsthistorystart + S (0) = S ((S (0)) * pff_history_scale_multiple_unique_first)) /\ exists ff_q_pft_multiple_unique_firsthistorystart. pff_history_code_multiple_unique_first = ff_q_pft_multiple_unique_firsthistorystart * S ((S (0)) * pff_history_scale_multiple_unique_first) + (0))) /\ (((((exists ff_h_pft_multiple_unique_firsthistoryterminal. ff_h_pft_multiple_unique_firsthistoryterminal + S (r) = S ((S (n)) * pff_history_scale_multiple_unique_first)) /\ exists ff_q_pft_multiple_unique_firsthistoryterminal. pff_history_code_multiple_unique_first = ff_q_pft_multiple_unique_firsthistoryterminal * S ((S (n)) * pff_history_scale_multiple_unique_first) + (r))) /\ ((forall pff_trace_index_multiple_unique_firsthistorysteps. (exists pfa_gap_multiple_unique_firsthistorystepsindex. pfa_gap_multiple_unique_firsthistorystepsindex + S (pff_trace_index_multiple_unique_firsthistorysteps) = (n)) -> exists pff_trace_before_multiple_unique_firsthistorysteps pff_trace_after_multiple_unique_firsthistorysteps. ((((exists ff_h_pft_multiple_unique_firsthistorystepsbefore. ff_h_pft_multiple_unique_firsthistorystepsbefore + S (pff_trace_before_multiple_unique_firsthistorysteps) = S ((S (pff_trace_index_multiple_unique_firsthistorysteps)) * pff_history_scale_multiple_unique_first)) /\ exists ff_q_pft_multiple_unique_firsthistorystepsbefore. pff_history_code_multiple_unique_first = ff_q_pft_multiple_unique_firsthistorystepsbefore * S ((S (pff_trace_index_multiple_unique_firsthistorysteps)) * pff_history_scale_multiple_unique_first) + (pff_trace_before_multiple_unique_firsthistorysteps))) /\ (((((exists ff_h_pft_multiple_unique_firsthistorystepsafter. ff_h_pft_multiple_unique_firsthistorystepsafter + S (pff_trace_after_multiple_unique_firsthistorysteps) = S ((S (S (pff_trace_index_multiple_unique_firsthistorysteps))) * pff_history_scale_multiple_unique_first)) /\ exists ff_q_pft_multiple_unique_firsthistorystepsafter. pff_history_code_multiple_unique_first = ff_q_pft_multiple_unique_firsthistorystepsafter * S ((S (S (pff_trace_index_multiple_unique_firsthistorysteps))) * pff_history_scale_multiple_unique_first) + (pff_trace_after_multiple_unique_firsthistorysteps))) /\ ((((exists pfa_gap_multiple_unique_firsthistorystepsadditionleft. pfa_gap_multiple_unique_firsthistorystepsadditionleft + S (pff_trace_before_multiple_unique_firsthistorysteps) = (p)) /\ (((exists pfa_gap_multiple_unique_firsthistorystepsadditionright. pfa_gap_multiple_unique_firsthistorystepsadditionright + S (1) = (p)) /\ ((((exists pfa_gap_multiple_unique_firsthistorystepsadditionresultbound. pfa_gap_multiple_unique_firsthistorystepsadditionresultbound + S (pff_trace_after_multiple_unique_firsthistorysteps) = (p)) /\ ((exists pfa_offset_left_multiple_unique_firsthistorystepsadditionresultcongruence pfa_offset_right_multiple_unique_firsthistorystepsadditionresultcongruence. ((pff_trace_before_multiple_unique_firsthistorysteps) + (1)) + (p) * pfa_offset_left_multiple_unique_firsthistorystepsadditionresultcongruence = (pff_trace_after_multiple_unique_firsthistorysteps) + (p) * pfa_offset_right_multiple_unique_firsthistorystepsadditionresultcongruence)))))))))))))))))))) -> (exists pff_history_code_multiple_unique_second pff_history_scale_multiple_unique_second. (((((exists ff_h_pft_multiple_unique_secondhistorystart. ff_h_pft_multiple_unique_secondhistorystart + S (0) = S ((S (0)) * pff_history_scale_multiple_unique_second)) /\ exists ff_q_pft_multiple_unique_secondhistorystart. pff_history_code_multiple_unique_second = ff_q_pft_multiple_unique_secondhistorystart * S ((S (0)) * pff_history_scale_multiple_unique_second) + (0))) /\ (((((exists ff_h_pft_multiple_unique_secondhistoryterminal. ff_h_pft_multiple_unique_secondhistoryterminal + S (s) = S ((S (n)) * pff_history_scale_multiple_unique_second)) /\ exists ff_q_pft_multiple_unique_secondhistoryterminal. pff_history_code_multiple_unique_second = ff_q_pft_multiple_unique_secondhistoryterminal * S ((S (n)) * pff_history_scale_multiple_unique_second) + (s))) /\ ((forall pff_trace_index_multiple_unique_secondhistorysteps. (exists pfa_gap_multiple_unique_secondhistorystepsindex. pfa_gap_multiple_unique_secondhistorystepsindex + S (pff_trace_index_multiple_unique_secondhistorysteps) = (n)) -> exists pff_trace_before_multiple_unique_secondhistorysteps pff_trace_after_multiple_unique_secondhistorysteps. ((((exists ff_h_pft_multiple_unique_secondhistorystepsbefore. ff_h_pft_multiple_unique_secondhistorystepsbefore + S (pff_trace_before_multiple_unique_secondhistorysteps) = S ((S (pff_trace_index_multiple_unique_secondhistorysteps)) * pff_history_scale_multiple_unique_second)) /\ exists ff_q_pft_multiple_unique_secondhistorystepsbefore. pff_history_code_multiple_unique_second = ff_q_pft_multiple_unique_secondhistorystepsbefore * S ((S (pff_trace_index_multiple_unique_secondhistorysteps)) * pff_history_scale_multiple_unique_second) + (pff_trace_before_multiple_unique_secondhistorysteps))) /\ (((((exists ff_h_pft_multiple_unique_secondhistorystepsafter. ff_h_pft_multiple_unique_secondhistorystepsafter + S (pff_trace_after_multiple_unique_secondhistorysteps) = S ((S (S (pff_trace_index_multiple_unique_secondhistorysteps))) * pff_history_scale_multiple_unique_second)) /\ exists ff_q_pft_multiple_unique_secondhistorystepsafter. pff_history_code_multiple_unique_second = ff_q_pft_multiple_unique_secondhistorystepsafter * S ((S (S (pff_trace_index_multiple_unique_secondhistorysteps))) * pff_history_scale_multiple_unique_second) + (pff_trace_after_multiple_unique_secondhistorysteps))) /\ ((((exists pfa_gap_multiple_unique_secondhistorystepsadditionleft. pfa_gap_multiple_unique_secondhistorystepsadditionleft + S (pff_trace_before_multiple_unique_secondhistorysteps) = (p)) /\ (((exists pfa_gap_multiple_unique_secondhistorystepsadditionright. pfa_gap_multiple_unique_secondhistorystepsadditionright + S (1) = (p)) /\ ((((exists pfa_gap_multiple_unique_secondhistorystepsadditionresultbound. pfa_gap_multiple_unique_secondhistorystepsadditionresultbound + S (pff_trace_after_multiple_unique_secondhistorysteps) = (p)) /\ ((exists pfa_offset_left_multiple_unique_secondhistorystepsadditionresultcongruence pfa_offset_right_multiple_unique_secondhistorystepsadditionresultcongruence. ((pff_trace_before_multiple_unique_secondhistorysteps) + (1)) + (p) * pfa_offset_left_multiple_unique_secondhistorystepsadditionresultcongruence = (pff_trace_after_multiple_unique_secondhistorysteps) + (p) * pfa_offset_right_multiple_unique_secondhistorystepsadditionresultcongruence)))))))))))))))))))) -> r = sConstructive proof overview
Generated structural guide
Any two actual histories of the same number of additions of one have identical endpoints.
The unchanged tactic script uses 2 declared prerequisites and contains 24 exact native proof lines.
Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
FP0052 prime_field_unit_multiple_residue binary_canonical_residue_functional 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. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply 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–7
02Use earlier factsL8–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L8
specialize binary_canonical_residue_functional (p) - L9
specialize binary_canonical_residue_functional (n) - L10
specialize binary_canonical_residue_functional (r) - L11
specialize binary_canonical_residue_functional (s) - L12
apply binary_canonical_residue_functional - L13
specialize prime_field_unit_multiple_residue (p) - L14
specialize prime_field_unit_multiple_residue (n) - L15
specialize prime_field_unit_multiple_residue (r) - L16
apply prime_field_unit_multiple_residue - L17
exact hp
03Use earlier factsL18–24
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 24 lines
- 0001
intro p - 0002
intro n - 0003
intro r - 0004
intro s - 0005
intro hp - 0006
intro hr - 0007
intro hs - 0008
specialize binary_canonical_residue_functional (p) - 0009
specialize binary_canonical_residue_functional (n) - 0010
specialize binary_canonical_residue_functional (r) - 0011
specialize binary_canonical_residue_functional (s) - 0012
apply binary_canonical_residue_functional - 0013
specialize prime_field_unit_multiple_residue (p) - 0014
specialize prime_field_unit_multiple_residue (n) - 0015
specialize prime_field_unit_multiple_residue (r) - 0016
apply prime_field_unit_multiple_residue - 0017
exact hp - 0018
exact hr - 0019
specialize prime_field_unit_multiple_residue (p) - 0020
specialize prime_field_unit_multiple_residue (n) - 0021
specialize prime_field_unit_multiple_residue (s) - 0022
apply prime_field_unit_multiple_residue - 0023
exact hp - 0024
exact hs