| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dprdssv | Structured version Visualization version GIF version | ||
| Description: The internal direct product of a family of subgroups is a subset of the base. (Contributed by Mario Carneiro, 25-Apr-2016.) |
| Ref | Expression |
|---|---|
| dprdssv.b | ⊢ 𝐵 = (Base‘𝐺) |
| Ref | Expression |
|---|---|
| dprdssv | ⊢ (𝐺 DProd 𝑆) ⊆ 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . . . 4 ⊢ dom 𝑆 = dom 𝑆 | |
| 2 | eqid 2761 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 3 | eqid 2761 | . . . . 5 ⊢ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} = {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} | |
| 4 | 2, 3 | eldprd 20200 | . . . 4 ⊢ (dom 𝑆 = dom 𝑆 → (𝑥 ∈ (𝐺 DProd 𝑆) ↔ (𝐺dom DProd 𝑆 ∧ ∃𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}𝑥 = (𝐺 Σg 𝑓)))) |
| 5 | 1, 4 | ax-mp 5 | . . 3 ⊢ (𝑥 ∈ (𝐺 DProd 𝑆) ↔ (𝐺dom DProd 𝑆 ∧ ∃𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}𝑥 = (𝐺 Σg 𝑓))) |
| 6 | dprdssv.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 7 | eqid 2761 | . . . . . . 7 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺) | |
| 8 | dprdgrp 20201 | . . . . . . . . 9 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Grp) | |
| 9 | 8 | grpmndd 19137 | . . . . . . . 8 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Mnd) |
| 10 | 9 | adantr 486 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝐺 ∈ Mnd) |
| 11 | reldmdprd 20193 | . . . . . . . . . 10 ⊢ Rel dom DProd | |
| 12 | 11 | brrelex2i 5708 | . . . . . . . . 9 ⊢ (𝐺dom DProd 𝑆 → 𝑆 ∈ V) |
| 13 | 12 | dmexd 7904 | . . . . . . . 8 ⊢ (𝐺dom DProd 𝑆 → dom 𝑆 ∈ V) |
| 14 | 13 | adantr 486 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → dom 𝑆 ∈ V) |
| 15 | simpl 488 | . . . . . . . 8 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝐺dom DProd 𝑆) | |
| 16 | eqidd 2762 | . . . . . . . 8 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → dom 𝑆 = dom 𝑆) | |
| 17 | simpr 490 | . . . . . . . 8 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) | |
| 18 | 3, 15, 16, 17, 6 | dprdff 20208 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝑓:dom 𝑆⟶𝐵) |
| 19 | 3, 15, 16, 17, 7 | dprdfcntz 20211 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → ran 𝑓 ⊆ ((Cntz‘𝐺)‘ran 𝑓)) |
| 20 | 3, 15, 16, 17 | dprdffsupp 20210 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝑓 finSupp (0g‘𝐺)) |
| 21 | 6, 2, 7, 10, 14, 18, 19, 20 | gsumzcl 20105 | . . . . . 6 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → (𝐺 Σg 𝑓) ∈ 𝐵) |
| 22 | eleq1 2849 | . . . . . 6 ⊢ (𝑥 = (𝐺 Σg 𝑓) → (𝑥 ∈ 𝐵 ↔ (𝐺 Σg 𝑓) ∈ 𝐵)) | |
| 23 | 21, 22 | syl5ibrcom 250 | . . . . 5 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → (𝑥 = (𝐺 Σg 𝑓) → 𝑥 ∈ 𝐵)) |
| 24 | 23 | rexlimdva 3164 | . . . 4 ⊢ (𝐺dom DProd 𝑆 → (∃𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}𝑥 = (𝐺 Σg 𝑓) → 𝑥 ∈ 𝐵)) |
| 25 | 24 | imp 412 | . . 3 ⊢ ((𝐺dom DProd 𝑆 ∧ ∃𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}𝑥 = (𝐺 Σg 𝑓)) → 𝑥 ∈ 𝐵) |
| 26 | 5, 25 | sylbi 220 | . 2 ⊢ (𝑥 ∈ (𝐺 DProd 𝑆) → 𝑥 ∈ 𝐵) |
| 27 | 26 | ssriv 3935 | 1 ⊢ (𝐺 DProd 𝑆) ⊆ 𝐵 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 {crab 3413 Vcvv 3451 ⊆ wss 3899 class class class wbr 5103 dom cdm 5651 ‘cfv 6531 (class class class)co 7412 Xcixp 8909 finSupp cfsupp 9337 Basecbs 17367 0gc0g 17590 Σg cgsu 17591 Mndcmnd 18903 Cntzccntz 19509 DProd cdprd 20189 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-supp 8162 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-er 8701 df-ixp 8910 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-fsupp 9338 df-oi 9488 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-n0 12588 df-z 12675 df-uz 12947 df-fz 13621 df-fzo 13769 df-seq 14125 df-hash 14455 df-0g 17592 df-gsum 17593 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-grp 19127 df-subg 19313 df-cntz 19511 df-dprd 20191 |
| This theorem is used by: dprdfsub 20217 dprdf11 20219 dprdsubg 20220 dprdspan 20223 dprdcntz2 20234 dprd2da 20238 dmdprdsplit2lem 20241 ablfac1c 20267 ablfac1eulem 20268 ablfac1eu 20269 |
| Copyright terms: Public domain | W3C validator |