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 k ab ac bb bc AB AC BB BC L. (forall mdr_i_pfp_normalization_recode_input mdr_a_pfp_normalization_recode_input. (exists mdr_gap_pfp_normalization_recode_inputb. mdr_gap_pfp_normalization_recode_inputb + S (mdr_i_pfp_normalization_recode_input) = (L)) -> (((exists ff_h_mdr_pfp_normalization_recode_inputo. ff_h_mdr_pfp_normalization_recode_inputo + S (mdr_a_pfp_normalization_recode_input) = S ((S (mdr_i_pfp_normalization_recode_input)) * ac)) /\ exists ff_q_mdr_pfp_normalization_recode_inputo. ab = ff_q_mdr_pfp_normalization_recode_inputo * S ((S (mdr_i_pfp_normalization_recode_input)) * ac) + (mdr_a_pfp_normalization_recode_input))) -> (((exists ff_h_mdr_pfp_normalization_recode_inputn. ff_h_mdr_pfp_normalization_recode_inputn + S (mdr_a_pfp_normalization_recode_input) = S ((S (mdr_i_pfp_normalization_recode_input)) * AC)) /\ exists ff_q_mdr_pfp_normalization_recode_inputn. AB = ff_q_mdr_pfp_normalization_recode_inputn * S ((S (mdr_i_pfp_normalization_recode_input)) * AC) + (mdr_a_pfp_normalization_recode_input)))) -> (forall mdr_i_pfp_normalization_recode_output mdr_a_pfp_normalization_recode_output. (exists mdr_gap_pfp_normalization_recode_outputb. mdr_gap_pfp_normalization_recode_outputb + S (mdr_i_pfp_normalization_recode_output) = (L)) -> (((exists ff_h_mdr_pfp_normalization_recode_outputo. ff_h_mdr_pfp_normalization_recode_outputo + S (mdr_a_pfp_normalization_recode_output) = S ((S (mdr_i_pfp_normalization_recode_output)) * bc)) /\ exists ff_q_mdr_pfp_normalization_recode_outputo. bb = ff_q_mdr_pfp_normalization_recode_outputo * S ((S (mdr_i_pfp_normalization_recode_output)) * bc) + (mdr_a_pfp_normalization_recode_output))) -> (((exists ff_h_mdr_pfp_normalization_recode_outputn. ff_h_mdr_pfp_normalization_recode_outputn + S (mdr_a_pfp_normalization_recode_output) = S ((S (mdr_i_pfp_normalization_recode_output)) * BC)) /\ exists ff_q_mdr_pfp_normalization_recode_outputn. BB = ff_q_mdr_pfp_normalization_recode_outputn * S ((S (mdr_i_pfp_normalization_recode_output)) * BC) + (mdr_a_pfp_normalization_recode_output)))) -> (((~((L) = 0)) /\ (((exists pfm_leading_normalization_recode_old. ((((exists ff_h_pfp_normalization_recode_oldsource. ff_h_pfp_normalization_recode_oldsource + S (pfm_leading_normalization_recode_old) = S ((S (0)) * ac)) /\ exists ff_q_pfp_normalization_recode_oldsource. ab = ff_q_pfp_normalization_recode_oldsource * S ((S (0)) * ac) + (pfm_leading_normalization_recode_old))) /\ ((((~((pfm_leading_normalization_recode_old) = 0)) /\ ((((exists pfa_gap_normalization_recode_oldinversemultiplicationleft. pfa_gap_normalization_recode_oldinversemultiplicationleft + S (pfm_leading_normalization_recode_old) = (p)) /\ (((exists pfa_gap_normalization_recode_oldinversemultiplicationright. pfa_gap_normalization_recode_oldinversemultiplicationright + S (k) = (p)) /\ ((((exists pfa_gap_normalization_recode_oldinversemultiplicationresultbound. pfa_gap_normalization_recode_oldinversemultiplicationresultbound + S (1) = (p)) /\ ((exists pfa_offset_left_normalization_recode_oldinversemultiplicationresultcongruence pfa_offset_right_normalization_recode_oldinversemultiplicationresultcongruence. ((pfm_leading_normalization_recode_old) * (k)) + (p) * pfa_offset_left_normalization_recode_oldinversemultiplicationresultcongruence = (1) + (p) * pfa_offset_right_normalization_recode_oldinversemultiplicationresultcongruence))))))))))))))) /\ ((((exists pfa_gap_normalization_recode_oldscalescalar. pfa_gap_normalization_recode_oldscalescalar + S (k) = (p)) /\ ((forall pfp_index_normalization_recode_oldscale. (exists pfa_gap_normalization_recode_oldscaleindex. pfa_gap_normalization_recode_oldscaleindex + S (pfp_index_normalization_recode_oldscale) = (L)) -> exists pfp_source_normalization_recode_oldscale pfp_value_normalization_recode_oldscale. ((((exists ff_h_pfp_normalization_recode_oldscalesource. ff_h_pfp_normalization_recode_oldscalesource + S (pfp_source_normalization_recode_oldscale) = S ((S (pfp_index_normalization_recode_oldscale)) * ac)) /\ exists ff_q_pfp_normalization_recode_oldscalesource. ab = ff_q_pfp_normalization_recode_oldscalesource * S ((S (pfp_index_normalization_recode_oldscale)) * ac) + (pfp_source_normalization_recode_oldscale))) /\ (((((exists ff_h_pfp_normalization_recode_oldscaletarget. ff_h_pfp_normalization_recode_oldscaletarget + S (pfp_value_normalization_recode_oldscale) = S ((S (pfp_index_normalization_recode_oldscale)) * bc)) /\ exists ff_q_pfp_normalization_recode_oldscaletarget. bb = ff_q_pfp_normalization_recode_oldscaletarget * S ((S (pfp_index_normalization_recode_oldscale)) * bc) + (pfp_value_normalization_recode_oldscale))) /\ ((((exists pfa_gap_normalization_recode_oldscaleoperationleft. pfa_gap_normalization_recode_oldscaleoperationleft + S (k) = (p)) /\ (((exists pfa_gap_normalization_recode_oldscaleoperationright. pfa_gap_normalization_recode_oldscaleoperationright + S (pfp_source_normalization_recode_oldscale) = (p)) /\ ((((exists pfa_gap_normalization_recode_oldscaleoperationresultbound. pfa_gap_normalization_recode_oldscaleoperationresultbound + S (pfp_value_normalization_recode_oldscale) = (p)) /\ ((exists pfa_offset_left_normalization_recode_oldscaleoperationresultcongruence pfa_offset_right_normalization_recode_oldscaleoperationresultcongruence. ((k) * (pfp_source_normalization_recode_oldscale)) + (p) * pfa_offset_left_normalization_recode_oldscaleoperationresultcongruence = (pfp_value_normalization_recode_oldscale) + (p) * pfa_offset_right_normalization_recode_oldscaleoperationresultcongruence)))))))))))))))))))))) -> (((~((L) = 0)) /\ (((exists pfm_leading_normalization_recode_new. ((((exists ff_h_pfp_normalization_recode_newsource. ff_h_pfp_normalization_recode_newsource + S (pfm_leading_normalization_recode_new) = S ((S (0)) * AC)) /\ exists ff_q_pfp_normalization_recode_newsource. AB = ff_q_pfp_normalization_recode_newsource * S ((S (0)) * AC) + (pfm_leading_normalization_recode_new))) /\ ((((~((pfm_leading_normalization_recode_new) = 0)) /\ ((((exists pfa_gap_normalization_recode_newinversemultiplicationleft. pfa_gap_normalization_recode_newinversemultiplicationleft + S (pfm_leading_normalization_recode_new) = (p)) /\ (((exists pfa_gap_normalization_recode_newinversemultiplicationright. pfa_gap_normalization_recode_newinversemultiplicationright + S (k) = (p)) /\ ((((exists pfa_gap_normalization_recode_newinversemultiplicationresultbound. pfa_gap_normalization_recode_newinversemultiplicationresultbound + S (1) = (p)) /\ ((exists pfa_offset_left_normalization_recode_newinversemultiplicationresultcongruence pfa_offset_right_normalization_recode_newinversemultiplicationresultcongruence. ((pfm_leading_normalization_recode_new) * (k)) + (p) * pfa_offset_left_normalization_recode_newinversemultiplicationresultcongruence = (1) + (p) * pfa_offset_right_normalization_recode_newinversemultiplicationresultcongruence))))))))))))))) /\ ((((exists pfa_gap_normalization_recode_newscalescalar. pfa_gap_normalization_recode_newscalescalar + S (k) = (p)) /\ ((forall pfp_index_normalization_recode_newscale. (exists pfa_gap_normalization_recode_newscaleindex. pfa_gap_normalization_recode_newscaleindex + S (pfp_index_normalization_recode_newscale) = (L)) -> exists pfp_source_normalization_recode_newscale pfp_value_normalization_recode_newscale. ((((exists ff_h_pfp_normalization_recode_newscalesource. ff_h_pfp_normalization_recode_newscalesource + S (pfp_source_normalization_recode_newscale) = S ((S (pfp_index_normalization_recode_newscale)) * AC)) /\ exists ff_q_pfp_normalization_recode_newscalesource. AB = ff_q_pfp_normalization_recode_newscalesource * S ((S (pfp_index_normalization_recode_newscale)) * AC) + (pfp_source_normalization_recode_newscale))) /\ (((((exists ff_h_pfp_normalization_recode_newscaletarget. ff_h_pfp_normalization_recode_newscaletarget + S (pfp_value_normalization_recode_newscale) = S ((S (pfp_index_normalization_recode_newscale)) * BC)) /\ exists ff_q_pfp_normalization_recode_newscaletarget. BB = ff_q_pfp_normalization_recode_newscaletarget * S ((S (pfp_index_normalization_recode_newscale)) * BC) + (pfp_value_normalization_recode_newscale))) /\ ((((exists pfa_gap_normalization_recode_newscaleoperationleft. pfa_gap_normalization_recode_newscaleoperationleft + S (k) = (p)) /\ (((exists pfa_gap_normalization_recode_newscaleoperationright. pfa_gap_normalization_recode_newscaleoperationright + S (pfp_source_normalization_recode_newscale) = (p)) /\ ((((exists pfa_gap_normalization_recode_newscaleoperationresultbound. pfa_gap_normalization_recode_newscaleoperationresultbound + S (pfp_value_normalization_recode_newscale) = (p)) /\ ((exists pfa_offset_left_normalization_recode_newscaleoperationresultcongruence pfa_offset_right_normalization_recode_newscaleoperationresultcongruence. ((k) * (pfp_source_normalization_recode_newscale)) + (p) * pfa_offset_left_normalization_recode_newscaleoperationresultcongruence = (pfp_value_normalization_recode_newscale) + (p) * pfa_offset_right_normalization_recode_newscaleoperationresultcongruence))))))))))))))))))))))Constructive proof overview
Generated structural guide
Reencode both actual coefficient prefixes while retaining the same genuine leading inverse and scale relation.
The unchanged tactic script uses 2 declared prerequisites and contains 46 exact native proof lines.
Alpha v34 checked-use · first admitted v32 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
one_le_of_ne_zero Stable theorem; checked-use authorized prime_field_polynomial_scale_transport 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.
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–14
03Separate the logical casesL15–17
04Use earlier factsL18–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L18
exact h_left
05Separate the logical casesL19–21
06Construct an explicit witnessL22–22
Supply the displayed value, then prove that it has the required property.
- L22
exists x
07Separate the logical casesL23–23
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L23
split
08Use earlier factsL24–33
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L24
specialize hin (0) - L25
specialize hin (x) - L26
apply hin - L27
specialize one_le_of_ne_zero (L) - L28
apply one_le_of_ne_zero - L29
exact h_left - L30
exact h_right_left_witness_left - L31
exact h_right_left_witness_right - L32
specialize prime_field_polynomial_scale_transport (p) - L33
specialize prime_field_polynomial_scale_transport (k)
09Use earlier factsL34–43
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L34
specialize prime_field_polynomial_scale_transport (ab) - L35
specialize prime_field_polynomial_scale_transport (ac) - L36
specialize prime_field_polynomial_scale_transport (bb) - L37
specialize prime_field_polynomial_scale_transport (bc) - L38
specialize prime_field_polynomial_scale_transport (AB) - L39
specialize prime_field_polynomial_scale_transport (AC) - L40
specialize prime_field_polynomial_scale_transport (BB) - L41
specialize prime_field_polynomial_scale_transport (BC) - L42
specialize prime_field_polynomial_scale_transport (L) - L43
apply prime_field_polynomial_scale_transport
Original exact command ledger · 46 lines
- 0001
intro p - 0002
intro k - 0003
intro ab - 0004
intro ac - 0005
intro bb - 0006
intro bc - 0007
intro AB - 0008
intro AC - 0009
intro BB - 0010
intro BC - 0011
intro L - 0012
intro hin - 0013
intro hout - 0014
intro h - 0015
cases h - 0016
cases h_right - 0017
split - 0018
exact h_left - 0019
split - 0020
cases h_right_left - 0021
cases h_right_left_witness - 0022
exists x - 0023
split - 0024
specialize hin (0) - 0025
specialize hin (x) - 0026
apply hin - 0027
specialize one_le_of_ne_zero (L) - 0028
apply one_le_of_ne_zero - 0029
exact h_left - 0030
exact h_right_left_witness_left - 0031
exact h_right_left_witness_right - 0032
specialize prime_field_polynomial_scale_transport (p) - 0033
specialize prime_field_polynomial_scale_transport (k) - 0034
specialize prime_field_polynomial_scale_transport (ab) - 0035
specialize prime_field_polynomial_scale_transport (ac) - 0036
specialize prime_field_polynomial_scale_transport (bb) - 0037
specialize prime_field_polynomial_scale_transport (bc) - 0038
specialize prime_field_polynomial_scale_transport (AB) - 0039
specialize prime_field_polynomial_scale_transport (AC) - 0040
specialize prime_field_polynomial_scale_transport (BB) - 0041
specialize prime_field_polynomial_scale_transport (BC) - 0042
specialize prime_field_polynomial_scale_transport (L) - 0043
apply prime_field_polynomial_scale_transport - 0044
exact hin - 0045
exact hout - 0046
exact h_right_right