| 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 3022 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓 ≠ 0 ↔ 𝐹 ≠ 0 )) | |
| 2 | fveq2 6885 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (coe1‘𝑓) = (coe1‘𝐹)) | |
| 3 | fveq2 6885 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝐷‘𝑓) = (𝐷‘𝐹)) | |
| 4 | 2, 3 | fveq12d 6892 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((coe1‘𝑓)‘(𝐷‘𝑓)) = ((coe1‘𝐹)‘(𝐷‘𝐹))) |
| 5 | 4 | eqeq1d 2767 | . . . 4 ⊢ (𝑓 = 𝐹 → (((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 ↔ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
| 6 | 1, 5 | anbi12d 644 | . . 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 26352 | . . 3 ⊢ 𝑀 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 )} |
| 14 | 6, 13 | elrab2 3656 | . 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 |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 ‘cfv 6540 Basecbs 17293 0gc0g 17516 1rcur 20309 Poly1cpl1 22389 coe1cco1 22390 deg1cdg1 26264 Monic1pcmn1 26336 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-1cn 11175 ax-addcl 11177 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-nn 12251 df-slot 17266 df-ndx 17278 df-base 17294 df-mon1 26341 |
| This theorem is used by: mon1pcl 26355 mon1pn0 26357 mon1pldg 26360 uc1pmon1p 26362 mon1pid 26364 ply1remlem 26375 0ringmon1p 33913 ressply1mon1p 33924 rtelextdg2lem 34182 2sqr3minply 34236 cos9thpiminply 34244 mon1psubm 43986 |
| Copyright terms: Public domain | W3C validator |