| 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 2238 | . . . . . 6 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
| 6 | eqid 2238 | . . . . . 6 ⊢ (Base‘𝑃) = (Base‘𝑃) | |
| 7 | 4, 5, 6 | mplval2g 15069 | . . . . 5 ⊢ ((𝐼 ∈ Fin ∧ 𝑅 ∈ Grp) → 𝑃 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃))) |
| 8 | 2, 3, 7 | syl2anc 415 | . . . 4 ⊢ (𝜑 → 𝑃 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃))) |
| 9 | 8 | fveq2d 5697 | . . 3 ⊢ (𝜑 → (0g‘𝑃) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 10 | 5, 4, 6, 2, 3 | mplsubgfi 15075 | . . . 4 ⊢ (𝜑 → (Base‘𝑃) ∈ (SubGrp‘(𝐼 mPwSer 𝑅))) |
| 11 | eqid 2238 | . . . . 5 ⊢ ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)) = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)) | |
| 12 | eqid 2238 | . . . . 5 ⊢ (0g‘(𝐼 mPwSer 𝑅)) = (0g‘(𝐼 mPwSer 𝑅)) | |
| 13 | 11, 12 | subg0 13966 | . . . 4 ⊢ ((Base‘𝑃) ∈ (SubGrp‘(𝐼 mPwSer 𝑅)) → (0g‘(𝐼 mPwSer 𝑅)) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 14 | 10, 13 | syl 14 | . . 3 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 15 | eqid 2238 | . . . . . 6 ⊢ {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} | |
| 16 | mpl0.o | . . . . . 6 ⊢ 𝑂 = (0g‘𝑅) | |
| 17 | 5, 2, 3, 15, 16, 12 | psr0 15060 | . . . . 5 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = ({𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} × {𝑂})) |
| 18 | 15 | psrbagfi 15042 | . . . . . . 7 ⊢ (𝐼 ∈ Fin → {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = (ℕ0 ↑𝑚 𝐼)) |
| 19 | 2, 18 | syl 14 | . . . . . 6 ⊢ (𝜑 → {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = (ℕ0 ↑𝑚 𝐼)) |
| 20 | 19 | xpeq1d 4795 | . . . . 5 ⊢ (𝜑 → ({𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} × {𝑂}) = ((ℕ0 ↑𝑚 𝐼) × {𝑂})) |
| 21 | 17, 20 | eqtrd 2271 | . . . 4 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = ((ℕ0 ↑𝑚 𝐼) × {𝑂})) |
| 22 | fconstmpt 4820 | . . . 4 ⊢ ((ℕ0 ↑𝑚 𝐼) × {𝑂}) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂) | |
| 23 | 21, 22 | eqtrdi 2287 | . . 3 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| 24 | 9, 14, 23 | 3eqtr2d 2277 | . 2 ⊢ (𝜑 → (0g‘𝑃) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| 25 | 1, 24 | eqtrid 2283 | 1 ⊢ (𝜑 → 0 = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 {crab 2532 {csn 3708 ↦ cmpt 4190 × cxp 4770 ◡ccnv 4771 “ cima 4775 ‘cfv 5375 (class class class)co 6079 ↑𝑚 cmap 6916 Fincfn 7016 ℕcn 9287 ℕ0cn0 9546 Basecbs 13335 ↾s cress 13336 0gc0g 13593 Grpcgrp 13788 SubGrpcsubg 13953 mPwSer cmps 15028 mPoly cmpl 15029 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-mulcom 8274 ax-addass 8275 ax-mulass 8276 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-1rid 8280 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-apti 8288 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3714 df-pr 3715 df-tp 3716 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-of 6296 df-1st 6368 df-2nd 6369 df-1o 6681 df-er 6801 df-map 6918 df-ixp 6975 df-en 7017 df-fin 7019 df-sup 7318 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-7 9351 df-8 9352 df-9 9353 df-n0 9547 df-z 9628 df-dec 9761 df-uz 9905 df-fz 10395 df-struct 13337 df-ndx 13338 df-slot 13339 df-base 13341 df-sets 13342 df-iress 13343 df-plusg 13427 df-mulr 13428 df-sca 13430 df-vsca 13431 df-ip 13432 df-tset 13433 df-ple 13434 df-ds 13436 df-hom 13438 df-cco 13439 df-rest 13578 df-topn 13579 df-0g 13595 df-topgen 13597 df-pt 13598 df-mgm 13659 df-sgrp 13700 df-mnd 13713 df-grp 13791 df-minusg 13792 df-subg 13956 df-prds 14153 df-pws 14186 df-psr 15030 df-mplcoe 15031 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |