| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mvrcl | Structured version Visualization version GIF version | ||
| Description: A power series variable is a polynomial. (Contributed by Mario Carneiro, 9-Jan-2015.) |
| Ref | Expression |
|---|---|
| mvrcl.s | ⊢ 𝑃 = (𝐼 mPoly 𝑅) |
| mvrcl.v | ⊢ 𝑉 = (𝐼 mVar 𝑅) |
| mvrcl.b | ⊢ 𝐵 = (Base‘𝑃) |
| mvrcl.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| mvrcl.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| mvrcl.x | ⊢ (𝜑 → 𝑋 ∈ 𝐼) |
| Ref | Expression |
|---|---|
| mvrcl | ⊢ (𝜑 → (𝑉‘𝑋) ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . . 3 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
| 2 | mvrcl.v | . . 3 ⊢ 𝑉 = (𝐼 mVar 𝑅) | |
| 3 | eqid 2761 | . . 3 ⊢ (Base‘(𝐼 mPwSer 𝑅)) = (Base‘(𝐼 mPwSer 𝑅)) | |
| 4 | mvrcl.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 5 | mvrcl.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 6 | mvrcl.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
| 7 | 1, 2, 3, 4, 5, 6 | mvrcl2 22287 | . 2 ⊢ (𝜑 → (𝑉‘𝑋) ∈ (Base‘(𝐼 mPwSer 𝑅))) |
| 8 | fvexd 6898 | . . 3 ⊢ (𝜑 → (𝑉‘𝑋) ∈ V) | |
| 9 | eqid 2761 | . . . . 5 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 10 | eqid 2761 | . . . . 5 ⊢ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} | |
| 11 | 1, 9, 10, 3, 7 | psrelbas 22236 | . . . 4 ⊢ (𝜑 → (𝑉‘𝑋):{𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝑅)) |
| 12 | 11 | ffund 6712 | . . 3 ⊢ (𝜑 → Fun (𝑉‘𝑋)) |
| 13 | fvexd 6898 | . . 3 ⊢ (𝜑 → (0g‘𝑅) ∈ V) | |
| 14 | snfi 9064 | . . . 4 ⊢ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))} ∈ Fin | |
| 15 | 14 | a1i 11 | . . 3 ⊢ (𝜑 → {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))} ∈ Fin) |
| 16 | eqid 2761 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 17 | eqid 2761 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 18 | 4 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → 𝐼 ∈ 𝑊) |
| 19 | 5 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → 𝑅 ∈ Ring) |
| 20 | 6 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → 𝑋 ∈ 𝐼) |
| 21 | eldifsn 4748 | . . . . . . . 8 ⊢ (𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))}) ↔ (𝑥 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∧ 𝑥 ≠ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) | |
| 22 | 21 | bilani 510 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → (𝑥 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∧ 𝑥 ≠ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) |
| 23 | 22 | simpld 500 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → 𝑥 ∈ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}) |
| 24 | 2, 10, 16, 17, 18, 19, 20, 23 | mvrval2 22283 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → ((𝑉‘𝑋)‘𝑥) = if(𝑥 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), (1r‘𝑅), (0g‘𝑅))) |
| 25 | 22 | simprd 501 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → 𝑥 ≠ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 26 | 25 | neneqd 2961 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → ¬ 𝑥 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 27 | 26 | iffalsed 4493 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → if(𝑥 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), (1r‘𝑅), (0g‘𝑅)) = (0g‘𝑅)) |
| 28 | 24, 27 | eqtrd 2796 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → ((𝑉‘𝑋)‘𝑥) = (0g‘𝑅)) |
| 29 | 11, 28 | suppss 8204 | . . 3 ⊢ (𝜑 → ((𝑉‘𝑋) supp (0g‘𝑅)) ⊆ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))}) |
| 30 | suppssfifsupp 9365 | . . 3 ⊢ ((((𝑉‘𝑋) ∈ V ∧ Fun (𝑉‘𝑋) ∧ (0g‘𝑅) ∈ V) ∧ ({(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))} ∈ Fin ∧ ((𝑉‘𝑋) supp (0g‘𝑅)) ⊆ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → (𝑉‘𝑋) finSupp (0g‘𝑅)) | |
| 31 | 8, 12, 13, 15, 29, 30 | syl32anc 1405 | . 2 ⊢ (𝜑 → (𝑉‘𝑋) finSupp (0g‘𝑅)) |
| 32 | mvrcl.s | . . 3 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
| 33 | mvrcl.b | . . 3 ⊢ 𝐵 = (Base‘𝑃) | |
| 34 | 32, 1, 3, 16, 33 | mplelbas 22291 | . 2 ⊢ ((𝑉‘𝑋) ∈ 𝐵 ↔ ((𝑉‘𝑋) ∈ (Base‘(𝐼 mPwSer 𝑅)) ∧ (𝑉‘𝑋) finSupp (0g‘𝑅))) |
| 35 | 7, 31, 34 | sylanbrc 595 | 1 ⊢ (𝜑 → (𝑉‘𝑋) ∈ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 {crab 3413 Vcvv 3451 ∖ cdif 3896 ⊆ wss 3899 ifcif 4482 {csn 4584 class class class wbr 5103 ↦ cmpt 5186 ◡ccnv 5650 “ cima 5654 Fun wfun 6531 ‘cfv 6537 (class class class)co 7418 supp csupp 8170 ↑m cmap 8840 Fincfn 8966 finSupp cfsupp 9346 0cc0 11193 1c1 11194 ℕcn 12328 ℕ0cn0 12599 Basecbs 17380 0gc0g 17603 1rcur 20400 Ringcrg 20452 mPwSer cmps 22205 mVar cmvr 22206 mPoly cmpl 22207 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-of 7691 df-om 7876 df-1st 7999 df-2nd 8000 df-supp 8171 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-er 8710 df-map 8842 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-fsupp 9347 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-3 12399 df-4 12400 df-5 12401 df-6 12402 df-7 12403 df-8 12404 df-9 12405 df-n0 12600 df-z 12687 df-uz 12959 df-fz 13633 df-struct 17318 df-sets 17335 df-slot 17353 df-ndx 17365 df-base 17381 df-ress 17402 df-plusg 17434 df-mulr 17435 df-sca 17437 df-vsca 17438 df-tset 17440 df-0g 17605 df-mgm 18809 df-sgrp 18901 df-mnd 18917 df-grp 19140 df-mgp 20354 df-ur 20401 df-ring 20454 df-psr 22210 df-mvr 22211 df-mpl 22212 |
| This theorem is used by: mvrf2 22293 subrgmvrf 22336 mplcoe3 22340 mplcoe5lem 22341 mplcoe5 22342 mplcoe2 22343 mplbas2 22344 evlsvarpw 22401 mpfproj 22412 mpfind 22417 evlsvarval 22429 selvcllem5 22441 mhpvarcl 22462 vr1cl 22528 selvascl 34142 mplmulmvr 34164 evlvarval 34166 esplyind 34200 |
| Copyright terms: Public domain | W3C validator |