Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Coefficients are highest-degree-first. The divisor has a nonzero decoded head; primality supplies its actual inverse. Empty quotients and remainders are included. Functionality compares the constructed execution lengths and decoded coefficients, never arbitrary beta codes. Formal polynomial equivalence compares every coefficient, not evaluations on a finite field. The formal identity and remainder-degree bound are proved separately, not assumed by the execution graph. Arbitrary quotient/remainder-pair uniqueness from a formal identity, multiplication associativity, gcd/Bezout, irreducible-polynomial existence, and the full G091 prime-power-field goal remain open. The seven displayed new names are conservative first-order notation, not new kernel primitives.
Exact theorem in conservative defined notation
∀ p. ∀ ab. ∀ ac. ∀ L. ∀ bb. ∀ bc. ∀ M. ∀ cb. ∀ cc. ∀ N. ∀ BB. ∀ BC. ∀ t. ∀ CB. ∀ CC. ∀ K. ¬p = 0 → PolynomialLeftPad(bb,bc,M,t,BB,BC) → FpPolyProduct(p,ab,ac,L,bb,bc,M,cb,cc,N) → FpPolyProduct(p,ab,ac,L,BB,BC,t + M,CB,CC,K) → PolynomialEquivalent(cb,cc,N,CB,CC,K)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 211 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
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 (6)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–20
03Establish hLL21–24
04Separate the logical casesL25–25
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L25
cases hL
05Establish hzL26–29
Establish this local claim before using it. It is not an additional assumption.
- L26
have hz : Repeat(ab,ac,0,L)Definitions: Repeat(ab,ac,0,L)Original native command in the exact edition - L27
intro j - L28
intro hj - L29
rewrite hL_left at hj
06Separate the logical casesL30–30
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L30
exfalso
07Use earlier factsL31–33
08Establish hc0L34–43
Establish this local claim before using it. It is not an additional assumption.
- L34
have hc0 : Repeat(cb,cc,0,N)Definitions: Repeat(cb,cc,0,N)Original native command in the exact edition - L35
specialize prime_field_polynomial_convolution_zero_left (p) - L36
specialize prime_field_polynomial_convolution_zero_left (ab) - L37
specialize prime_field_polynomial_convolution_zero_left (ac) - L38
specialize prime_field_polynomial_convolution_zero_left (L) - L39
specialize prime_field_polynomial_convolution_zero_left (bb) - L40
specialize prime_field_polynomial_convolution_zero_left (bc) - L41
specialize prime_field_polynomial_convolution_zero_left (M) - L42
specialize prime_field_polynomial_convolution_zero_left (cb) - L43
specialize prime_field_polynomial_convolution_zero_left (cc)
09Use earlier factsL44–48
10Establish hn0L49–58
Establish this local claim before using it. It is not an additional assumption.
- L49
have hn0 : Repeat(CB,CC,0,K)Definitions: Repeat(CB,CC,0,K)Original native command in the exact edition - L50
specialize prime_field_polynomial_convolution_zero_left (p) - L51
specialize prime_field_polynomial_convolution_zero_left (ab) - L52
specialize prime_field_polynomial_convolution_zero_left (ac) - L53
specialize prime_field_polynomial_convolution_zero_left (L) - L54
specialize prime_field_polynomial_convolution_zero_left (BB) - L55
specialize prime_field_polynomial_convolution_zero_left (BC) - L56
specialize prime_field_polynomial_convolution_zero_left (t+M) - L57
specialize prime_field_polynomial_convolution_zero_left (CB) - L58
specialize prime_field_polynomial_convolution_zero_left (CC)
11Use earlier factsL59–63
12Establish hecL64–69
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field polynomial zero prefix equivalent empty.
- L64
have hec : PolynomialEquivalent(cb,cc,N,0,0,0)Definitions: PolynomialEquivalent(cb,cc,N,0,0,0)Original native command in the exact edition - L65
specialize prime_field_polynomial_zero_prefix_equivalent_empty (cb) - L66
specialize prime_field_polynomial_zero_prefix_equivalent_empty (cc) - L67
specialize prime_field_polynomial_zero_prefix_equivalent_empty (N) - L68
apply prime_field_polynomial_zero_prefix_equivalent_empty - L69
exact hc0
13Establish henL70–79
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field polynomial zero prefix equivalent empty.
- L70
have hen : PolynomialEquivalent(CB,CC,K,0,0,0)Definitions: PolynomialEquivalent(CB,CC,K,0,0,0)Original native command in the exact edition - L71
specialize prime_field_polynomial_zero_prefix_equivalent_empty (CB) - L72
specialize prime_field_polynomial_zero_prefix_equivalent_empty (CC) - L73
specialize prime_field_polynomial_zero_prefix_equivalent_empty (K) - L74
apply prime_field_polynomial_zero_prefix_equivalent_empty - L75
exact hn0 - L76
specialize prime_field_polynomial_equivalent_transitive (cb) - L77
specialize prime_field_polynomial_equivalent_transitive (cc) - L78
specialize prime_field_polynomial_equivalent_transitive (N) - L79
specialize prime_field_polynomial_equivalent_transitive (0)
14Use earlier factsL80–89
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L80
specialize prime_field_polynomial_equivalent_transitive (0) - L81
specialize prime_field_polynomial_equivalent_transitive (0) - L82
specialize prime_field_polynomial_equivalent_transitive (CB) - L83
specialize prime_field_polynomial_equivalent_transitive (CC) - L84
specialize prime_field_polynomial_equivalent_transitive (K) - L85
apply prime_field_polynomial_equivalent_transitive - L86
exact hec - L87
specialize prime_field_polynomial_equivalent_symmetric (CB) - L88
specialize prime_field_polynomial_equivalent_symmetric (CC) - L89
specialize prime_field_polynomial_equivalent_symmetric (K)
15Use earlier factsL90–94
Instantiate or apply named facts and discharge the corresponding proof obligations.
16Establish hML95–98
17Separate the logical casesL99–99
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L99
cases hM
18Establish hzL100–103
Establish this local claim before using it. It is not an additional assumption.
- L100
have hz : Repeat(bb,bc,0,M)Definitions: Repeat(bb,bc,0,M)Original native command in the exact edition - L101
intro j - L102
intro hj - L103
rewrite hM_left at hj
19Separate the logical casesL104–104
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L104
exfalso
20Use earlier factsL105–107
21Establish hc0L108–117
Establish this local claim before using it. It is not an additional assumption.
- L108
have hc0 : Repeat(cb,cc,0,N)Definitions: Repeat(cb,cc,0,N)Original native command in the exact edition - L109
specialize prime_field_polynomial_convolution_zero_right (p) - L110
specialize prime_field_polynomial_convolution_zero_right (ab) - L111
specialize prime_field_polynomial_convolution_zero_right (ac) - L112
specialize prime_field_polynomial_convolution_zero_right (L) - L113
specialize prime_field_polynomial_convolution_zero_right (bb) - L114
specialize prime_field_polynomial_convolution_zero_right (bc) - L115
specialize prime_field_polynomial_convolution_zero_right (M) - L116
specialize prime_field_polynomial_convolution_zero_right (cb) - L117
specialize prime_field_polynomial_convolution_zero_right (cc)
22Use earlier factsL118–122
23Establish hn0L123–132
Establish this local claim before using it. It is not an additional assumption.
- L123
have hn0 : Repeat(CB,CC,0,K)Definitions: Repeat(CB,CC,0,K)Original native command in the exact edition - L124
specialize prime_field_polynomial_convolution_zero_right (p) - L125
specialize prime_field_polynomial_convolution_zero_right (ab) - L126
specialize prime_field_polynomial_convolution_zero_right (ac) - L127
specialize prime_field_polynomial_convolution_zero_right (L) - L128
specialize prime_field_polynomial_convolution_zero_right (BB) - L129
specialize prime_field_polynomial_convolution_zero_right (BC) - L130
specialize prime_field_polynomial_convolution_zero_right (t+M) - L131
specialize prime_field_polynomial_convolution_zero_right (CB) - L132
specialize prime_field_polynomial_convolution_zero_right (CC)
24Use earlier factsL133–142
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L133
specialize prime_field_polynomial_convolution_zero_right (K) - L134
apply prime_field_polynomial_convolution_zero_right - L135
exact hp - L136
specialize polynomial_left_pad_zero_prefix (bb) - L137
specialize polynomial_left_pad_zero_prefix (bc) - L138
specialize polynomial_left_pad_zero_prefix (M) - L139
specialize polynomial_left_pad_zero_prefix (t) - L140
specialize polynomial_left_pad_zero_prefix (BB) - L141
specialize polynomial_left_pad_zero_prefix (BC) - L142
apply polynomial_left_pad_zero_prefix
25Use earlier factsL143–145
26Establish hecL146–151
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field polynomial zero prefix equivalent empty.
- L146
have hec : PolynomialEquivalent(cb,cc,N,0,0,0)Definitions: PolynomialEquivalent(cb,cc,N,0,0,0)Original native command in the exact edition - L147
specialize prime_field_polynomial_zero_prefix_equivalent_empty (cb) - L148
specialize prime_field_polynomial_zero_prefix_equivalent_empty (cc) - L149
specialize prime_field_polynomial_zero_prefix_equivalent_empty (N) - L150
apply prime_field_polynomial_zero_prefix_equivalent_empty - L151
exact hc0
27Establish henL152–161
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field polynomial zero prefix equivalent empty.
- L152
have hen : PolynomialEquivalent(CB,CC,K,0,0,0)Definitions: PolynomialEquivalent(CB,CC,K,0,0,0)Original native command in the exact edition - L153
specialize prime_field_polynomial_zero_prefix_equivalent_empty (CB) - L154
specialize prime_field_polynomial_zero_prefix_equivalent_empty (CC) - L155
specialize prime_field_polynomial_zero_prefix_equivalent_empty (K) - L156
apply prime_field_polynomial_zero_prefix_equivalent_empty - L157
exact hn0 - L158
specialize prime_field_polynomial_equivalent_transitive (cb) - L159
specialize prime_field_polynomial_equivalent_transitive (cc) - L160
specialize prime_field_polynomial_equivalent_transitive (N) - L161
specialize prime_field_polynomial_equivalent_transitive (0)
28Use earlier factsL162–171
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L162
specialize prime_field_polynomial_equivalent_transitive (0) - L163
specialize prime_field_polynomial_equivalent_transitive (0) - L164
specialize prime_field_polynomial_equivalent_transitive (CB) - L165
specialize prime_field_polynomial_equivalent_transitive (CC) - L166
specialize prime_field_polynomial_equivalent_transitive (K) - L167
apply prime_field_polynomial_equivalent_transitive - L168
exact hec - L169
specialize prime_field_polynomial_equivalent_symmetric (CB) - L170
specialize prime_field_polynomial_equivalent_symmetric (CC) - L171
specialize prime_field_polynomial_equivalent_symmetric (K)
29Use earlier factsL172–176
Instantiate or apply named facts and discharge the corresponding proof obligations.
30Establish hdL177–186
Establish this local claim before using it. It is not an additional assumption.
- L177
have hd : K = t + N ∧ PolynomialLeftPad(cb,cc,N,t,CB,CC)Definitions: PolynomialLeftPad(cb,cc,N,t,CB,CC)Original native command in the exact edition - L178
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (p) - L179
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (ab) - L180
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (ac) - L181
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (L) - L182
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (bb) - L183
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (bc) - L184
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (M) - L185
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (cb) - L186
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (cc)
31Use earlier factsL187–196
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L187
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (N) - L188
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (BB) - L189
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (BC) - L190
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (t) - L191
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (CB) - L192
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (CC) - L193
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (K) - L194
apply prime_field_polynomial_convolution_left_padding_nonempty_right - L195
exact hp - L196
exact hL_right
32Use earlier factsL197–200
33Separate the logical casesL201–201
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L201
cases hd
34Calculate and transport equalitiesL202–203
35Use earlier factsL204–211
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L204
specialize prime_field_polynomial_left_pad_equivalent (cb) - L205
specialize prime_field_polynomial_left_pad_equivalent (cc) - L206
specialize prime_field_polynomial_left_pad_equivalent (N) - L207
specialize prime_field_polynomial_left_pad_equivalent (t) - L208
specialize prime_field_polynomial_left_pad_equivalent (CB) - L209
specialize prime_field_polynomial_left_pad_equivalent (CC) - L210
apply prime_field_polynomial_left_pad_equivalent - L211
exact hd_right
Original defined command ledger · 211 lines
- 0001
intro p - 0002
intro ab - 0003
intro ac - 0004
intro L - 0005
intro bb - 0006
intro bc - 0007
intro M - 0008
intro cb - 0009
intro cc - 0010
intro N - 0011
intro BB - 0012
intro BC - 0013
intro t - 0014
intro CB - 0015
intro CC - 0016
intro K - 0017
intro hp - 0018
intro hpad - 0019
intro hc - 0020
intro hn - 0021
have hL : L=0 \/ ~(L=0) - 0022
specialize eq_decidable (L) - 0023
specialize eq_decidable (0) - 0024
apply eq_decidable - 0025
cases hL - 0026
have hz : Repeat(ab,ac,0,L) - 0027
intro j - 0028
intro hj - 0029
rewrite hL_left at hj - 0030
exfalso - 0031
specialize matrix_rank_no_index_below_zero (j) - 0032
apply matrix_rank_no_index_below_zero - 0033
exact hj - 0034
have hc0 : Repeat(cb,cc,0,N) - 0035
specialize prime_field_polynomial_convolution_zero_left (p) - 0036
specialize prime_field_polynomial_convolution_zero_left (ab) - 0037
specialize prime_field_polynomial_convolution_zero_left (ac) - 0038
specialize prime_field_polynomial_convolution_zero_left (L) - 0039
specialize prime_field_polynomial_convolution_zero_left (bb) - 0040
specialize prime_field_polynomial_convolution_zero_left (bc) - 0041
specialize prime_field_polynomial_convolution_zero_left (M) - 0042
specialize prime_field_polynomial_convolution_zero_left (cb) - 0043
specialize prime_field_polynomial_convolution_zero_left (cc) - 0044
specialize prime_field_polynomial_convolution_zero_left (N) - 0045
apply prime_field_polynomial_convolution_zero_left - 0046
exact hp - 0047
exact hz - 0048
exact hc - 0049
have hn0 : Repeat(CB,CC,0,K) - 0050
specialize prime_field_polynomial_convolution_zero_left (p) - 0051
specialize prime_field_polynomial_convolution_zero_left (ab) - 0052
specialize prime_field_polynomial_convolution_zero_left (ac) - 0053
specialize prime_field_polynomial_convolution_zero_left (L) - 0054
specialize prime_field_polynomial_convolution_zero_left (BB) - 0055
specialize prime_field_polynomial_convolution_zero_left (BC) - 0056
specialize prime_field_polynomial_convolution_zero_left (t+M) - 0057
specialize prime_field_polynomial_convolution_zero_left (CB) - 0058
specialize prime_field_polynomial_convolution_zero_left (CC) - 0059
specialize prime_field_polynomial_convolution_zero_left (K) - 0060
apply prime_field_polynomial_convolution_zero_left - 0061
exact hp - 0062
exact hz - 0063
exact hn - 0064
have hec : PolynomialEquivalent(cb,cc,N,0,0,0) - 0065
specialize prime_field_polynomial_zero_prefix_equivalent_empty (cb) - 0066
specialize prime_field_polynomial_zero_prefix_equivalent_empty (cc) - 0067
specialize prime_field_polynomial_zero_prefix_equivalent_empty (N) - 0068
apply prime_field_polynomial_zero_prefix_equivalent_empty - 0069
exact hc0 - 0070
have hen : PolynomialEquivalent(CB,CC,K,0,0,0) - 0071
specialize prime_field_polynomial_zero_prefix_equivalent_empty (CB) - 0072
specialize prime_field_polynomial_zero_prefix_equivalent_empty (CC) - 0073
specialize prime_field_polynomial_zero_prefix_equivalent_empty (K) - 0074
apply prime_field_polynomial_zero_prefix_equivalent_empty - 0075
exact hn0 - 0076
specialize prime_field_polynomial_equivalent_transitive (cb) - 0077
specialize prime_field_polynomial_equivalent_transitive (cc) - 0078
specialize prime_field_polynomial_equivalent_transitive (N) - 0079
specialize prime_field_polynomial_equivalent_transitive (0) - 0080
specialize prime_field_polynomial_equivalent_transitive (0) - 0081
specialize prime_field_polynomial_equivalent_transitive (0) - 0082
specialize prime_field_polynomial_equivalent_transitive (CB) - 0083
specialize prime_field_polynomial_equivalent_transitive (CC) - 0084
specialize prime_field_polynomial_equivalent_transitive (K) - 0085
apply prime_field_polynomial_equivalent_transitive - 0086
exact hec - 0087
specialize prime_field_polynomial_equivalent_symmetric (CB) - 0088
specialize prime_field_polynomial_equivalent_symmetric (CC) - 0089
specialize prime_field_polynomial_equivalent_symmetric (K) - 0090
specialize prime_field_polynomial_equivalent_symmetric (0) - 0091
specialize prime_field_polynomial_equivalent_symmetric (0) - 0092
specialize prime_field_polynomial_equivalent_symmetric (0) - 0093
apply prime_field_polynomial_equivalent_symmetric - 0094
exact hen - 0095
have hM : M=0 \/ ~(M=0) - 0096
specialize eq_decidable (M) - 0097
specialize eq_decidable (0) - 0098
apply eq_decidable - 0099
cases hM - 0100
have hz : Repeat(bb,bc,0,M) - 0101
intro j - 0102
intro hj - 0103
rewrite hM_left at hj - 0104
exfalso - 0105
specialize matrix_rank_no_index_below_zero (j) - 0106
apply matrix_rank_no_index_below_zero - 0107
exact hj - 0108
have hc0 : Repeat(cb,cc,0,N) - 0109
specialize prime_field_polynomial_convolution_zero_right (p) - 0110
specialize prime_field_polynomial_convolution_zero_right (ab) - 0111
specialize prime_field_polynomial_convolution_zero_right (ac) - 0112
specialize prime_field_polynomial_convolution_zero_right (L) - 0113
specialize prime_field_polynomial_convolution_zero_right (bb) - 0114
specialize prime_field_polynomial_convolution_zero_right (bc) - 0115
specialize prime_field_polynomial_convolution_zero_right (M) - 0116
specialize prime_field_polynomial_convolution_zero_right (cb) - 0117
specialize prime_field_polynomial_convolution_zero_right (cc) - 0118
specialize prime_field_polynomial_convolution_zero_right (N) - 0119
apply prime_field_polynomial_convolution_zero_right - 0120
exact hp - 0121
exact hz - 0122
exact hc - 0123
have hn0 : Repeat(CB,CC,0,K) - 0124
specialize prime_field_polynomial_convolution_zero_right (p) - 0125
specialize prime_field_polynomial_convolution_zero_right (ab) - 0126
specialize prime_field_polynomial_convolution_zero_right (ac) - 0127
specialize prime_field_polynomial_convolution_zero_right (L) - 0128
specialize prime_field_polynomial_convolution_zero_right (BB) - 0129
specialize prime_field_polynomial_convolution_zero_right (BC) - 0130
specialize prime_field_polynomial_convolution_zero_right (t+M) - 0131
specialize prime_field_polynomial_convolution_zero_right (CB) - 0132
specialize prime_field_polynomial_convolution_zero_right (CC) - 0133
specialize prime_field_polynomial_convolution_zero_right (K) - 0134
apply prime_field_polynomial_convolution_zero_right - 0135
exact hp - 0136
specialize polynomial_left_pad_zero_prefix (bb) - 0137
specialize polynomial_left_pad_zero_prefix (bc) - 0138
specialize polynomial_left_pad_zero_prefix (M) - 0139
specialize polynomial_left_pad_zero_prefix (t) - 0140
specialize polynomial_left_pad_zero_prefix (BB) - 0141
specialize polynomial_left_pad_zero_prefix (BC) - 0142
apply polynomial_left_pad_zero_prefix - 0143
exact hz - 0144
exact hpad - 0145
exact hn - 0146
have hec : PolynomialEquivalent(cb,cc,N,0,0,0) - 0147
specialize prime_field_polynomial_zero_prefix_equivalent_empty (cb) - 0148
specialize prime_field_polynomial_zero_prefix_equivalent_empty (cc) - 0149
specialize prime_field_polynomial_zero_prefix_equivalent_empty (N) - 0150
apply prime_field_polynomial_zero_prefix_equivalent_empty - 0151
exact hc0 - 0152
have hen : PolynomialEquivalent(CB,CC,K,0,0,0) - 0153
specialize prime_field_polynomial_zero_prefix_equivalent_empty (CB) - 0154
specialize prime_field_polynomial_zero_prefix_equivalent_empty (CC) - 0155
specialize prime_field_polynomial_zero_prefix_equivalent_empty (K) - 0156
apply prime_field_polynomial_zero_prefix_equivalent_empty - 0157
exact hn0 - 0158
specialize prime_field_polynomial_equivalent_transitive (cb) - 0159
specialize prime_field_polynomial_equivalent_transitive (cc) - 0160
specialize prime_field_polynomial_equivalent_transitive (N) - 0161
specialize prime_field_polynomial_equivalent_transitive (0) - 0162
specialize prime_field_polynomial_equivalent_transitive (0) - 0163
specialize prime_field_polynomial_equivalent_transitive (0) - 0164
specialize prime_field_polynomial_equivalent_transitive (CB) - 0165
specialize prime_field_polynomial_equivalent_transitive (CC) - 0166
specialize prime_field_polynomial_equivalent_transitive (K) - 0167
apply prime_field_polynomial_equivalent_transitive - 0168
exact hec - 0169
specialize prime_field_polynomial_equivalent_symmetric (CB) - 0170
specialize prime_field_polynomial_equivalent_symmetric (CC) - 0171
specialize prime_field_polynomial_equivalent_symmetric (K) - 0172
specialize prime_field_polynomial_equivalent_symmetric (0) - 0173
specialize prime_field_polynomial_equivalent_symmetric (0) - 0174
specialize prime_field_polynomial_equivalent_symmetric (0) - 0175
apply prime_field_polynomial_equivalent_symmetric - 0176
exact hen - 0177
have hd : K = t + N ∧ PolynomialLeftPad(cb,cc,N,t,CB,CC) - 0178
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (p) - 0179
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (ab) - 0180
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (ac) - 0181
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (L) - 0182
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (bb) - 0183
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (bc) - 0184
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (M) - 0185
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (cb) - 0186
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (cc) - 0187
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (N) - 0188
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (BB) - 0189
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (BC) - 0190
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (t) - 0191
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (CB) - 0192
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (CC) - 0193
specialize prime_field_polynomial_convolution_left_padding_nonempty_right (K) - 0194
apply prime_field_polynomial_convolution_left_padding_nonempty_right - 0195
exact hp - 0196
exact hL_right - 0197
exact hM_right - 0198
exact hpad - 0199
exact hc - 0200
exact hn - 0201
cases hd - 0202
rewrite hd_left - 0203
rewrite hd_left - 0204
specialize prime_field_polynomial_left_pad_equivalent (cb) - 0205
specialize prime_field_polynomial_left_pad_equivalent (cc) - 0206
specialize prime_field_polynomial_left_pad_equivalent (N) - 0207
specialize prime_field_polynomial_left_pad_equivalent (t) - 0208
specialize prime_field_polynomial_left_pad_equivalent (CB) - 0209
specialize prime_field_polynomial_left_pad_equivalent (CC) - 0210
apply prime_field_polynomial_left_pad_equivalent - 0211
exact hd_right