| 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 3026 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓 ≠ 0 ↔ 𝐹 ≠ 0 )) | |
| 2 | fveq2 6882 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (coe1‘𝑓) = (coe1‘𝐹)) | |
| 3 | fveq2 6882 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝐷‘𝑓) = (𝐷‘𝐹)) | |
| 4 | 2, 3 | fveq12d 6889 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((coe1‘𝑓)‘(𝐷‘𝑓)) = ((coe1‘𝐹)‘(𝐷‘𝐹))) |
| 5 | 4 | eqeq1d 2771 | . . . 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 26268 | . . 3 ⊢ 𝑀 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 )} |
| 14 | 6, 13 | elrab2 3663 | . 2 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) |
| 15 | 3anass 1109 | . 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 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ‘cfv 6537 Basecbs 17269 0gc0g 17492 1rcur 20263 Poly1cpl1 22306 coe1cco1 22307 deg1cdg1 26180 Monic1pcmn1 26252 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-1cn 11158 ax-addcl 11160 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-nn 12234 df-slot 17242 df-ndx 17254 df-base 17270 df-mon1 26257 |
| This theorem is referenced by: mon1pcl 26271 mon1pn0 26273 mon1pldg 26276 uc1pmon1p 26278 mon1pid 26280 ply1remlem 26291 0ringmon1p 33792 ressply1mon1p 33803 rtelextdg2lem 34061 2sqr3minply 34115 cos9thpiminply 34123 mon1psubm 43818 |
| Copyright terms: Public domain | W3C validator |