| 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 4352 | . . 3 ⊢ ∅ ⊆ (Poly‘ℂ) | |
| 2 | sseq1 3937 | . . 3 ⊢ ((Poly‘𝑆) = ∅ → ((Poly‘𝑆) ⊆ (Poly‘ℂ) ↔ ∅ ⊆ (Poly‘ℂ))) | |
| 3 | 1, 2 | mpbiri 261 | . 2 ⊢ ((Poly‘𝑆) = ∅ → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 4 | n0 4302 | . . 3 ⊢ ((Poly‘𝑆) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (Poly‘𝑆)) | |
| 5 | plybss 26569 | . . . . 5 ⊢ (𝑓 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ) | |
| 6 | ssid 3934 | . . . . 5 ⊢ ℂ ⊆ ℂ | |
| 7 | plyss 26574 | . . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ ℂ ⊆ ℂ) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) | |
| 8 | 5, 6, 7 | sylancl 598 | . . . 4 ⊢ (𝑓 ∈ (Poly‘𝑆) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 9 | 8 | exlimiv 1967 | . . 3 ⊢ (∃𝑓 𝑓 ∈ (Poly‘𝑆) → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 10 | 4, 9 | sylbi 220 | . 2 ⊢ ((Poly‘𝑆) ≠ ∅ → (Poly‘𝑆) ⊆ (Poly‘ℂ)) |
| 11 | 3, 10 | pm2.61ine 3045 | 1 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1572 ∃wex 1814 ∈ wcel 2150 ≠ wne 2962 ⊆ wss 3899 ∅c0 4280 ‘cfv 6565 ℂcc 11236 Polycply 26559 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-1cn 11296 ax-addcl 11298 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-map 8886 df-nn 12375 df-n0 12646 df-ply 26563 |
| This theorem is used by: plyaddcl 26596 plymulcl 26597 plysubcl 26598 coeval 26599 coeeu 26601 dgrval 26604 coef3 26608 coeidlem 26613 coemulc 26631 coesub 26633 dgrmulc 26647 dgrsub 26648 dgrcolem1 26649 dgrcolem2 26650 dgrco 26651 coecj 26654 dvply2 26664 dvnply 26666 quotval 26670 quotlem 26678 quotcl2 26680 quotdgr 26681 plyrem 26683 facth 26684 fta1 26686 rnplynfin 26687 quotcan 26689 vieta1lem1 26690 vieta1 26692 plyexmo 26693 ftalem7 27465 dgrsub2 44401 |
| Copyright terms: Public domain | W3C validator |