| 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 2232 | . . . 4 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 5 | 1, 2, 3, 4 | mplbasss 14838 | . . 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 14840 | . 2 ⊢ (𝜑 → ∃𝑗 𝑗 ∈ 𝑈) |
| 10 | 7 | ad2antrr 488 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → 𝐼 ∈ Fin) |
| 11 | 8 | ad2antrr 488 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → 𝑅 ∈ Grp) |
| 12 | simplr 529 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → 𝑢 ∈ 𝑈) | |
| 13 | simpr 110 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → 𝑣 ∈ 𝑈) | |
| 14 | eqid 2232 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 15 | 2, 1, 3, 10, 11, 12, 13, 14 | mplsubgfilemcl 14841 | . . . . 5 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) → (𝑢(+g‘𝑆)𝑣) ∈ 𝑈) |
| 16 | 15 | ralrimiva 2615 | . . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → ∀𝑣 ∈ 𝑈 (𝑢(+g‘𝑆)𝑣) ∈ 𝑈) |
| 17 | 7 | adantr 276 | . . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝐼 ∈ Fin) |
| 18 | 8 | adantr 276 | . . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑅 ∈ Grp) |
| 19 | simpr 110 | . . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → 𝑢 ∈ 𝑈) | |
| 20 | eqid 2232 | . . . . 5 ⊢ (invg‘𝑆) = (invg‘𝑆) | |
| 21 | 2, 1, 3, 17, 18, 19, 20 | mplsubgfileminv 14842 | . . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → ((invg‘𝑆)‘𝑢) ∈ 𝑈) |
| 22 | 16, 21 | jca 306 | . . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑈) → (∀𝑣 ∈ 𝑈 (𝑢(+g‘𝑆)𝑣) ∈ 𝑈 ∧ ((invg‘𝑆)‘𝑢) ∈ 𝑈)) |
| 23 | 22 | ralrimiva 2615 | . 2 ⊢ (𝜑 → ∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 (𝑢(+g‘𝑆)𝑣) ∈ 𝑈 ∧ ((invg‘𝑆)‘𝑢) ∈ 𝑈)) |
| 24 | 2, 7, 8 | psrgrp 14827 | . . 3 ⊢ (𝜑 → 𝑆 ∈ Grp) |
| 25 | 4, 14, 20 | issubg2m 13895 | . . 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 2203 ∀wral 2520 ⊆ wss 3210 ‘cfv 5351 (class class class)co 6049 Fincfn 6974 Basecbs 13201 +gcplusg 13279 Grpcgrp 13702 invgcminusg 13703 SubGrpcsubg 13873 mPwSer cmps 14796 mPoly cmpl 14797 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-apti 8238 ax-pre-ltadd 8239 |
| 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 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-tp 3696 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-iord 4486 df-on 4488 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-of 6265 df-1st 6333 df-2nd 6334 df-1o 6646 df-er 6766 df-map 6883 df-ixp 6933 df-en 6975 df-fin 6977 df-sup 7274 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-inn 9234 df-2 9292 df-3 9293 df-4 9294 df-5 9295 df-6 9296 df-7 9297 df-8 9298 df-9 9299 df-n0 9493 df-z 9574 df-dec 9706 df-uz 9850 df-fz 10339 df-struct 13203 df-ndx 13204 df-slot 13205 df-base 13207 df-sets 13208 df-iress 13209 df-plusg 13292 df-mulr 13293 df-sca 13295 df-vsca 13296 df-ip 13297 df-tset 13298 df-ple 13299 df-ds 13301 df-hom 13303 df-cco 13304 df-rest 13443 df-topn 13444 df-0g 13460 df-topgen 13462 df-pt 13463 df-prds 13469 df-pws 13492 df-mgm 13558 df-sgrp 13604 df-mnd 13619 df-grp 13705 df-minusg 13706 df-subg 13876 df-psr 14798 df-mplcoe 14799 |
| This theorem is referenced by: mpl0fi 14844 mplnegfi 14847 mplgrpfi 14848 |
| Copyright terms: Public domain | W3C validator |