![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dprdf11 | Structured version Visualization version GIF version |
Description: Two group sums over a direct product that give the same value are equal as functions. (Contributed by Mario Carneiro, 25-Apr-2016.) (Revised by AV, 14-Jul-2019.) |
Ref | Expression |
---|---|
eldprdi.0 | ⊢ 0 = (0g‘𝐺) |
eldprdi.w | ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 } |
eldprdi.1 | ⊢ (𝜑 → 𝐺dom DProd 𝑆) |
eldprdi.2 | ⊢ (𝜑 → dom 𝑆 = 𝐼) |
eldprdi.3 | ⊢ (𝜑 → 𝐹 ∈ 𝑊) |
dprdf11.4 | ⊢ (𝜑 → 𝐻 ∈ 𝑊) |
Ref | Expression |
---|---|
dprdf11 | ⊢ (𝜑 → ((𝐺 Σg 𝐹) = (𝐺 Σg 𝐻) ↔ 𝐹 = 𝐻)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eldprdi.w | . . . . 5 ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 } | |
2 | eldprdi.1 | . . . . 5 ⊢ (𝜑 → 𝐺dom DProd 𝑆) | |
3 | eldprdi.2 | . . . . 5 ⊢ (𝜑 → dom 𝑆 = 𝐼) | |
4 | eldprdi.3 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝑊) | |
5 | eqid 2740 | . . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
6 | 1, 2, 3, 4, 5 | dprdff 20056 | . . . 4 ⊢ (𝜑 → 𝐹:𝐼⟶(Base‘𝐺)) |
7 | 6 | ffnd 6748 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐼) |
8 | dprdf11.4 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ 𝑊) | |
9 | 1, 2, 3, 8, 5 | dprdff 20056 | . . . 4 ⊢ (𝜑 → 𝐻:𝐼⟶(Base‘𝐺)) |
10 | 9 | ffnd 6748 | . . 3 ⊢ (𝜑 → 𝐻 Fn 𝐼) |
11 | eqfnfv 7064 | . . 3 ⊢ ((𝐹 Fn 𝐼 ∧ 𝐻 Fn 𝐼) → (𝐹 = 𝐻 ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) = (𝐻‘𝑥))) | |
12 | 7, 10, 11 | syl2anc 583 | . 2 ⊢ (𝜑 → (𝐹 = 𝐻 ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) = (𝐻‘𝑥))) |
13 | eldprdi.0 | . . . 4 ⊢ 0 = (0g‘𝐺) | |
14 | eqid 2740 | . . . . . 6 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
15 | 13, 1, 2, 3, 4, 8, 14 | dprdfsub 20065 | . . . . 5 ⊢ (𝜑 → ((𝐹 ∘f (-g‘𝐺)𝐻) ∈ 𝑊 ∧ (𝐺 Σg (𝐹 ∘f (-g‘𝐺)𝐻)) = ((𝐺 Σg 𝐹)(-g‘𝐺)(𝐺 Σg 𝐻)))) |
16 | 15 | simpld 494 | . . . 4 ⊢ (𝜑 → (𝐹 ∘f (-g‘𝐺)𝐻) ∈ 𝑊) |
17 | 13, 1, 2, 3, 16 | dprdfeq0 20066 | . . 3 ⊢ (𝜑 → ((𝐺 Σg (𝐹 ∘f (-g‘𝐺)𝐻)) = 0 ↔ (𝐹 ∘f (-g‘𝐺)𝐻) = (𝑥 ∈ 𝐼 ↦ 0 ))) |
18 | 15 | simprd 495 | . . . 4 ⊢ (𝜑 → (𝐺 Σg (𝐹 ∘f (-g‘𝐺)𝐻)) = ((𝐺 Σg 𝐹)(-g‘𝐺)(𝐺 Σg 𝐻))) |
19 | 18 | eqeq1d 2742 | . . 3 ⊢ (𝜑 → ((𝐺 Σg (𝐹 ∘f (-g‘𝐺)𝐻)) = 0 ↔ ((𝐺 Σg 𝐹)(-g‘𝐺)(𝐺 Σg 𝐻)) = 0 )) |
20 | 2, 3 | dprddomcld 20045 | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ V) |
21 | fvexd 6935 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ V) | |
22 | fvexd 6935 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐻‘𝑥) ∈ V) | |
23 | 6 | feqmptd 6990 | . . . . . 6 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥))) |
24 | 9 | feqmptd 6990 | . . . . . 6 ⊢ (𝜑 → 𝐻 = (𝑥 ∈ 𝐼 ↦ (𝐻‘𝑥))) |
25 | 20, 21, 22, 23, 24 | offval2 7734 | . . . . 5 ⊢ (𝜑 → (𝐹 ∘f (-g‘𝐺)𝐻) = (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)))) |
26 | 25 | eqeq1d 2742 | . . . 4 ⊢ (𝜑 → ((𝐹 ∘f (-g‘𝐺)𝐻) = (𝑥 ∈ 𝐼 ↦ 0 ) ↔ (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥))) = (𝑥 ∈ 𝐼 ↦ 0 ))) |
27 | ovex 7481 | . . . . . . 7 ⊢ ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)) ∈ V | |
28 | 27 | rgenw 3071 | . . . . . 6 ⊢ ∀𝑥 ∈ 𝐼 ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)) ∈ V |
29 | mpteqb 7048 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐼 ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)) ∈ V → ((𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥))) = (𝑥 ∈ 𝐼 ↦ 0 ) ↔ ∀𝑥 ∈ 𝐼 ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)) = 0 )) | |
30 | 28, 29 | ax-mp 5 | . . . . 5 ⊢ ((𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥))) = (𝑥 ∈ 𝐼 ↦ 0 ) ↔ ∀𝑥 ∈ 𝐼 ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)) = 0 ) |
31 | dprdgrp 20049 | . . . . . . . . 9 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Grp) | |
32 | 2, 31 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ Grp) |
33 | 32 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Grp) |
34 | 6 | ffvelcdmda 7118 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (Base‘𝐺)) |
35 | 9 | ffvelcdmda 7118 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐻‘𝑥) ∈ (Base‘𝐺)) |
36 | 5, 13, 14 | grpsubeq0 19066 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺) ∧ (𝐻‘𝑥) ∈ (Base‘𝐺)) → (((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)) = 0 ↔ (𝐹‘𝑥) = (𝐻‘𝑥))) |
37 | 33, 34, 35, 36 | syl3anc 1371 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)) = 0 ↔ (𝐹‘𝑥) = (𝐻‘𝑥))) |
38 | 37 | ralbidva 3182 | . . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ 𝐼 ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥)) = 0 ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) = (𝐻‘𝑥))) |
39 | 30, 38 | bitrid 283 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(-g‘𝐺)(𝐻‘𝑥))) = (𝑥 ∈ 𝐼 ↦ 0 ) ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) = (𝐻‘𝑥))) |
40 | 26, 39 | bitrd 279 | . . 3 ⊢ (𝜑 → ((𝐹 ∘f (-g‘𝐺)𝐻) = (𝑥 ∈ 𝐼 ↦ 0 ) ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) = (𝐻‘𝑥))) |
41 | 17, 19, 40 | 3bitr3d 309 | . 2 ⊢ (𝜑 → (((𝐺 Σg 𝐹)(-g‘𝐺)(𝐺 Σg 𝐻)) = 0 ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) = (𝐻‘𝑥))) |
42 | 5 | dprdssv 20060 | . . . 4 ⊢ (𝐺 DProd 𝑆) ⊆ (Base‘𝐺) |
43 | 13, 1, 2, 3, 4 | eldprdi 20062 | . . . 4 ⊢ (𝜑 → (𝐺 Σg 𝐹) ∈ (𝐺 DProd 𝑆)) |
44 | 42, 43 | sselid 4006 | . . 3 ⊢ (𝜑 → (𝐺 Σg 𝐹) ∈ (Base‘𝐺)) |
45 | 13, 1, 2, 3, 8 | eldprdi 20062 | . . . 4 ⊢ (𝜑 → (𝐺 Σg 𝐻) ∈ (𝐺 DProd 𝑆)) |
46 | 42, 45 | sselid 4006 | . . 3 ⊢ (𝜑 → (𝐺 Σg 𝐻) ∈ (Base‘𝐺)) |
47 | 5, 13, 14 | grpsubeq0 19066 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝐺 Σg 𝐹) ∈ (Base‘𝐺) ∧ (𝐺 Σg 𝐻) ∈ (Base‘𝐺)) → (((𝐺 Σg 𝐹)(-g‘𝐺)(𝐺 Σg 𝐻)) = 0 ↔ (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻))) |
48 | 32, 44, 46, 47 | syl3anc 1371 | . 2 ⊢ (𝜑 → (((𝐺 Σg 𝐹)(-g‘𝐺)(𝐺 Σg 𝐻)) = 0 ↔ (𝐺 Σg 𝐹) = (𝐺 Σg 𝐻))) |
49 | 12, 41, 48 | 3bitr2rd 308 | 1 ⊢ (𝜑 → ((𝐺 Σg 𝐹) = (𝐺 Σg 𝐻) ↔ 𝐹 = 𝐻)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∀wral 3067 {crab 3443 Vcvv 3488 class class class wbr 5166 ↦ cmpt 5249 dom cdm 5700 Fn wfn 6568 ‘cfv 6573 (class class class)co 7448 ∘f cof 7712 Xcixp 8955 finSupp cfsupp 9431 Basecbs 17258 0gc0g 17499 Σg cgsu 17500 Grpcgrp 18973 -gcsg 18975 DProd cdprd 20037 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-isom 6582 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-of 7714 df-om 7904 df-1st 8030 df-2nd 8031 df-supp 8202 df-tpos 8267 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-er 8763 df-map 8886 df-ixp 8956 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-fsupp 9432 df-oi 9579 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-n0 12554 df-z 12640 df-uz 12904 df-fz 13568 df-fzo 13712 df-seq 14053 df-hash 14380 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-0g 17501 df-gsum 17502 df-mre 17644 df-mrc 17645 df-acs 17647 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-mhm 18818 df-submnd 18819 df-grp 18976 df-minusg 18977 df-sbg 18978 df-mulg 19108 df-subg 19163 df-ghm 19253 df-gim 19299 df-cntz 19357 df-oppg 19386 df-cmn 19824 df-dprd 20039 |
This theorem is referenced by: dmdprdsplitlem 20081 dpjeq 20103 |
Copyright terms: Public domain | W3C validator |