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 b c L d e M f g N. (forall pfrep_power_equivalent_transitive_a pfrep_left_equivalent_transitive_a pfrep_right_equivalent_transitive_a. ((exists pfrep_position_equivalent_transitive_afirst. ((pfrep_position_equivalent_transitive_afirst+S (pfrep_power_equivalent_transitive_a)=(L)) /\ ((((exists ff_h_pfp_equivalent_transitive_afirstentry. ff_h_pfp_equivalent_transitive_afirstentry + S (pfrep_left_equivalent_transitive_a) = S ((S (pfrep_position_equivalent_transitive_afirst)) * c)) /\ exists ff_q_pfp_equivalent_transitive_afirstentry. b = ff_q_pfp_equivalent_transitive_afirstentry * S ((S (pfrep_position_equivalent_transitive_afirst)) * c) + (pfrep_left_equivalent_transitive_a)))))) \/ (((exists pfrep_gap_equivalent_transitive_afirstoutside. pfrep_gap_equivalent_transitive_afirstoutside+(L)=(pfrep_power_equivalent_transitive_a)) /\ (((pfrep_left_equivalent_transitive_a)=0))))) -> ((exists pfrep_position_equivalent_transitive_asecond. ((pfrep_position_equivalent_transitive_asecond+S (pfrep_power_equivalent_transitive_a)=(M)) /\ ((((exists ff_h_pfp_equivalent_transitive_asecondentry. ff_h_pfp_equivalent_transitive_asecondentry + S (pfrep_right_equivalent_transitive_a) = S ((S (pfrep_position_equivalent_transitive_asecond)) * e)) /\ exists ff_q_pfp_equivalent_transitive_asecondentry. d = ff_q_pfp_equivalent_transitive_asecondentry * S ((S (pfrep_position_equivalent_transitive_asecond)) * e) + (pfrep_right_equivalent_transitive_a)))))) \/ (((exists pfrep_gap_equivalent_transitive_asecondoutside. pfrep_gap_equivalent_transitive_asecondoutside+(M)=(pfrep_power_equivalent_transitive_a)) /\ (((pfrep_right_equivalent_transitive_a)=0))))) -> pfrep_left_equivalent_transitive_a=pfrep_right_equivalent_transitive_a) -> (forall pfrep_power_equivalent_transitive_b pfrep_left_equivalent_transitive_b pfrep_right_equivalent_transitive_b. ((exists pfrep_position_equivalent_transitive_bfirst. ((pfrep_position_equivalent_transitive_bfirst+S (pfrep_power_equivalent_transitive_b)=(M)) /\ ((((exists ff_h_pfp_equivalent_transitive_bfirstentry. ff_h_pfp_equivalent_transitive_bfirstentry + S (pfrep_left_equivalent_transitive_b) = S ((S (pfrep_position_equivalent_transitive_bfirst)) * e)) /\ exists ff_q_pfp_equivalent_transitive_bfirstentry. d = ff_q_pfp_equivalent_transitive_bfirstentry * S ((S (pfrep_position_equivalent_transitive_bfirst)) * e) + (pfrep_left_equivalent_transitive_b)))))) \/ (((exists pfrep_gap_equivalent_transitive_bfirstoutside. pfrep_gap_equivalent_transitive_bfirstoutside+(M)=(pfrep_power_equivalent_transitive_b)) /\ (((pfrep_left_equivalent_transitive_b)=0))))) -> ((exists pfrep_position_equivalent_transitive_bsecond. ((pfrep_position_equivalent_transitive_bsecond+S (pfrep_power_equivalent_transitive_b)=(N)) /\ ((((exists ff_h_pfp_equivalent_transitive_bsecondentry. ff_h_pfp_equivalent_transitive_bsecondentry + S (pfrep_right_equivalent_transitive_b) = S ((S (pfrep_position_equivalent_transitive_bsecond)) * g)) /\ exists ff_q_pfp_equivalent_transitive_bsecondentry. f = ff_q_pfp_equivalent_transitive_bsecondentry * S ((S (pfrep_position_equivalent_transitive_bsecond)) * g) + (pfrep_right_equivalent_transitive_b)))))) \/ (((exists pfrep_gap_equivalent_transitive_bsecondoutside. pfrep_gap_equivalent_transitive_bsecondoutside+(N)=(pfrep_power_equivalent_transitive_b)) /\ (((pfrep_right_equivalent_transitive_b)=0))))) -> pfrep_left_equivalent_transitive_b=pfrep_right_equivalent_transitive_b) -> (forall pfrep_power_equivalent_transitive_result pfrep_left_equivalent_transitive_result pfrep_right_equivalent_transitive_result. ((exists pfrep_position_equivalent_transitive_resultfirst. ((pfrep_position_equivalent_transitive_resultfirst+S (pfrep_power_equivalent_transitive_result)=(L)) /\ ((((exists ff_h_pfp_equivalent_transitive_resultfirstentry. ff_h_pfp_equivalent_transitive_resultfirstentry + S (pfrep_left_equivalent_transitive_result) = S ((S (pfrep_position_equivalent_transitive_resultfirst)) * c)) /\ exists ff_q_pfp_equivalent_transitive_resultfirstentry. b = ff_q_pfp_equivalent_transitive_resultfirstentry * S ((S (pfrep_position_equivalent_transitive_resultfirst)) * c) + (pfrep_left_equivalent_transitive_result)))))) \/ (((exists pfrep_gap_equivalent_transitive_resultfirstoutside. pfrep_gap_equivalent_transitive_resultfirstoutside+(L)=(pfrep_power_equivalent_transitive_result)) /\ (((pfrep_left_equivalent_transitive_result)=0))))) -> ((exists pfrep_position_equivalent_transitive_resultsecond. ((pfrep_position_equivalent_transitive_resultsecond+S (pfrep_power_equivalent_transitive_result)=(N)) /\ ((((exists ff_h_pfp_equivalent_transitive_resultsecondentry. ff_h_pfp_equivalent_transitive_resultsecondentry + S (pfrep_right_equivalent_transitive_result) = S ((S (pfrep_position_equivalent_transitive_resultsecond)) * g)) /\ exists ff_q_pfp_equivalent_transitive_resultsecondentry. f = ff_q_pfp_equivalent_transitive_resultsecondentry * S ((S (pfrep_position_equivalent_transitive_resultsecond)) * g) + (pfrep_right_equivalent_transitive_result)))))) \/ (((exists pfrep_gap_equivalent_transitive_resultsecondoutside. pfrep_gap_equivalent_transitive_resultsecondoutside+(N)=(pfrep_power_equivalent_transitive_result)) /\ (((pfrep_right_equivalent_transitive_result)=0))))) -> pfrep_left_equivalent_transitive_result=pfrep_right_equivalent_transitive_result)Constructive proof overview
Generated structural guide
Transitivity obtains an actual intermediate coefficient; it never assumes existential decoding.
The unchanged tactic script uses 1 declared prerequisite and contains 36 exact native proof lines.
Alpha v34 checked-use · first admitted v33 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
Direct dependents
PX006E prime_field_polynomial_convolution_left_padding_equivalent_left PX006F prime_field_polynomial_convolution_left_padding_equivalent_right PX0070 prime_field_polynomial_convolution_both_left_paddings_equivalent PX0072 prime_field_polynomial_equivalent_implies_left_pad PX0079 prime_field_polynomial_convolution_equivalent_congruentFormal 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–10
02Fix variables and assumptionsL11–16
03Establish hvL17–22
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field polynomial power coefficient exists.
- L17
have hv : exists z. ((exists pfrep_position_equivalent_middle. ((pfrep_position_equivalent_middle+S (k)=(M)) /\ ((((exists ff_h_pfp_equivalent_middleentry. ff_h_pfp_equivalent_middleentry + S (z) = S ((S (pfrep_position_equivalent_middle)) * e)) /\ exists ff_q_pfp_equivalent_middleentry. d = ff_q_pfp_equivalent_middleentry * S ((S (pfrep_position_equivalent_middle)) * e) + (z)))))) \/ (((exists pfrep_gap_equivalent_middleoutside. pfrep_gap_equivalent_middleoutside+(M)=(k)) /\ (((z)=0))))) - L18
specialize prime_field_polynomial_power_coefficient_exists (d) - L19
specialize prime_field_polynomial_power_coefficient_exists (e) - L20
specialize prime_field_polynomial_power_coefficient_exists (M) - L21
specialize prime_field_polynomial_power_coefficient_exists (k) - L22
apply prime_field_polynomial_power_coefficient_exists
04Separate the logical casesL23–23
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L23
cases hv
05Calculate and transport equalitiesL24–24
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L24
trans x
06Use earlier factsL25–34
Original exact command ledger · 36 lines
- 0001
intro b - 0002
intro c - 0003
intro L - 0004
intro d - 0005
intro e - 0006
intro M - 0007
intro f - 0008
intro g - 0009
intro N - 0010
intro he - 0011
intro hf - 0012
intro k - 0013
intro a - 0014
intro r - 0015
intro ha - 0016
intro hr - 0017
have hv : exists z. ((exists pfrep_position_equivalent_middle. ((pfrep_position_equivalent_middle+S (k)=(M)) /\ ((((exists ff_h_pfp_equivalent_middleentry. ff_h_pfp_equivalent_middleentry + S (z) = S ((S (pfrep_position_equivalent_middle)) * e)) /\ exists ff_q_pfp_equivalent_middleentry. d = ff_q_pfp_equivalent_middleentry * S ((S (pfrep_position_equivalent_middle)) * e) + (z)))))) \/ (((exists pfrep_gap_equivalent_middleoutside. pfrep_gap_equivalent_middleoutside+(M)=(k)) /\ (((z)=0))))) - 0018
specialize prime_field_polynomial_power_coefficient_exists (d) - 0019
specialize prime_field_polynomial_power_coefficient_exists (e) - 0020
specialize prime_field_polynomial_power_coefficient_exists (M) - 0021
specialize prime_field_polynomial_power_coefficient_exists (k) - 0022
apply prime_field_polynomial_power_coefficient_exists - 0023
cases hv - 0024
trans x - 0025
specialize he (k) - 0026
specialize he (a) - 0027
specialize he (x) - 0028
apply he - 0029
exact ha - 0030
exact hv_witness - 0031
specialize hf (k) - 0032
specialize hf (x) - 0033
specialize hf (r) - 0034
apply hf - 0035
exact hv_witness - 0036
exact hr