dprdsplit - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > dprdsplit		Structured version Visualization version GIF version

Theorem dprdsplit 20031

Description: The direct product is the binary subgroup product ("sum") of the direct products of the partition. (Contributed by Mario Carneiro, 25-Apr-2016.)

**Hypotheses**
Ref	Expression
dprdsplit.2	⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺))
dprdsplit.i	⊢ (𝜑 → (𝐶 ∩ 𝐷) = ∅)
dprdsplit.u	⊢ (𝜑 → 𝐼 = (𝐶 ∪ 𝐷))
dprdsplit.s	⊢ ⊕ = (LSSum‘𝐺)
dprdsplit.1	⊢ (𝜑 → 𝐺dom DProd 𝑆)

**Assertion**
Ref	Expression
dprdsplit	⊢ (𝜑 → (𝐺 DProd 𝑆) = ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))

Proof of Theorem dprdsplit Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dprdsplit.1	. . 3 ⊢ (𝜑 → 𝐺dom DProd 𝑆)
2		dprdsplit.2	. . . 4 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺))
3	2	fdmd 6716	. . 3 ⊢ (𝜑 → dom 𝑆 = 𝐼)
4		ssun1 4153	. . . . . . . 8 ⊢ 𝐶 ⊆ (𝐶 ∪ 𝐷)
5		dprdsplit.u	. . . . . . . 8 ⊢ (𝜑 → 𝐼 = (𝐶 ∪ 𝐷))
6	4, 5	sseqtrrid 4002	. . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ 𝐼)
7	1, 3, 6	dprdres 20011	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd (𝑆 ↾ 𝐶) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆)))
8	7	simpld 494	. . . . 5 ⊢ (𝜑 → 𝐺dom DProd (𝑆 ↾ 𝐶))
9		dprdsubg 20007	. . . . 5 ⊢ (𝐺dom DProd (𝑆 ↾ 𝐶) → (𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺))
10	8, 9	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺))
11		ssun2 4154	. . . . . . . 8 ⊢ 𝐷 ⊆ (𝐶 ∪ 𝐷)
12	11, 5	sseqtrrid 4002	. . . . . . 7 ⊢ (𝜑 → 𝐷 ⊆ 𝐼)
13	1, 3, 12	dprdres 20011	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd (𝑆 ↾ 𝐷) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)))
14	13	simpld 494	. . . . 5 ⊢ (𝜑 → 𝐺dom DProd (𝑆 ↾ 𝐷))
15		dprdsubg 20007	. . . . 5 ⊢ (𝐺dom DProd (𝑆 ↾ 𝐷) → (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺))
16	14, 15	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺))
17		dprdsplit.i	. . . . . . 7 ⊢ (𝜑 → (𝐶 ∩ 𝐷) = ∅)
18		eqid 2735	. . . . . . 7 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺)
19		eqid 2735	. . . . . . 7 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
20	2, 17, 5, 18, 19	dmdprdsplit 20030	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd 𝑆 ↔ ((𝐺dom DProd (𝑆 ↾ 𝐶) ∧ 𝐺dom DProd (𝑆 ↾ 𝐷)) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))) ∧ ((𝐺 DProd (𝑆 ↾ 𝐶)) ∩ (𝐺 DProd (𝑆 ↾ 𝐷))) = {(0_g‘𝐺)})))
21	1, 20	mpbid 232	. . . . 5 ⊢ (𝜑 → ((𝐺dom DProd (𝑆 ↾ 𝐶) ∧ 𝐺dom DProd (𝑆 ↾ 𝐷)) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))) ∧ ((𝐺 DProd (𝑆 ↾ 𝐶)) ∩ (𝐺 DProd (𝑆 ↾ 𝐷))) = {(0_g‘𝐺)}))
22	21	simp2d 1143	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))))
23		dprdsplit.s	. . . . 5 ⊢ ⊕ = (LSSum‘𝐺)
24	23, 18	lsmsubg 19635	. . . 4 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷)))) → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ∈ (SubGrp‘𝐺))
25	10, 16, 22, 24	syl3anc 1373	. . 3 ⊢ (𝜑 → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ∈ (SubGrp‘𝐺))
26	5	eleq2d 2820	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↔ 𝑥 ∈ (𝐶 ∪ 𝐷)))
27		elun 4128	. . . . . 6 ⊢ (𝑥 ∈ (𝐶 ∪ 𝐷) ↔ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷))
28	26, 27	bitrdi 287	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↔ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷)))
29	28	biimpa 476	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷))
30		fvres 6895	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐶 → ((𝑆 ↾ 𝐶)‘𝑥) = (𝑆‘𝑥))
31	30	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝑆 ↾ 𝐶)‘𝑥) = (𝑆‘𝑥))
32	8	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐺dom DProd (𝑆 ↾ 𝐶))
33	2, 6	fssresd 6745	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 ↾ 𝐶):𝐶⟶(SubGrp‘𝐺))
34	33	fdmd 6716	. . . . . . . . 9 ⊢ (𝜑 → dom (𝑆 ↾ 𝐶) = 𝐶)
35	34	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → dom (𝑆 ↾ 𝐶) = 𝐶)
36		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶)
37	32, 35, 36	dprdub 20008	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝑆 ↾ 𝐶)‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐶)))
38	31, 37	eqsstrrd 3994	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑆‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐶)))
39	23	lsmub1 19638	. . . . . . . 8 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺)) → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
40	10, 16, 39	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
41	40	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
42	38, 41	sstrd 3969	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
43		fvres 6895	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐷 → ((𝑆 ↾ 𝐷)‘𝑥) = (𝑆‘𝑥))
44	43	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝑆 ↾ 𝐷)‘𝑥) = (𝑆‘𝑥))
45	14	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐺dom DProd (𝑆 ↾ 𝐷))
46	2, 12	fssresd 6745	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 ↾ 𝐷):𝐷⟶(SubGrp‘𝐺))
47	46	fdmd 6716	. . . . . . . . 9 ⊢ (𝜑 → dom (𝑆 ↾ 𝐷) = 𝐷)
48	47	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → dom (𝑆 ↾ 𝐷) = 𝐷)
49		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝑥 ∈ 𝐷)
50	45, 48, 49	dprdub 20008	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝑆 ↾ 𝐷)‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐷)))
51	44, 50	eqsstrrd 3994	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑆‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐷)))
52	23	lsmub2 19639	. . . . . . . 8 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺)) → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
53	10, 16, 52	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
54	53	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
55	51, 54	sstrd 3969	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
56	42, 55	jaodan 959	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷)) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
57	29, 56	syldan 591	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
58	1, 3, 25, 57	dprdlub 20009	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
59	7	simprd 495	. . 3 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆))
60	13	simprd 495	. . 3 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆))
61		dprdsubg 20007	. . . . 5 ⊢ (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
62	1, 61	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
63	23	lsmlub 19645	. . . 4 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺)) → (((𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)) ↔ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆)))
64	10, 16, 62, 63	syl3anc 1373	. . 3 ⊢ (𝜑 → (((𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)) ↔ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆)))
65	59, 60, 64	mpbi2and 712	. 2 ⊢ (𝜑 → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆))
66	58, 65	eqssd 3976	1 ⊢ (𝜑 → (𝐺 DProd 𝑆) = ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ∪ cun 3924 ∩ cin 3925 ⊆ wss 3926 ∅c0 4308 {csn 4601 class class class wbr 5119 dom cdm 5654 ↾ cres 5656 ⟶wf 6527 ‘cfv 6531 (class class class)co 7405 0_gc0g 17453 SubGrpcsubg 19103 Cntzccntz 19298 LSSumclsm 19615 DProd cdprd 19976

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-iin 4970 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7671 df-om 7862 df-1st 7988 df-2nd 7989 df-supp 8160 df-tpos 8225 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-2o 8481 df-er 8719 df-map 8842 df-ixp 8912 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-fsupp 9374 df-oi 9524 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-nn 12241 df-2 12303 df-n0 12502 df-z 12589 df-uz 12853 df-fz 13525 df-fzo 13672 df-seq 14020 df-hash 14349 df-sets 17183 df-slot 17201 df-ndx 17213 df-base 17229 df-ress 17252 df-plusg 17284 df-0g 17455 df-gsum 17456 df-mre 17598 df-mrc 17599 df-acs 17601 df-mgm 18618 df-sgrp 18697 df-mnd 18713 df-mhm 18761 df-submnd 18762 df-grp 18919 df-minusg 18920 df-sbg 18921 df-mulg 19051 df-subg 19106 df-ghm 19196 df-gim 19242 df-cntz 19300 df-oppg 19329 df-lsm 19617 df-cmn 19763 df-dprd 19978

This theorem is referenced by: dprdpr 20033 dpjlsm 20037 ablfac1eulem 20055 ablfac1eu 20056 pgpfaclem1 20064

W3C validator