| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > plyssc | Structured version Visualization version GIF version | ||
| Description: Every polynomial ring is contained in the ring of polynomials over ℂ. (Contributed by Mario Carneiro, 22-Jul-2014.) |
| Ref | Expression |
|---|---|
| plyssc | ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ss 4356 | . . 3 ⊢ ∅ ⊆ (Poly‘ℂ) | |
| 2 | sseq1 3961 | . . 3 ⊢ ((Poly‘𝑆) = ∅ → ((Poly‘𝑆) ⊆ (Poly‘ℂ) ↔ ∅ ⊆ (Poly‘ℂ))) | |
| 3 | 1, 2 | mpbiri 261 | . 2 ⊢ ((Poly‘𝑆) = ∅ → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 4 | n0 4306 | . . 3 ⊢ ((Poly‘𝑆) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (Poly‘𝑆)) | |
| 5 | plybss 26362 | . . . . 5 ⊢ (𝑓 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ) | |
| 6 | ssid 3958 | . . . . 5 ⊢ ℂ ⊆ ℂ | |
| 7 | plyss 26367 | . . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ ℂ ⊆ ℂ) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) | |
| 8 | 5, 6, 7 | sylancl 597 | . . . 4 ⊢ (𝑓 ∈ (Poly‘𝑆) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 9 | 8 | exlimiv 1959 | . . 3 ⊢ (∃𝑓 𝑓 ∈ (Poly‘𝑆) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 10 | 4, 9 | sylbi 220 | . 2 ⊢ ((Poly‘𝑆) ≠ ∅ → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 11 | 3, 10 | pm2.61ine 3040 | 1 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∃wex 1808 ∈ wcel 2142 ≠ wne 2957 ⊆ wss 3904 ∅c0 4285 ‘cfv 6536 ℂcc 11104 Polycply 26352 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-1cn 11164 ax-addcl 11166 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-map 8824 df-nn 12240 df-n0 12511 df-ply 26356 |
| This theorem is used by: plyaddcl 26388 plymulcl 26389 plysubcl 26390 coeval 26391 coeeu 26393 dgrval 26396 coef3 26400 coeidlem 26405 coemulc 26423 coesub 26425 dgrmulc 26439 dgrsub 26440 dgrcolem1 26441 dgrcolem2 26442 dgrco 26443 coecj 26446 coecjOLD 26448 dvply2 26458 dvnply 26460 quotval 26464 quotlem 26472 quotcl2 26474 quotdgr 26475 plyrem 26477 facth 26478 fta1 26480 quotcan 26481 vieta1lem1 26482 vieta1 26484 plyexmo 26485 ftalem7 27254 dgrsub2 43890 |
| Copyright terms: Public domain | W3C validator |