| 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 2763 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 2 | eqid 2763 | . . . . . 6 ⊢ {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} | |
| 3 | dprdub.1 | . . . . . . 7 ⊢ (𝜑 → 𝐺dom DProd 𝑆) | |
| 4 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → 𝐺dom DProd 𝑆) |
| 5 | dprdub.2 | . . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐼) | |
| 6 | 5 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → dom 𝑆 = 𝐼) |
| 7 | dprdub.3 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
| 8 | 7 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → 𝑋 ∈ 𝐼) |
| 9 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → 𝑥 ∈ (𝑆‘𝑋)) | |
| 10 | eqid 2763 | . . . . . 6 ⊢ (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺))) = (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺))) | |
| 11 | 1, 2, 4, 6, 8, 9, 10 | dprdfid 20260 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → ((𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺))) ∈ {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)} ∧ (𝐺 Σg (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺)))) = 𝑥)) |
| 12 | 11 | simprd 501 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → (𝐺 Σg (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺)))) = 𝑥) |
| 13 | 11 | simpld 500 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺))) ∈ {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp (0g‘𝐺)}) |
| 14 | 1, 2, 4, 6, 13 | eldprdi 20261 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → (𝐺 Σg (𝑛 ∈ 𝐼 ↦ if(𝑛 = 𝑋, 𝑥, (0g‘𝐺)))) ∈ (𝐺 DProd 𝑆)) |
| 15 | 12, 14 | eqeltrrd 2865 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑆‘𝑋)) → 𝑥 ∈ (𝐺 DProd 𝑆)) |
| 16 | 15 | ex 418 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝑆‘𝑋) → 𝑥 ∈ (𝐺 DProd 𝑆))) |
| 17 | 16 | ssrdv 3919 | 1 ⊢ (𝜑 → (𝑆‘𝑋) ⊆ (𝐺 DProd 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {crab 3416 ⊆ wss 3900 ifcif 4485 class class class wbr 5106 ↦ cmpt 5189 dom cdm 5655 ‘cfv 6555 (class class class)co 7440 Xcixp 8950 finSupp cfsupp 9378 0gc0g 17636 Σg cgsu 17637 DProd cdprd 20236 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-isom 6564 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-supp 8202 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-2o 8502 df-er 8742 df-ixp 8951 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-fsupp 9379 df-oi 9528 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-n0 12631 df-z 12718 df-uz 12990 df-fz 13664 df-fzo 13813 df-seq 14169 df-hash 14499 df-sets 17368 df-slot 17386 df-ndx 17398 df-base 17414 df-ress 17435 df-plusg 17467 df-0g 17638 df-gsum 17639 df-mre 17782 df-mrc 17783 df-acs 17785 df-mgm 18842 df-sgrp 18934 df-mnd 18950 df-submnd 19005 df-grp 19173 df-mulg 19304 df-subg 19359 df-cntz 19558 df-cmn 20023 df-dprd 20238 |
| This theorem is used by: dprdspan 20270 dprd2dlem2 20283 dprd2da 20285 dmdprdsplit2lem 20288 dprdsplit 20291 dpjrid 20305 ablfac1c 20314 |
| Copyright terms: Public domain | W3C validator |