| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mplsubgfi | GIF version | ||
| Description: The set of polynomials is closed under addition, i.e. it is a subgroup of the set of power series. (Contributed by Mario Carneiro, 8-Jan-2015.) (Proof shortened by AV, 16-Jul-2019.) |
| Ref | Expression |
|---|---|
| mplsubg.s | ⊢ 𝑆 = (𝐼 mPwSer 𝑅) |
| mplsubg.p | ⊢ 𝑃 = (𝐼 mPoly 𝑅) |
| mplsubg.u | ⊢ 𝑈 = (Base‘𝑃) |
| mplsubg.i | ⊢ (𝜑 → 𝐼 ∈ Fin) |
| mplsubg.r | ⊢ (𝜑 → 𝑅 ∈ Grp) |
| Ref | Expression |
|---|---|
| mplsubgfi | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mplsubg.p | . . . 4 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
| 2 | mplsubg.s | . . . 4 ⊢ 𝑆 = (𝐼 mPwSer 𝑅) | |
| 3 | mplsubg.u | . . . 4 ⊢ 𝑈 = (Base‘𝑃) | |
| 4 | eqid 2234 | . . . 4 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 5 | 1, 2, 3, 4 | mplbasss 14980 | . . 3 ⊢ 𝑈 ⊆ (Base‘𝑆) |
| 6 | 5 | a1i 9 | . 2 ⊢ (𝜑 → 𝑈 ⊆ (Base‘𝑆)) |
| 7 | mplsubg.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ Fin) | |
| 8 | mplsubg.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Grp) | |
| 9 | 2, 1, 3, 7, 8 | mplsubgfilemm 14982 | . 2 ⊢ (𝜑 → ∃𝑗 𝑗 ∈ 𝑈) |
| 10 | 7 | ad2antrr 488 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → 𝐼 ∈ Fin) |
| 11 | 8 | ad2antrr 488 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → 𝑅 ∈ Grp) |
| 12 | simplr 529 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → 𝑢 ∈ 𝑈) | |
| 13 | simpr 110 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → 𝑣 ∈ 𝑈) | |
| 14 | eqid 2234 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 15 | 2, 1, 3, 10, 11, 12, 13, 14 | mplsubgfilemcl 14983 | . . . . 5 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → (𝑢(+g‘𝑆)𝑣) ∈ 𝑈) |
| 16 | 15 | ralrimiva 2617 | . . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → ∀𝑣 ∈ 𝑈 (𝑢(+g‘𝑆)𝑣) ∈ 𝑈) |
| 17 | 7 | adantr 276 | . . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝐼 ∈ Fin) |
| 18 | 8 | adantr 276 | . . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑅 ∈ Grp) |
| 19 | simpr 110 | . . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑢 ∈ 𝑈) | |
| 20 | eqid 2234 | . . . . 5 ⊢ (invg‘𝑆) = (invg‘𝑆) | |
| 21 | 2, 1, 3, 17, 18, 19, 20 | mplsubgfileminv 14984 | . . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → ((invg‘𝑆)‘𝑢) ∈ 𝑈) |
| 22 | 16, 21 | jca 306 | . . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → (∀𝑣 ∈ 𝑈 (𝑢(+g‘𝑆)𝑣) ∈ 𝑈 ∧ ((invg‘𝑆)‘𝑢) ∈ 𝑈)) |
| 23 | 22 | ralrimiva 2617 | . 2 ⊢ (𝜑 → ∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 (𝑢(+g‘𝑆)𝑣) ∈ 𝑈 ∧ ((invg‘𝑆)‘𝑢) ∈ 𝑈)) |
| 24 | 2, 7, 8 | psrgrp 14969 | . . 3 ⊢ (𝜑 → 𝑆 ∈ Grp) |
| 25 | 4, 14, 20 | issubg2m 13945 | . . 3 ⊢ (𝑆 ∈ Grp → (𝑈 ∈ (SubGrp‘𝑆) ↔ (𝑈 ⊆ (Base‘𝑆) ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 (𝑢(+g‘𝑆)𝑣) ∈ 𝑈 ∧ ((invg‘𝑆)‘𝑢) ∈ 𝑈)))) |
| 26 | 24, 25 | syl 14 | . 2 ⊢ (𝜑 → (𝑈 ∈ (SubGrp‘𝑆) ↔ (𝑈 ⊆ (Base‘𝑆) ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 (𝑢(+g‘𝑆)𝑣) ∈ 𝑈 ∧ ((invg‘𝑆)‘𝑢) ∈ 𝑈)))) |
| 27 | 6, 9, 23, 26 | mpbir3and 1207 | 1 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∃wex 1541 ∈ wcel 2205 ∀wral 2522 ⊆ wss 3214 ‘cfv 5357 (class class class)co 6058 Fincfn 6988 Basecbs 13299 +gcplusg 13377 Grpcgrp 13758 invgcminusg 13759 SubGrpcsubg 13923 mPwSer cmps 14938 mPoly cmpl 14939 |
| 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 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 |
| 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 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-tp 3702 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-of 6275 df-1st 6347 df-2nd 6348 df-1o 6660 df-er 6780 df-map 6897 df-ixp 6947 df-en 6989 df-fin 6991 df-sup 7288 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8463 df-neg 8464 df-inn 9258 df-2 9316 df-3 9317 df-4 9318 df-5 9319 df-6 9320 df-7 9321 df-8 9322 df-9 9323 df-n0 9517 df-z 9598 df-dec 9731 df-uz 9875 df-fz 10365 df-struct 13301 df-ndx 13302 df-slot 13303 df-base 13305 df-sets 13306 df-iress 13307 df-plusg 13390 df-mulr 13391 df-sca 13393 df-vsca 13394 df-ip 13395 df-tset 13396 df-ple 13397 df-ds 13399 df-hom 13401 df-cco 13402 df-rest 13541 df-topn 13542 df-0g 13558 df-topgen 13560 df-pt 13561 df-mgm 13622 df-sgrp 13668 df-mnd 13681 df-grp 13761 df-minusg 13762 df-subg 13926 df-prds 14115 df-pws 14148 df-psr 14940 df-mplcoe 14941 |
| This theorem is referenced by: mpl0fi 14986 mplnegfi 14989 mplgrpfi 14990 |
| Copyright terms: Public domain | W3C validator |