![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dprdfid | Structured version Visualization version GIF version |
Description: A function mapping all but one arguments to zero sums to the value of this argument in a direct product. (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 𝑆 = 𝐼) |
dprdfid.3 | ⊢ (𝜑 → 𝑋 ∈ 𝐼) |
dprdfid.4 | ⊢ (𝜑 → 𝐴 ∈ (𝑆‘𝑋)) |
dprdfid.f | ⊢ 𝐹 = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) |
Ref | Expression |
---|---|
dprdfid | ⊢ (𝜑 → (𝐹 ∈ 𝑊 ∧ (𝐺 Σg 𝐹) = 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dprdfid.f | . . 3 ⊢ 𝐹 = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) | |
2 | eldprdi.w | . . . 4 ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 } | |
3 | eldprdi.1 | . . . 4 ⊢ (𝜑 → 𝐺dom DProd 𝑆) | |
4 | eldprdi.2 | . . . 4 ⊢ (𝜑 → dom 𝑆 = 𝐼) | |
5 | dprdfid.4 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝑆‘𝑋)) | |
6 | 5 | ad2antrr 724 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝐼) ∧ 𝑛 = 𝑋) → 𝐴 ∈ (𝑆‘𝑋)) |
7 | simpr 483 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝐼) ∧ 𝑛 = 𝑋) → 𝑛 = 𝑋) | |
8 | 7 | fveq2d 6906 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝐼) ∧ 𝑛 = 𝑋) → (𝑆‘𝑛) = (𝑆‘𝑋)) |
9 | 6, 8 | eleqtrrd 2832 | . . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝐼) ∧ 𝑛 = 𝑋) → 𝐴 ∈ (𝑆‘𝑛)) |
10 | 3, 4 | dprdf2 19971 | . . . . . . . 8 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺)) |
11 | 10 | ffvelcdmda 7099 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐼) → (𝑆‘𝑛) ∈ (SubGrp‘𝐺)) |
12 | eldprdi.0 | . . . . . . . 8 ⊢ 0 = (0g‘𝐺) | |
13 | 12 | subg0cl 19096 | . . . . . . 7 ⊢ ((𝑆‘𝑛) ∈ (SubGrp‘𝐺) → 0 ∈ (𝑆‘𝑛)) |
14 | 11, 13 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐼) → 0 ∈ (𝑆‘𝑛)) |
15 | 14 | adantr 479 | . . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝐼) ∧ ¬ 𝑛 = 𝑋) → 0 ∈ (𝑆‘𝑛)) |
16 | 9, 15 | ifclda 4567 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐼) → if(𝑛 = 𝑋, 𝐴, 0 ) ∈ (𝑆‘𝑛)) |
17 | 3, 4 | dprddomcld 19965 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ V) |
18 | 12 | fvexi 6916 | . . . . . 6 ⊢ 0 ∈ V |
19 | 18 | a1i 11 | . . . . 5 ⊢ (𝜑 → 0 ∈ V) |
20 | eqid 2728 | . . . . 5 ⊢ (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) | |
21 | 17, 19, 20 | sniffsupp 9431 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) finSupp 0 ) |
22 | 2, 3, 4, 16, 21 | dprdwd 19975 | . . 3 ⊢ (𝜑 → (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) ∈ 𝑊) |
23 | 1, 22 | eqeltrid 2833 | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑊) |
24 | eqid 2728 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
25 | dprdgrp 19969 | . . . . 5 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Grp) | |
26 | grpmnd 18904 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
27 | 3, 25, 26 | 3syl 18 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
28 | dprdfid.3 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
29 | 2, 3, 4, 23, 24 | dprdff 19976 | . . . 4 ⊢ (𝜑 → 𝐹:𝐼⟶(Base‘𝐺)) |
30 | 1 | oveq1i 7436 | . . . . 5 ⊢ (𝐹 supp 0 ) = ((𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) supp 0 ) |
31 | eldifsni 4798 | . . . . . . . 8 ⊢ (𝑛 ∈ (𝐼 ∖ {𝑋}) → 𝑛 ≠ 𝑋) | |
32 | 31 | adantl 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝐼 ∖ {𝑋})) → 𝑛 ≠ 𝑋) |
33 | ifnefalse 4544 | . . . . . . 7 ⊢ (𝑛 ≠ 𝑋 → if(𝑛 = 𝑋, 𝐴, 0 ) = 0 ) | |
34 | 32, 33 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝐼 ∖ {𝑋})) → if(𝑛 = 𝑋, 𝐴, 0 ) = 0 ) |
35 | 34, 17 | suppss2 8212 | . . . . 5 ⊢ (𝜑 → ((𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝐴, 0 )) supp 0 ) ⊆ {𝑋}) |
36 | 30, 35 | eqsstrid 4030 | . . . 4 ⊢ (𝜑 → (𝐹 supp 0 ) ⊆ {𝑋}) |
37 | 24, 12, 27, 17, 28, 29, 36 | gsumpt 19924 | . . 3 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐹‘𝑋)) |
38 | iftrue 4538 | . . . 4 ⊢ (𝑛 = 𝑋 → if(𝑛 = 𝑋, 𝐴, 0 ) = 𝐴) | |
39 | 1, 38, 28, 5 | fvmptd3 7033 | . . 3 ⊢ (𝜑 → (𝐹‘𝑋) = 𝐴) |
40 | 37, 39 | eqtrd 2768 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = 𝐴) |
41 | 23, 40 | jca 510 | 1 ⊢ (𝜑 → (𝐹 ∈ 𝑊 ∧ (𝐺 Σg 𝐹) = 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ≠ wne 2937 {crab 3430 Vcvv 3473 ∖ cdif 3946 ifcif 4532 {csn 4632 class class class wbr 5152 ↦ cmpt 5235 dom cdm 5682 ‘cfv 6553 (class class class)co 7426 supp csupp 8171 Xcixp 8922 finSupp cfsupp 9393 Basecbs 17187 0gc0g 17428 Σg cgsu 17429 Mndcmnd 18701 Grpcgrp 18897 SubGrpcsubg 19082 DProd cdprd 19957 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-rep 5289 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-int 4954 df-iun 5002 df-iin 5003 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-se 5638 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-isom 6562 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-supp 8172 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-1o 8493 df-er 8731 df-ixp 8923 df-en 8971 df-dom 8972 df-sdom 8973 df-fin 8974 df-fsupp 9394 df-oi 9541 df-card 9970 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-nn 12251 df-2 12313 df-n0 12511 df-z 12597 df-uz 12861 df-fz 13525 df-fzo 13668 df-seq 14007 df-hash 14330 df-sets 17140 df-slot 17158 df-ndx 17170 df-base 17188 df-ress 17217 df-plusg 17253 df-0g 17430 df-gsum 17431 df-mre 17573 df-mrc 17574 df-acs 17576 df-mgm 18607 df-sgrp 18686 df-mnd 18702 df-submnd 18748 df-grp 18900 df-mulg 19031 df-subg 19085 df-cntz 19275 df-cmn 19744 df-dprd 19959 |
This theorem is referenced by: dprdfeq0 19986 dprdub 19989 dpjrid 20026 |
Copyright terms: Public domain | W3C validator |