| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dprdub | Structured version Visualization version GIF version | ||
| Description: Each factor is a subset of the internal direct product. (Contributed by Mario Carneiro, 25-Apr-2016.) |
| Ref | Expression |
|---|---|
| dprdub.1 | ⊢ (𝜑 → 𝐺dom DProd 𝑆) |
| dprdub.2 | ⊢ (𝜑 → dom 𝑆 = 𝐼) |
| dprdub.3 | ⊢ (𝜑 → 𝑋 ∈ 𝐼) |
| Ref | Expression |
|---|---|
| dprdub | ⊢ (𝜑 → (𝑆‘𝑋) ⊆ (𝐺 DProd 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2764 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 2 | eqid 2764 | . . . . . 6 ⊢ {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} | |
| 3 | dprdub.1 | . . . . . . 7 ⊢ (𝜑 → 𝐺dom DProd 𝑆) | |
| 4 | 3 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → 𝐺dom DProd 𝑆) |
| 5 | dprdub.2 | . . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐼) | |
| 6 | 5 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → dom 𝑆 = 𝐼) |
| 7 | dprdub.3 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
| 8 | 7 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → 𝑋 ∈ 𝐼) |
| 9 | simpr 488 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → 𝑥 ∈ (𝑆‘𝑋)) | |
| 10 | eqid 2764 | . . . . . 6 ⊢ (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺))) = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺))) | |
| 11 | 1, 2, 4, 6, 8, 9, 10 | dprdfid 20061 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → ((𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺))) ∈ {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} ∧ (𝐺 Σg (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺)))) = 𝑥)) |
| 12 | 11 | simprd 499 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → (𝐺 Σg (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺)))) = 𝑥) |
| 13 | 11 | simpld 498 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺))) ∈ {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) |
| 14 | 1, 2, 4, 6, 13 | eldprdi 20062 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → (𝐺 Σg (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺)))) ∈ (𝐺 DProd 𝑆)) |
| 15 | 12, 14 | eqeltrrd 2865 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → 𝑥 ∈ (𝐺 DProd 𝑆)) |
| 16 | 15 | ex 416 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝑆‘𝑋) → 𝑥 ∈ (𝐺 DProd 𝑆))) |
| 17 | 16 | ssrdv 3944 | 1 ⊢ (𝜑 → (𝑆‘𝑋) ⊆ (𝐺 DProd 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1562 ∈ wcel 2144 {crab 3416 ⊆ wss 3906 ifcif 4482 class class class wbr 5102 ↦ cmpt 5183 dom cdm 5649 ‘cfv 6523 (class class class)co 7398 Xcixp 8881 finSupp cfsupp 9309 0gc0g 17470 Σg cgsu 17471 DProd cdprd 20037 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 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-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-se 5603 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-isom 6532 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-1st 7972 df-2nd 7973 df-supp 8143 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-1o 8439 df-2o 8440 df-er 8680 df-ixp 8882 df-en 8930 df-dom 8931 df-sdom 8932 df-fin 8933 df-fsupp 9310 df-oi 9460 df-card 9899 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-nn 12213 df-2 12282 df-n0 12484 df-z 12571 df-uz 12842 df-fz 13515 df-fzo 13662 df-seq 14017 df-hash 14346 df-sets 17202 df-slot 17220 df-ndx 17232 df-base 17248 df-ress 17269 df-plusg 17301 df-0g 17472 df-gsum 17473 df-mre 17616 df-mrc 17617 df-acs 17619 df-mgm 18676 df-sgrp 18755 df-mnd 18771 df-submnd 18820 df-grp 18980 df-mulg 19112 df-subg 19167 df-cntz 19359 df-cmn 19824 df-dprd 20039 |
| This theorem is referenced by: dprdspan 20071 dprd2dlem2 20084 dprd2da 20086 dmdprdsplit2lem 20089 dprdsplit 20092 dpjrid 20106 ablfac1c 20115 |
| Copyright terms: Public domain | W3C validator |