| 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 2994 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓 ≠ 0 ↔ 𝐹 ≠ 0 )) | |
| 2 | fveq2 6840 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (coe1‘𝑓) = (coe1‘𝐹)) | |
| 3 | fveq2 6840 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝐷‘𝑓) = (𝐷‘𝐹)) | |
| 4 | 2, 3 | fveq12d 6847 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((coe1‘𝑓)‘(𝐷‘𝑓)) = ((coe1‘𝐹)‘(𝐷‘𝐹))) |
| 5 | 4 | eqeq1d 2738 | . . . 4 ⊢ (𝑓 = 𝐹 → (((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 ↔ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
| 6 | 1, 5 | anbi12d 633 | . . 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 26107 | . . 3 ⊢ 𝑀 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 )} |
| 14 | 6, 13 | elrab2 3637 | . 2 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) |
| 15 | 3anass 1095 | . 2 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ) ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) | |
| 16 | 14, 15 | bitr4i 278 | 1 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ‘cfv 6498 Basecbs 17179 0gc0g 17402 1rcur 20162 Poly1cpl1 22140 coe1cco1 22141 deg1cdg1 26019 Monic1pcmn1 26091 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-1cn 11096 ax-addcl 11098 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-nn 12175 df-slot 17152 df-ndx 17164 df-base 17180 df-mon1 26096 |
| This theorem is referenced by: mon1pcl 26110 mon1pn0 26112 mon1pldg 26115 uc1pmon1p 26117 mon1pid 26119 ply1remlem 26130 0ringmon1p 33617 ressply1mon1p 33628 rtelextdg2lem 33870 2sqr3minply 33924 cos9thpiminply 33932 mon1psubm 43627 |
| Copyright terms: Public domain | W3C validator |