| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mpl0fi | GIF version | ||
| Description: The zero polynomial. (Contributed by Mario Carneiro, 9-Jan-2015.) |
| Ref | Expression |
|---|---|
| mpl0.p | ⊢ 𝑃 = (𝐼 mPoly 𝑅) |
| mpl0.o | ⊢ 𝑂 = (0g‘𝑅) |
| mpl0.z | ⊢ 0 = (0g‘𝑃) |
| mpl0fi.i | ⊢ (𝜑 → 𝐼 ∈ Fin) |
| mpl0.r | ⊢ (𝜑 → 𝑅 ∈ Grp) |
| Ref | Expression |
|---|---|
| mpl0fi | ⊢ (𝜑 → 0 = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mpl0.z | . 2 ⊢ 0 = (0g‘𝑃) | |
| 2 | mpl0fi.i | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ Fin) | |
| 3 | mpl0.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Grp) | |
| 4 | mpl0.p | . . . . . 6 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
| 5 | eqid 2234 | . . . . . 6 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
| 6 | eqid 2234 | . . . . . 6 ⊢ (Base‘𝑃) = (Base‘𝑃) | |
| 7 | 4, 5, 6 | mplval2g 14899 | . . . . 5 ⊢ ((𝐼 ∈ Fin ∧ 𝑅 ∈ Grp) → 𝑃 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃))) |
| 8 | 2, 3, 7 | syl2anc 411 | . . . 4 ⊢ (𝜑 → 𝑃 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃))) |
| 9 | 8 | fveq2d 5676 | . . 3 ⊢ (𝜑 → (0g‘𝑃) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 10 | 5, 4, 6, 2, 3 | mplsubgfi 14905 | . . . 4 ⊢ (𝜑 → (Base‘𝑃) ∈ (SubGrp‘(𝐼 mPwSer 𝑅))) |
| 11 | eqid 2234 | . . . . 5 ⊢ ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)) = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)) | |
| 12 | eqid 2234 | . . . . 5 ⊢ (0g‘(𝐼 mPwSer 𝑅)) = (0g‘(𝐼 mPwSer 𝑅)) | |
| 13 | 11, 12 | subg0 13918 | . . . 4 ⊢ ((Base‘𝑃) ∈ (SubGrp‘(𝐼 mPwSer 𝑅)) → (0g‘(𝐼 mPwSer 𝑅)) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 14 | 10, 13 | syl 14 | . . 3 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 15 | eqid 2234 | . . . . . 6 ⊢ {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} | |
| 16 | mpl0.o | . . . . . 6 ⊢ 𝑂 = (0g‘𝑅) | |
| 17 | 5, 2, 3, 15, 16, 12 | psr0 14890 | . . . . 5 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = ({𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} × {𝑂})) |
| 18 | 15 | psrbagfi 14872 | . . . . . . 7 ⊢ (𝐼 ∈ Fin → {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = (ℕ0 ↑𝑚 𝐼)) |
| 19 | 2, 18 | syl 14 | . . . . . 6 ⊢ (𝜑 → {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = (ℕ0 ↑𝑚 𝐼)) |
| 20 | 19 | xpeq1d 4774 | . . . . 5 ⊢ (𝜑 → ({𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} × {𝑂}) = ((ℕ0 ↑𝑚 𝐼) × {𝑂})) |
| 21 | 17, 20 | eqtrd 2267 | . . . 4 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = ((ℕ0 ↑𝑚 𝐼) × {𝑂})) |
| 22 | fconstmpt 4799 | . . . 4 ⊢ ((ℕ0 ↑𝑚 𝐼) × {𝑂}) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂) | |
| 23 | 21, 22 | eqtrdi 2283 | . . 3 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| 24 | 9, 14, 23 | 3eqtr2d 2273 | . 2 ⊢ (𝜑 → (0g‘𝑃) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| 25 | 1, 24 | eqtrid 2279 | 1 ⊢ (𝜑 → 0 = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 {crab 2526 {csn 3691 ↦ cmpt 4173 × cxp 4749 ◡ccnv 4750 “ cima 4754 ‘cfv 5354 (class class class)co 6052 ↑𝑚 cmap 6884 Fincfn 6977 ℕcn 9242 ℕ0cn0 9501 Basecbs 13233 ↾s cress 13234 0gc0g 13490 Grpcgrp 13734 SubGrpcsubg 13905 mPwSer cmps 14858 mPoly cmpl 14859 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-addcom 8232 ax-mulcom 8233 ax-addass 8234 ax-mulass 8235 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-1rid 8239 ax-0id 8240 ax-rnegex 8241 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-apti 8247 ax-pre-ltadd 8248 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-tp 3699 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-of 6268 df-1st 6336 df-2nd 6337 df-1o 6649 df-er 6769 df-map 6886 df-ixp 6936 df-en 6978 df-fin 6980 df-sup 7277 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-inn 9243 df-2 9301 df-3 9302 df-4 9303 df-5 9304 df-6 9305 df-7 9306 df-8 9307 df-9 9308 df-n0 9502 df-z 9583 df-dec 9716 df-uz 9860 df-fz 10349 df-struct 13235 df-ndx 13236 df-slot 13237 df-base 13239 df-sets 13240 df-iress 13241 df-plusg 13324 df-mulr 13325 df-sca 13327 df-vsca 13328 df-ip 13329 df-tset 13330 df-ple 13331 df-ds 13333 df-hom 13335 df-cco 13336 df-rest 13475 df-topn 13476 df-0g 13492 df-topgen 13494 df-pt 13495 df-prds 13501 df-pws 13524 df-mgm 13590 df-sgrp 13636 df-mnd 13651 df-grp 13737 df-minusg 13738 df-subg 13908 df-psr 14860 df-mplcoe 14861 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |