| 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 2207 | . . . . . 6 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
| 6 | eqid 2207 | . . . . . 6 ⊢ (Base‘𝑃) = (Base‘𝑃) | |
| 7 | 4, 5, 6 | mplval2g 14572 | . . . . 5 ⊢ ((𝐼 ∈ Fin ∧ 𝑅 ∈ Grp) → 𝑃 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃))) |
| 8 | 2, 3, 7 | syl2anc 411 | . . . 4 ⊢ (𝜑 → 𝑃 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃))) |
| 9 | 8 | fveq2d 5603 | . . 3 ⊢ (𝜑 → (0g‘𝑃) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 10 | 5, 4, 6, 2, 3 | mplsubgfi 14578 | . . . 4 ⊢ (𝜑 → (Base‘𝑃) ∈ (SubGrp‘(𝐼 mPwSer 𝑅))) |
| 11 | eqid 2207 | . . . . 5 ⊢ ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)) = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)) | |
| 12 | eqid 2207 | . . . . 5 ⊢ (0g‘(𝐼 mPwSer 𝑅)) = (0g‘(𝐼 mPwSer 𝑅)) | |
| 13 | 11, 12 | subg0 13631 | . . . 4 ⊢ ((Base‘𝑃) ∈ (SubGrp‘(𝐼 mPwSer 𝑅)) → (0g‘(𝐼 mPwSer 𝑅)) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 14 | 10, 13 | syl 14 | . . 3 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = (0g‘((𝐼 mPwSer 𝑅) ↾s (Base‘𝑃)))) |
| 15 | eqid 2207 | . . . . . 6 ⊢ {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} | |
| 16 | mpl0.o | . . . . . 6 ⊢ 𝑂 = (0g‘𝑅) | |
| 17 | 5, 2, 3, 15, 16, 12 | psr0 14563 | . . . . 5 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = ({𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} × {𝑂})) |
| 18 | 15 | psrbagfi 14550 | . . . . . . 7 ⊢ (𝐼 ∈ Fin → {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = (ℕ0 ↑𝑚 𝐼)) |
| 19 | 2, 18 | syl 14 | . . . . . 6 ⊢ (𝜑 → {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} = (ℕ0 ↑𝑚 𝐼)) |
| 20 | 19 | xpeq1d 4716 | . . . . 5 ⊢ (𝜑 → ({𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} × {𝑂}) = ((ℕ0 ↑𝑚 𝐼) × {𝑂})) |
| 21 | 17, 20 | eqtrd 2240 | . . . 4 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = ((ℕ0 ↑𝑚 𝐼) × {𝑂})) |
| 22 | fconstmpt 4740 | . . . 4 ⊢ ((ℕ0 ↑𝑚 𝐼) × {𝑂}) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂) | |
| 23 | 21, 22 | eqtrdi 2256 | . . 3 ⊢ (𝜑 → (0g‘(𝐼 mPwSer 𝑅)) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| 24 | 9, 14, 23 | 3eqtr2d 2246 | . 2 ⊢ (𝜑 → (0g‘𝑃) = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| 25 | 1, 24 | eqtrid 2252 | 1 ⊢ (𝜑 → 0 = (𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ↦ 𝑂)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 ∈ wcel 2178 {crab 2490 {csn 3643 ↦ cmpt 4121 × cxp 4691 ◡ccnv 4692 “ cima 4696 ‘cfv 5290 (class class class)co 5967 ↑𝑚 cmap 6758 Fincfn 6850 ℕcn 9071 ℕ0cn0 9330 Basecbs 12947 ↾s cress 12948 0gc0g 13203 Grpcgrp 13447 SubGrpcsubg 13618 mPwSer cmps 14538 mPoly cmpl 14539 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-coll 4175 ax-sep 4178 ax-nul 4186 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-iinf 4654 ax-cnex 8051 ax-resscn 8052 ax-1cn 8053 ax-1re 8054 ax-icn 8055 ax-addcl 8056 ax-addrcl 8057 ax-mulcl 8058 ax-addcom 8060 ax-mulcom 8061 ax-addass 8062 ax-mulass 8063 ax-distr 8064 ax-i2m1 8065 ax-0lt1 8066 ax-1rid 8067 ax-0id 8068 ax-rnegex 8069 ax-cnre 8071 ax-pre-ltirr 8072 ax-pre-ltwlin 8073 ax-pre-lttrn 8074 ax-pre-apti 8075 ax-pre-ltadd 8076 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rmo 2494 df-rab 2495 df-v 2778 df-sbc 3006 df-csb 3102 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-nul 3469 df-if 3580 df-pw 3628 df-sn 3649 df-pr 3650 df-tp 3651 df-op 3652 df-uni 3865 df-int 3900 df-iun 3943 df-br 4060 df-opab 4122 df-mpt 4123 df-tr 4159 df-id 4358 df-iord 4431 df-on 4433 df-suc 4436 df-iom 4657 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-ima 4706 df-iota 5251 df-fun 5292 df-fn 5293 df-f 5294 df-f1 5295 df-fo 5296 df-f1o 5297 df-fv 5298 df-riota 5922 df-ov 5970 df-oprab 5971 df-mpo 5972 df-of 6181 df-1st 6249 df-2nd 6250 df-1o 6525 df-er 6643 df-map 6760 df-ixp 6809 df-en 6851 df-fin 6853 df-sup 7112 df-pnf 8144 df-mnf 8145 df-xr 8146 df-ltxr 8147 df-le 8148 df-sub 8280 df-neg 8281 df-inn 9072 df-2 9130 df-3 9131 df-4 9132 df-5 9133 df-6 9134 df-7 9135 df-8 9136 df-9 9137 df-n0 9331 df-z 9408 df-dec 9540 df-uz 9684 df-fz 10166 df-struct 12949 df-ndx 12950 df-slot 12951 df-base 12953 df-sets 12954 df-iress 12955 df-plusg 13037 df-mulr 13038 df-sca 13040 df-vsca 13041 df-ip 13042 df-tset 13043 df-ple 13044 df-ds 13046 df-hom 13048 df-cco 13049 df-rest 13188 df-topn 13189 df-0g 13205 df-topgen 13207 df-pt 13208 df-prds 13214 df-pws 13237 df-mgm 13303 df-sgrp 13349 df-mnd 13364 df-grp 13450 df-minusg 13451 df-subg 13621 df-psr 14540 df-mplcoe 14541 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |