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 b c L t d e M u f g N. ((((L)=(t)+(M)) /\ (((forall fom_index_pfp_unique_firstinput. (exists fom_gap_pfp_unique_firstinput_index_bound. fom_gap_pfp_unique_firstinput_index_bound + S (fom_index_pfp_unique_firstinput) = L) -> exists fom_value_pfp_unique_firstinput. ((((exists fom_beta_height_pfp_unique_firstinput_entry. fom_beta_height_pfp_unique_firstinput_entry + S (fom_value_pfp_unique_firstinput) = S ((S (fom_index_pfp_unique_firstinput)) * c)) /\ exists fom_beta_quotient_pfp_unique_firstinput_entry. b = fom_beta_quotient_pfp_unique_firstinput_entry * S ((S (fom_index_pfp_unique_firstinput)) * c) + (fom_value_pfp_unique_firstinput))) /\ (exists fom_gap_pfp_unique_firstinput_value_bound. fom_gap_pfp_unique_firstinput_value_bound + S (fom_value_pfp_unique_firstinput) = p))) /\ (((forall pfp_repeat_index_unique_firstremoved. (exists pfa_gap_unique_firstremovedindex. pfa_gap_unique_firstremovedindex + S (pfp_repeat_index_unique_firstremoved) = (t)) -> (((exists ff_h_pfp_unique_firstremovedentry. ff_h_pfp_unique_firstremovedentry + S (0) = S ((S (pfp_repeat_index_unique_firstremoved)) * c)) /\ exists ff_q_pfp_unique_firstremovedentry. b = ff_q_pfp_unique_firstremovedentry * S ((S (pfp_repeat_index_unique_firstremoved)) * c) + (0)))) /\ (((forall pftrim_index_unique_firstsuffix pftrim_value_unique_firstsuffix. (exists pfa_gap_unique_firstsuffixbound. pfa_gap_unique_firstsuffixbound + S (pftrim_index_unique_firstsuffix) = (M)) -> (((exists ff_h_pfp_unique_firstsuffixsource. ff_h_pfp_unique_firstsuffixsource + S (pftrim_value_unique_firstsuffix) = S ((S ((t)+pftrim_index_unique_firstsuffix)) * c)) /\ exists ff_q_pfp_unique_firstsuffixsource. b = ff_q_pfp_unique_firstsuffixsource * S ((S ((t)+pftrim_index_unique_firstsuffix)) * c) + (pftrim_value_unique_firstsuffix))) -> (((exists ff_h_pfp_unique_firstsuffixoutput. ff_h_pfp_unique_firstsuffixoutput + S (pftrim_value_unique_firstsuffix) = S ((S (pftrim_index_unique_firstsuffix)) * e)) /\ exists ff_q_pfp_unique_firstsuffixoutput. d = ff_q_pfp_unique_firstsuffixoutput * S ((S (pftrim_index_unique_firstsuffix)) * e) + (pftrim_value_unique_firstsuffix)))) /\ (((M)=0 \/ (exists pftrim_leading_unique_firstnormal. ((((exists ff_h_pfp_unique_firstnormalentry. ff_h_pfp_unique_firstnormalentry + S (pftrim_leading_unique_firstnormal) = S ((S (0)) * e)) /\ exists ff_q_pfp_unique_firstnormalentry. d = ff_q_pfp_unique_firstnormalentry * S ((S (0)) * e) + (pftrim_leading_unique_firstnormal))) /\ ((~(pftrim_leading_unique_firstnormal=0))))))))))))))) -> ((((L)=(u)+(N)) /\ (((forall fom_index_pfp_unique_secondinput. (exists fom_gap_pfp_unique_secondinput_index_bound. fom_gap_pfp_unique_secondinput_index_bound + S (fom_index_pfp_unique_secondinput) = L) -> exists fom_value_pfp_unique_secondinput. ((((exists fom_beta_height_pfp_unique_secondinput_entry. fom_beta_height_pfp_unique_secondinput_entry + S (fom_value_pfp_unique_secondinput) = S ((S (fom_index_pfp_unique_secondinput)) * c)) /\ exists fom_beta_quotient_pfp_unique_secondinput_entry. b = fom_beta_quotient_pfp_unique_secondinput_entry * S ((S (fom_index_pfp_unique_secondinput)) * c) + (fom_value_pfp_unique_secondinput))) /\ (exists fom_gap_pfp_unique_secondinput_value_bound. fom_gap_pfp_unique_secondinput_value_bound + S (fom_value_pfp_unique_secondinput) = p))) /\ (((forall pfp_repeat_index_unique_secondremoved. (exists pfa_gap_unique_secondremovedindex. pfa_gap_unique_secondremovedindex + S (pfp_repeat_index_unique_secondremoved) = (u)) -> (((exists ff_h_pfp_unique_secondremovedentry. ff_h_pfp_unique_secondremovedentry + S (0) = S ((S (pfp_repeat_index_unique_secondremoved)) * c)) /\ exists ff_q_pfp_unique_secondremovedentry. b = ff_q_pfp_unique_secondremovedentry * S ((S (pfp_repeat_index_unique_secondremoved)) * c) + (0)))) /\ (((forall pftrim_index_unique_secondsuffix pftrim_value_unique_secondsuffix. (exists pfa_gap_unique_secondsuffixbound. pfa_gap_unique_secondsuffixbound + S (pftrim_index_unique_secondsuffix) = (N)) -> (((exists ff_h_pfp_unique_secondsuffixsource. ff_h_pfp_unique_secondsuffixsource + S (pftrim_value_unique_secondsuffix) = S ((S ((u)+pftrim_index_unique_secondsuffix)) * c)) /\ exists ff_q_pfp_unique_secondsuffixsource. b = ff_q_pfp_unique_secondsuffixsource * S ((S ((u)+pftrim_index_unique_secondsuffix)) * c) + (pftrim_value_unique_secondsuffix))) -> (((exists ff_h_pfp_unique_secondsuffixoutput. ff_h_pfp_unique_secondsuffixoutput + S (pftrim_value_unique_secondsuffix) = S ((S (pftrim_index_unique_secondsuffix)) * g)) /\ exists ff_q_pfp_unique_secondsuffixoutput. f = ff_q_pfp_unique_secondsuffixoutput * S ((S (pftrim_index_unique_secondsuffix)) * g) + (pftrim_value_unique_secondsuffix)))) /\ (((N)=0 \/ (exists pftrim_leading_unique_secondnormal. ((((exists ff_h_pfp_unique_secondnormalentry. ff_h_pfp_unique_secondnormalentry + S (pftrim_leading_unique_secondnormal) = S ((S (0)) * g)) /\ exists ff_q_pfp_unique_secondnormalentry. f = ff_q_pfp_unique_secondnormalentry * S ((S (0)) * g) + (pftrim_leading_unique_secondnormal))) /\ ((~(pftrim_leading_unique_secondnormal=0))))))))))))))) -> (forall mdr_i_pfp_unique_coefficients mdr_a_pfp_unique_coefficients. (exists mdr_gap_pfp_unique_coefficientsb. mdr_gap_pfp_unique_coefficientsb + S (mdr_i_pfp_unique_coefficients) = (M)) -> (((exists ff_h_mdr_pfp_unique_coefficientso. ff_h_mdr_pfp_unique_coefficientso + S (mdr_a_pfp_unique_coefficients) = S ((S (mdr_i_pfp_unique_coefficients)) * e)) /\ exists ff_q_mdr_pfp_unique_coefficientso. d = ff_q_mdr_pfp_unique_coefficientso * S ((S (mdr_i_pfp_unique_coefficients)) * e) + (mdr_a_pfp_unique_coefficients))) -> (((exists ff_h_mdr_pfp_unique_coefficientsn. ff_h_mdr_pfp_unique_coefficientsn + S (mdr_a_pfp_unique_coefficients) = S ((S (mdr_i_pfp_unique_coefficients)) * g)) /\ exists ff_q_mdr_pfp_unique_coefficientsn. f = ff_q_mdr_pfp_unique_coefficientsn * S ((S (mdr_i_pfp_unique_coefficients)) * g) + (mdr_a_pfp_unique_coefficients))))Constructive proof overview
Generated structural guide
All actual trims of the same input agree coefficientwise on the unique retained prefix; no beta-code identity follows.
The unchanged tactic script uses 3 declared prerequisites and contains 69 exact native proof lines.
Alpha v34 checked-use · first admitted v32 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
PQ002A prime_field_polynomial_trim_removed_count_unique PQ002B prime_field_polynomial_trim_retained_length_unique PQ001E prime_field_polynomial_suffix_equalDirect 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 (3)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–14
03Establish htL15–24
Establish this local claim before using it. It is not an additional assumption.
- L15
have ht : t=u - L16
specialize prime_field_polynomial_trim_removed_count_unique (p) - L17
specialize prime_field_polynomial_trim_removed_count_unique (b) - L18
specialize prime_field_polynomial_trim_removed_count_unique (c) - L19
specialize prime_field_polynomial_trim_removed_count_unique (L) - L20
specialize prime_field_polynomial_trim_removed_count_unique (t) - L21
specialize prime_field_polynomial_trim_removed_count_unique (d) - L22
specialize prime_field_polynomial_trim_removed_count_unique (e) - L23
specialize prime_field_polynomial_trim_removed_count_unique (M) - L24
specialize prime_field_polynomial_trim_removed_count_unique (u)
04Use earlier factsL25–30
Instantiate or apply named facts and discharge the corresponding proof obligations.
05Establish hML31–40
Establish this local claim before using it. It is not an additional assumption.
- L31
have hM : M=N - L32
specialize prime_field_polynomial_trim_retained_length_unique (p) - L33
specialize prime_field_polynomial_trim_retained_length_unique (b) - L34
specialize prime_field_polynomial_trim_retained_length_unique (c) - L35
specialize prime_field_polynomial_trim_retained_length_unique (L) - L36
specialize prime_field_polynomial_trim_retained_length_unique (t) - L37
specialize prime_field_polynomial_trim_retained_length_unique (d) - L38
specialize prime_field_polynomial_trim_retained_length_unique (e) - L39
specialize prime_field_polynomial_trim_retained_length_unique (M) - L40
specialize prime_field_polynomial_trim_retained_length_unique (u)
06Use earlier factsL41–46
Instantiate or apply named facts and discharge the corresponding proof obligations.
07Separate the logical casesL47–54
08Calculate and transport equalitiesL55–58
09Use earlier factsL59–68
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L59
specialize prime_field_polynomial_suffix_equal (b) - L60
specialize prime_field_polynomial_suffix_equal (c) - L61
specialize prime_field_polynomial_suffix_equal (u) - L62
specialize prime_field_polynomial_suffix_equal (d) - L63
specialize prime_field_polynomial_suffix_equal (e) - L64
specialize prime_field_polynomial_suffix_equal (f) - L65
specialize prime_field_polynomial_suffix_equal (g) - L66
specialize prime_field_polynomial_suffix_equal (N) - L67
apply prime_field_polynomial_suffix_equal - L68
exact h_right_right_right_left
10Use earlier factsL69–69
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L69
exact hk_right_right_right_left
Original exact command ledger · 69 lines
- 0001
intro p - 0002
intro b - 0003
intro c - 0004
intro L - 0005
intro t - 0006
intro d - 0007
intro e - 0008
intro M - 0009
intro u - 0010
intro f - 0011
intro g - 0012
intro N - 0013
intro h - 0014
intro hk - 0015
have ht : t=u - 0016
specialize prime_field_polynomial_trim_removed_count_unique (p) - 0017
specialize prime_field_polynomial_trim_removed_count_unique (b) - 0018
specialize prime_field_polynomial_trim_removed_count_unique (c) - 0019
specialize prime_field_polynomial_trim_removed_count_unique (L) - 0020
specialize prime_field_polynomial_trim_removed_count_unique (t) - 0021
specialize prime_field_polynomial_trim_removed_count_unique (d) - 0022
specialize prime_field_polynomial_trim_removed_count_unique (e) - 0023
specialize prime_field_polynomial_trim_removed_count_unique (M) - 0024
specialize prime_field_polynomial_trim_removed_count_unique (u) - 0025
specialize prime_field_polynomial_trim_removed_count_unique (f) - 0026
specialize prime_field_polynomial_trim_removed_count_unique (g) - 0027
specialize prime_field_polynomial_trim_removed_count_unique (N) - 0028
apply prime_field_polynomial_trim_removed_count_unique - 0029
exact h - 0030
exact hk - 0031
have hM : M=N - 0032
specialize prime_field_polynomial_trim_retained_length_unique (p) - 0033
specialize prime_field_polynomial_trim_retained_length_unique (b) - 0034
specialize prime_field_polynomial_trim_retained_length_unique (c) - 0035
specialize prime_field_polynomial_trim_retained_length_unique (L) - 0036
specialize prime_field_polynomial_trim_retained_length_unique (t) - 0037
specialize prime_field_polynomial_trim_retained_length_unique (d) - 0038
specialize prime_field_polynomial_trim_retained_length_unique (e) - 0039
specialize prime_field_polynomial_trim_retained_length_unique (M) - 0040
specialize prime_field_polynomial_trim_retained_length_unique (u) - 0041
specialize prime_field_polynomial_trim_retained_length_unique (f) - 0042
specialize prime_field_polynomial_trim_retained_length_unique (g) - 0043
specialize prime_field_polynomial_trim_retained_length_unique (N) - 0044
apply prime_field_polynomial_trim_retained_length_unique - 0045
exact h - 0046
exact hk - 0047
cases h - 0048
cases h_right - 0049
cases h_right_right - 0050
cases h_right_right_right - 0051
cases hk - 0052
cases hk_right - 0053
cases hk_right_right - 0054
cases hk_right_right_right - 0055
rewrite ht at h_right_right_right_left - 0056
rewrite ht at h_right_right_right_left - 0057
rewrite hM at h_right_right_right_left - 0058
rewrite hM - 0059
specialize prime_field_polynomial_suffix_equal (b) - 0060
specialize prime_field_polynomial_suffix_equal (c) - 0061
specialize prime_field_polynomial_suffix_equal (u) - 0062
specialize prime_field_polynomial_suffix_equal (d) - 0063
specialize prime_field_polynomial_suffix_equal (e) - 0064
specialize prime_field_polynomial_suffix_equal (f) - 0065
specialize prime_field_polynomial_suffix_equal (g) - 0066
specialize prime_field_polynomial_suffix_equal (N) - 0067
apply prime_field_polynomial_suffix_equal - 0068
exact h_right_right_right_left - 0069
exact hk_right_right_right_left