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 20073

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 6698	. . 3 ⊢ (𝜑 → dom 𝑆 = 𝐼)
4		ssun1 4130	. . . . . . . 8 ⊢ 𝐶 ⊆ (𝐶 ∪ 𝐷)
5		dprdsplit.u	. . . . . . . 8 ⊢ (𝜑 → 𝐼 = (𝐶 ∪ 𝐷))
6	4, 5	sseqtrrid 3979	. . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ 𝐼)
7	1, 3, 6	dprdres 20053	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd (𝑆 ↾ 𝐶) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆)))
8	7	simpld 498	. . . . 5 ⊢ (𝜑 → 𝐺dom DProd (𝑆 ↾ 𝐶))
9		dprdsubg 20049	. . . . 5 ⊢ (𝐺dom DProd (𝑆 ↾ 𝐶) → (𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺))
10	8, 9	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺))
11		ssun2 4131	. . . . . . . 8 ⊢ 𝐷 ⊆ (𝐶 ∪ 𝐷)
12	11, 5	sseqtrrid 3979	. . . . . . 7 ⊢ (𝜑 → 𝐷 ⊆ 𝐼)
13	1, 3, 12	dprdres 20053	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd (𝑆 ↾ 𝐷) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)))
14	13	simpld 498	. . . . 5 ⊢ (𝜑 → 𝐺dom DProd (𝑆 ↾ 𝐷))
15		dprdsubg 20049	. . . . 5 ⊢ (𝐺dom DProd (𝑆 ↾ 𝐷) → (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺))
16	14, 15	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺))
17		dprdsplit.i	. . . . . . 7 ⊢ (𝜑 → (𝐶 ∩ 𝐷) = ∅)
18		eqid 2761	. . . . . . 7 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺)
19		eqid 2761	. . . . . . 7 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
20	2, 17, 5, 18, 19	dmdprdsplit 20072	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd 𝑆 ↔ ((𝐺dom DProd (𝑆 ↾ 𝐶) ∧ 𝐺dom DProd (𝑆 ↾ 𝐷)) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))) ∧ ((𝐺 DProd (𝑆 ↾ 𝐶)) ∩ (𝐺 DProd (𝑆 ↾ 𝐷))) = {(0_g‘𝐺)})))
21	1, 20	mpbid 234	. . . . 5 ⊢ (𝜑 → ((𝐺dom DProd (𝑆 ↾ 𝐶) ∧ 𝐺dom DProd (𝑆 ↾ 𝐷)) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))) ∧ ((𝐺 DProd (𝑆 ↾ 𝐶)) ∩ (𝐺 DProd (𝑆 ↾ 𝐷))) = {(0_g‘𝐺)}))
22	21	simp2d 1155	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))))
23		dprdsplit.s	. . . . 5 ⊢ ⊕ = (LSSum‘𝐺)
24	23, 18	lsmsubg 19677	. . . 4 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷)))) → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ∈ (SubGrp‘𝐺))
25	10, 16, 22, 24	syl3anc 1389	. . 3 ⊢ (𝜑 → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ∈ (SubGrp‘𝐺))
26	5	eleq2d 2847	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↔ 𝑥 ∈ (𝐶 ∪ 𝐷)))
27		elun 4106	. . . . . 6 ⊢ (𝑥 ∈ (𝐶 ∪ 𝐷) ↔ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷))
28	26, 27	bitrdi 289	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↔ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷)))
29	28	biimpa 480	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷))
30		fvres 6882	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐶 → ((𝑆 ↾ 𝐶)‘𝑥) = (𝑆‘𝑥))
31	30	adantl 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝑆 ↾ 𝐶)‘𝑥) = (𝑆‘𝑥))
32	8	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐺dom DProd (𝑆 ↾ 𝐶))
33	2, 6	fssresd 6727	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 ↾ 𝐶):𝐶⟶(SubGrp‘𝐺))
34	33	fdmd 6698	. . . . . . . . 9 ⊢ (𝜑 → dom (𝑆 ↾ 𝐶) = 𝐶)
35	34	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → dom (𝑆 ↾ 𝐶) = 𝐶)
36		simpr 488	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶)
37	32, 35, 36	dprdub 20050	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝑆 ↾ 𝐶)‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐶)))
38	31, 37	eqsstrrd 3971	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑆‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐶)))
39	23	lsmub1 19680	. . . . . . . 8 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺)) → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
40	10, 16, 39	syl2anc 593	. . . . . . 7 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
41	40	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
42	38, 41	sstrd 3946	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
43		fvres 6882	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐷 → ((𝑆 ↾ 𝐷)‘𝑥) = (𝑆‘𝑥))
44	43	adantl 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝑆 ↾ 𝐷)‘𝑥) = (𝑆‘𝑥))
45	14	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐺dom DProd (𝑆 ↾ 𝐷))
46	2, 12	fssresd 6727	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 ↾ 𝐷):𝐷⟶(SubGrp‘𝐺))
47	46	fdmd 6698	. . . . . . . . 9 ⊢ (𝜑 → dom (𝑆 ↾ 𝐷) = 𝐷)
48	47	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → dom (𝑆 ↾ 𝐷) = 𝐷)
49		simpr 488	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝑥 ∈ 𝐷)
50	45, 48, 49	dprdub 20050	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝑆 ↾ 𝐷)‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐷)))
51	44, 50	eqsstrrd 3971	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑆‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐷)))
52	23	lsmub2 19681	. . . . . . . 8 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺)) → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
53	10, 16, 52	syl2anc 593	. . . . . . 7 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
54	53	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
55	51, 54	sstrd 3946	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
56	42, 55	jaodan 970	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷)) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
57	29, 56	syldan 600	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
58	1, 3, 25, 57	dprdlub 20051	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
59	7	simprd 499	. . 3 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆))
60	13	simprd 499	. . 3 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆))
61		dprdsubg 20049	. . . . 5 ⊢ (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
62	1, 61	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
63	23	lsmlub 19687	. . . 4 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺)) → (((𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)) ↔ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆)))
64	10, 16, 62, 63	syl3anc 1389	. . 3 ⊢ (𝜑 → (((𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)) ↔ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆)))
65	59, 60, 64	mpbi2and 722	. 2 ⊢ (𝜑 → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆))
66	58, 65	eqssd 3953	1 ⊢ (𝜑 → (𝐺 DProd 𝑆) = ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ∪ cun 3902 ∩ cin 3903 ⊆ wss 3904 ∅c0 4285 {csn 4581 class class class wbr 5099 dom cdm 5645 ↾ cres 5647 ⟶wf 6513 ‘cfv 6517 (class class class)co 7392 0_gc0g 17451 SubGrpcsubg 19145 Cntzccntz 19338 LSSumclsm 19657 DProd cdprd 20018

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-iin 4951 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-se 5599 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-isom 6526 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-of 7656 df-om 7843 df-1st 7966 df-2nd 7967 df-supp 8136 df-tpos 8201 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-2o 8433 df-er 8673 df-map 8805 df-ixp 8876 df-en 8924 df-dom 8925 df-sdom 8926 df-fin 8927 df-fsupp 9305 df-oi 9455 df-card 9894 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-nn 12208 df-2 12277 df-n0 12479 df-z 12566 df-uz 12837 df-fz 13510 df-fzo 13657 df-seq 14012 df-hash 14341 df-sets 17183 df-slot 17201 df-ndx 17213 df-base 17229 df-ress 17250 df-plusg 17282 df-0g 17453 df-gsum 17454 df-mre 17597 df-mrc 17598 df-acs 17600 df-mgm 18657 df-sgrp 18736 df-mnd 18752 df-mhm 18800 df-submnd 18801 df-grp 18961 df-minusg 18962 df-sbg 18963 df-mulg 19093 df-subg 19148 df-ghm 19237 df-gim 19282 df-cntz 19340 df-oppg 19369 df-lsm 19659 df-cmn 19805 df-dprd 20020

This theorem is referenced by: dprdpr 20075 dpjlsm 20079 ablfac1eulem 20097 ablfac1eu 20098 pgpfaclem1 20106

W3C validator