![]() |
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 2735 | . . . 4 ⊢ dom 𝑆 = dom 𝑆 | |
2 | eqid 2735 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
3 | eqid 2735 | . . . . 5 ⊢ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} = {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} | |
4 | 2, 3 | eldprd 20039 | . . . 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 2735 | . . . . . . 7 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺) | |
8 | dprdgrp 20040 | . . . . . . . . 9 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Grp) | |
9 | 8 | grpmndd 18977 | . . . . . . . 8 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Mnd) |
10 | 9 | adantr 480 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝐺 ∈ Mnd) |
11 | reldmdprd 20032 | . . . . . . . . . 10 ⊢ Rel dom DProd | |
12 | 11 | brrelex2i 5746 | . . . . . . . . 9 ⊢ (𝐺dom DProd 𝑆 → 𝑆 ∈ V) |
13 | 12 | dmexd 7926 | . . . . . . . 8 ⊢ (𝐺dom DProd 𝑆 → dom 𝑆 ∈ V) |
14 | 13 | adantr 480 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → dom 𝑆 ∈ V) |
15 | simpl 482 | . . . . . . . 8 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝐺dom DProd 𝑆) | |
16 | eqidd 2736 | . . . . . . . 8 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → dom 𝑆 = dom 𝑆) | |
17 | simpr 484 | . . . . . . . 8 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) | |
18 | 3, 15, 16, 17, 6 | dprdff 20047 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝑓:dom 𝑆⟶𝐵) |
19 | 3, 15, 16, 17, 7 | dprdfcntz 20050 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → ran 𝑓 ⊆ ((Cntz‘𝐺)‘ran 𝑓)) |
20 | 3, 15, 16, 17 | dprdffsupp 20049 | . . . . . . 7 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → 𝑓 finSupp (0g‘𝐺)) |
21 | 6, 2, 7, 10, 14, 18, 19, 20 | gsumzcl 19944 | . . . . . 6 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → (𝐺 Σg 𝑓) ∈ 𝐵) |
22 | eleq1 2827 | . . . . . 6 ⊢ (𝑥 = (𝐺 Σg 𝑓) → (𝑥 ∈ 𝐵 ↔ (𝐺 Σg 𝑓) ∈ 𝐵)) | |
23 | 21, 22 | syl5ibrcom 247 | . . . . 5 ⊢ ((𝐺dom DProd 𝑆 ∧ 𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) → (𝑥 = (𝐺 Σg 𝑓) → 𝑥 ∈ 𝐵)) |
24 | 23 | rexlimdva 3153 | . . . 4 ⊢ (𝐺dom DProd 𝑆 → (∃𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}𝑥 = (𝐺 Σg 𝑓) → 𝑥 ∈ 𝐵)) |
25 | 24 | imp 406 | . . 3 ⊢ ((𝐺dom DProd 𝑆 ∧ ∃𝑓 ∈ {ℎ ∈ X𝑖 ∈ dom 𝑆(𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}𝑥 = (𝐺 Σg 𝑓)) → 𝑥 ∈ 𝐵) |
26 | 5, 25 | sylbi 217 | . 2 ⊢ (𝑥 ∈ (𝐺 DProd 𝑆) → 𝑥 ∈ 𝐵) |
27 | 26 | ssriv 3999 | 1 ⊢ (𝐺 DProd 𝑆) ⊆ 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 {crab 3433 Vcvv 3478 ⊆ wss 3963 class class class wbr 5148 dom cdm 5689 ‘cfv 6563 (class class class)co 7431 Xcixp 8936 finSupp cfsupp 9399 Basecbs 17245 0gc0g 17486 Σg cgsu 17487 Mndcmnd 18760 Cntzccntz 19346 DProd cdprd 20028 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-supp 8185 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-ixp 8937 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-fsupp 9400 df-oi 9548 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-n0 12525 df-z 12612 df-uz 12877 df-fz 13545 df-fzo 13692 df-seq 14040 df-hash 14367 df-0g 17488 df-gsum 17489 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-grp 18967 df-subg 19154 df-cntz 19348 df-dprd 20030 |
This theorem is referenced by: dprdfsub 20056 dprdf11 20058 dprdsubg 20059 dprdspan 20062 dprdcntz2 20073 dprd2da 20077 dmdprdsplit2lem 20080 ablfac1c 20106 ablfac1eulem 20107 ablfac1eu 20108 |
Copyright terms: Public domain | W3C validator |