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 3005 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓 ≠ 0 ↔ 𝐹 ≠ 0 )) | |
2 | fveq2 6756 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (coe1‘𝑓) = (coe1‘𝐹)) | |
3 | fveq2 6756 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝐷‘𝑓) = (𝐷‘𝐹)) | |
4 | 2, 3 | fveq12d 6763 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((coe1‘𝑓)‘(𝐷‘𝑓)) = ((coe1‘𝐹)‘(𝐷‘𝐹))) |
5 | 4 | eqeq1d 2740 | . . . 4 ⊢ (𝑓 = 𝐹 → (((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 ↔ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
6 | 1, 5 | anbi12d 630 | . . 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 25211 | . . 3 ⊢ 𝑀 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 )} |
14 | 6, 13 | elrab2 3620 | . 2 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) |
15 | 3anass 1093 | . 2 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ) ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) | |
16 | 14, 15 | bitr4i 277 | 1 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ‘cfv 6418 Basecbs 16840 0gc0g 17067 1rcur 19652 Poly1cpl1 21258 coe1cco1 21259 deg1 cdg1 25121 Monic1pcmn1 25195 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-1cn 10860 ax-addcl 10862 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-nn 11904 df-slot 16811 df-ndx 16823 df-base 16841 df-mon1 25200 |
This theorem is referenced by: mon1pcl 25214 mon1pn0 25216 mon1pldg 25219 uc1pmon1p 25221 ply1remlem 25232 mon1pid 40946 mon1psubm 40947 |
Copyright terms: Public domain | W3C validator |