| 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 2763 | . . 3 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
| 2 | mvrcl.v | . . 3 ⊢ 𝑉 = (𝐼 mVar 𝑅) | |
| 3 | eqid 2763 | . . 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 22349 | . 2 ⊢ (𝜑 → (𝑉‘𝑋) ∈ (Base‘(𝐼 mPwSer 𝑅))) |
| 8 | fvexd 6931 | . . 3 ⊢ (𝜑 → (𝑉‘𝑋) ∈ V) | |
| 9 | eqid 2763 | . . . . 5 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 10 | eqid 2763 | . . . . 5 ⊢ {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} | |
| 11 | 1, 9, 10, 3, 7 | psrelbas 22298 | . . . 4 ⊢ (𝜑 → (𝑉‘𝑋):{𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}⟶(Base‘𝑅)) |
| 12 | 11 | ffund 6744 | . . 3 ⊢ (𝜑 → Fun (𝑉‘𝑋)) |
| 13 | fvexd 6931 | . . 3 ⊢ (𝜑 → (0g‘𝑅) ∈ V) | |
| 14 | snfi 9109 | . . . 4 ⊢ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))} ∈ Fin | |
| 15 | 14 | a1i 11 | . . 3 ⊢ (𝜑 → {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))} ∈ Fin) |
| 16 | eqid 2763 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 17 | eqid 2763 | . . . . . 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 4750 | . . . . . . . 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 22345 | . . . . 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 2964 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → ¬ 𝑥 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 27 | 26 | iffalsed 4496 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → if(𝑥 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), (1r‘𝑅), (0g‘𝑅)) = (0g‘𝑅)) |
| 28 | 24, 27 | eqtrd 2798 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} ∖ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → ((𝑉‘𝑋)‘𝑥) = (0g‘𝑅)) |
| 29 | 11, 28 | suppss 8249 | . . 3 ⊢ (𝜑 → ((𝑉‘𝑋) supp (0g‘𝑅)) ⊆ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))}) |
| 30 | suppssfifsupp 9409 | . . 3 ⊢ ((((𝑉‘𝑋) ∈ V ∧ Fun (𝑉‘𝑋) ∧ (0g‘𝑅) ∈ V) ∧ ({(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))} ∈ Fin ∧ ((𝑉‘𝑋) supp (0g‘𝑅)) ⊆ {(𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))})) → (𝑉‘𝑋) finSupp (0g‘𝑅)) | |
| 31 | 8, 12, 13, 15, 29, 30 | syl32anc 1406 | . 2 ⊢ (𝜑 → (𝑉‘𝑋) finSupp (0g‘𝑅)) |
| 32 | mvrcl.s | . . 3 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
| 33 | mvrcl.b | . . 3 ⊢ 𝐵 = (Base‘𝑃) | |
| 34 | 32, 1, 3, 16, 33 | mplelbas 22353 | . 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 2147 ≠ wne 2959 {crab 3416 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 ifcif 4485 {csn 4588 class class class wbr 5108 ↦ cmpt 5192 ◡ccnv 5657 “ cima 5661 Fun wfun 6560 ‘cfv 6566 (class class class)co 7451 supp csupp 8214 ↑m cmap 8885 Fincfn 9011 finSupp cfsupp 9391 0cc0 11239 1c1 11240 ℕcn 12375 ℕ0cn0 12646 Basecbs 17431 0gc0g 17660 1rcur 20458 Ringcrg 20510 mPwSer cmps 22267 mVar cmvr 22268 mPoly cmpl 22269 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 df-om 7912 df-1st 8035 df-2nd 8036 df-supp 8215 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-fsupp 9392 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-struct 17369 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-sca 17489 df-vsca 17490 df-tset 17492 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-mgp 20412 df-ur 20459 df-ring 20512 df-psr 22272 df-mvr 22273 df-mpl 22274 |
| This theorem is used by: mvrf2 22355 subrgmvrf 22398 mplcoe3 22402 mplcoe5lem 22403 mplcoe5 22404 mplcoe2 22405 mplbas2 22406 evlsvarpw 22463 mpfproj 22474 mpfind 22479 evlsvarval 22491 selvcllem5 22503 mhpvarcl 22524 vr1cl 22590 selvascl 34260 mplmulmvr 34282 evlvarval 34284 esplyind 34318 |
| Copyright terms: Public domain | W3C validator |