| 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 4351 | . . 3 ⊢ ∅ ⊆ (Poly‘ℂ) | |
| 2 | sseq1 3958 | . . 3 ⊢ ((Poly‘𝑆) = ∅ → ((Poly‘𝑆) ⊆ (Poly‘ℂ) ↔ ∅ ⊆ (Poly‘ℂ))) | |
| 3 | 1, 2 | mpbiri 258 | . 2 ⊢ ((Poly‘𝑆) = ∅ → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 4 | n0 4304 | . . 3 ⊢ ((Poly‘𝑆) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (Poly‘𝑆)) | |
| 5 | plybss 26157 | . . . . 5 ⊢ (𝑓 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ) | |
| 6 | ssid 3955 | . . . . 5 ⊢ ℂ ⊆ ℂ | |
| 7 | plyss 26162 | . . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ ℂ ⊆ ℂ) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) | |
| 8 | 5, 6, 7 | sylancl 587 | . . . 4 ⊢ (𝑓 ∈ (Poly‘𝑆) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 9 | 8 | exlimiv 1932 | . . 3 ⊢ (∃𝑓 𝑓 ∈ (Poly‘𝑆) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 10 | 4, 9 | sylbi 217 | . 2 ⊢ ((Poly‘𝑆) ≠ ∅ → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 11 | 3, 10 | pm2.61ine 3014 | 1 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∃wex 1781 ∈ wcel 2114 ≠ wne 2931 ⊆ wss 3900 ∅c0 4284 ‘cfv 6491 ℂcc 11026 Polycply 26147 |
| 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 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-cnex 11084 ax-1cn 11086 ax-addcl 11088 |
| 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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-map 8767 df-nn 12148 df-n0 12404 df-ply 26151 |
| This theorem is referenced by: plyaddcl 26183 plymulcl 26184 plysubcl 26185 coeval 26186 coeeu 26188 dgrval 26191 coef3 26195 coeidlem 26200 coemulc 26218 coesub 26220 dgrmulc 26235 dgrsub 26236 dgrcolem1 26237 dgrcolem2 26238 dgrco 26239 coecj 26242 coecjOLD 26244 dvply2 26252 dvnply 26254 quotval 26258 quotlem 26266 quotcl2 26268 quotdgr 26269 plyrem 26271 facth 26272 fta1 26274 quotcan 26275 vieta1lem1 26276 vieta1 26278 plyexmo 26279 ftalem7 27047 dgrsub2 43414 |
| Copyright terms: Public domain | W3C validator |