![]() |
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 3045 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓 ≠ 0 ↔ 𝐹 ≠ 0 )) | |
2 | fveq2 6541 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (coe1‘𝑓) = (coe1‘𝐹)) | |
3 | fveq2 6541 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝐷‘𝑓) = (𝐷‘𝐹)) | |
4 | 2, 3 | fveq12d 6548 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((coe1‘𝑓)‘(𝐷‘𝑓)) = ((coe1‘𝐹)‘(𝐷‘𝐹))) |
5 | 4 | eqeq1d 2796 | . . . 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 24418 | . . 3 ⊢ 𝑀 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) = 1 )} |
14 | 6, 13 | elrab2 3620 | . 2 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) |
15 | 3anass 1088 | . 2 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ) ↔ (𝐹 ∈ 𝐵 ∧ (𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 ))) | |
16 | 14, 15 | bitr4i 279 | 1 ⊢ (𝐹 ∈ 𝑀 ↔ (𝐹 ∈ 𝐵 ∧ 𝐹 ≠ 0 ∧ ((coe1‘𝐹)‘(𝐷‘𝐹)) = 1 )) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 207 ∧ wa 396 ∧ w3a 1080 = wceq 1522 ∈ wcel 2080 ≠ wne 2983 ‘cfv 6228 Basecbs 16312 0gc0g 16542 1rcur 18941 Poly1cpl1 20028 coe1cco1 20029 deg1 cdg1 24331 Monic1pcmn1 24402 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1778 ax-4 1792 ax-5 1889 ax-6 1948 ax-7 1993 ax-8 2082 ax-9 2090 ax-10 2111 ax-11 2125 ax-12 2140 ax-13 2343 ax-ext 2768 ax-sep 5097 ax-nul 5104 ax-pow 5160 ax-pr 5224 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3an 1082 df-tru 1525 df-ex 1763 df-nf 1767 df-sb 2042 df-mo 2575 df-eu 2611 df-clab 2775 df-cleq 2787 df-clel 2862 df-nfc 2934 df-ne 2984 df-ral 3109 df-rex 3110 df-rab 3113 df-v 3438 df-sbc 3708 df-dif 3864 df-un 3866 df-in 3868 df-ss 3876 df-nul 4214 df-if 4384 df-sn 4475 df-pr 4477 df-op 4481 df-uni 4748 df-br 4965 df-opab 5027 df-mpt 5044 df-id 5351 df-xp 5452 df-rel 5453 df-cnv 5454 df-co 5455 df-dm 5456 df-iota 6192 df-fun 6230 df-fv 6236 df-slot 16316 df-base 16318 df-mon1 24407 |
This theorem is referenced by: mon1pcl 24421 mon1pn0 24423 mon1pldg 24426 uc1pmon1p 24428 ply1remlem 24439 mon1pid 39303 mon1psubm 39304 |
Copyright terms: Public domain | W3C validator |