| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ismon1p | Structured version Visualization version GIF version | ||
| Description: Being a monic polynomial. (Contributed by Stefan O'Rear, 28-Mar-2015.) |
| Ref | Expression |
|---|---|
| uc1pval.p | ⊢ 𝑃 = (Poly1‘𝑅) |
| uc1pval.b | ⊢ 𝐵 = (Base‘𝑃) |
| uc1pval.z | ⊢ 0 = (0g‘𝑃) |
| uc1pval.d | ⊢ 𝐷 = (deg1‘𝑅) |
| mon1pval.m | ⊢ 𝑀 = (Monic1p‘𝑅) |
| mon1pval.o | ⊢ 1 = (1r‘𝑅) |
| Ref | Expression |
|---|---|
| ismon1p | ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | neeq1 3020 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓 ≠ 0 ↔ 𝐹 ≠ 0 )) | |
| 2 | fveq2 6881 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (coe1‘𝑓) = (coe1‘𝐹)) | |
| 3 | fveq2 6881 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝐷‘𝑓) = (𝐷‘𝐹)) | |
| 4 | 2, 3 | fveq12d 6888 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((coe1‘𝑓)‘(𝐷‘𝑓)) = ((coe1‘𝐹)‘(𝐷‘𝐹))) |
| 5 | 4 | eqeq1d 2765 | . . . 4 ⊢ (𝑓 = 𝐹 → (((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 ↔ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
| 6 | 1, 5 | anbi12d 643 | . . 3 ⊢ (𝑓 = 𝐹 → ((𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 ) ↔ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) |
| 7 | uc1pval.p | . . . 4 ⊢ 𝑃 = (Poly1‘𝑅) | |
| 8 | uc1pval.b | . . . 4 ⊢ 𝐵 = (Base‘𝑃) | |
| 9 | uc1pval.z | . . . 4 ⊢ 0 = (0g‘𝑃) | |
| 10 | uc1pval.d | . . . 4 ⊢ 𝐷 = (deg1‘𝑅) | |
| 11 | mon1pval.m | . . . 4 ⊢ 𝑀 = (Monic1p‘𝑅) | |
| 12 | mon1pval.o | . . . 4 ⊢ 1 = (1r‘𝑅) | |
| 13 | 7, 8, 9, 10, 11, 12 | mon1pval 26299 | . . 3 ⊢ 𝑀 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 )} |
| 14 | 6, 13 | elrab2 3654 | . 2 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) |
| 15 | 3anass 1111 | . 2 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ) ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) | |
| 16 | 14, 15 | bitr4i 281 | 1 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ‘cfv 6536 Basecbs 17264 0gc0g 17487 1rcur 20258 Poly1cpl1 22337 coe1cco1 22338 deg1cdg1 26211 Monic1pcmn1 26283 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-1cn 11153 ax-addcl 11155 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-nn 12229 df-slot 17237 df-ndx 17249 df-base 17265 df-mon1 26288 |
| This theorem is referenced by: mon1pcl 26302 mon1pn0 26304 mon1pldg 26307 uc1pmon1p 26309 mon1pid 26311 ply1remlem 26322 0ringmon1p 33847 ressply1mon1p 33858 rtelextdg2lem 34116 2sqr3minply 34170 cos9thpiminply 34178 mon1psubm 43946 |
| Copyright terms: Public domain | W3C validator |