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 20023

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 6672	. . 3 ⊢ (𝜑 → dom 𝑆 = 𝐼)
4		ssun1 4114	. . . . . . . 8 ⊢ 𝐶 ⊆ (𝐶 ∪ 𝐷)
5		dprdsplit.u	. . . . . . . 8 ⊢ (𝜑 → 𝐼 = (𝐶 ∪ 𝐷))
6	4, 5	sseqtrrid 3965	. . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ 𝐼)
7	1, 3, 6	dprdres 20003	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd (𝑆 ↾ 𝐶) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆)))
8	7	simpld 495	. . . . 5 ⊢ (𝜑 → 𝐺dom DProd (𝑆 ↾ 𝐶))
9		dprdsubg 19999	. . . . 5 ⊢ (𝐺dom DProd (𝑆 ↾ 𝐶) → (𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺))
10	8, 9	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺))
11		ssun2 4115	. . . . . . . 8 ⊢ 𝐷 ⊆ (𝐶 ∪ 𝐷)
12	11, 5	sseqtrrid 3965	. . . . . . 7 ⊢ (𝜑 → 𝐷 ⊆ 𝐼)
13	1, 3, 12	dprdres 20003	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd (𝑆 ↾ 𝐷) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)))
14	13	simpld 495	. . . . 5 ⊢ (𝜑 → 𝐺dom DProd (𝑆 ↾ 𝐷))
15		dprdsubg 19999	. . . . 5 ⊢ (𝐺dom DProd (𝑆 ↾ 𝐷) → (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺))
16	14, 15	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺))
17		dprdsplit.i	. . . . . . 7 ⊢ (𝜑 → (𝐶 ∩ 𝐷) = ∅)
18		eqid 2740	. . . . . . 7 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺)
19		eqid 2740	. . . . . . 7 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
20	2, 17, 5, 18, 19	dmdprdsplit 20022	. . . . . 6 ⊢ (𝜑 → (𝐺dom DProd 𝑆 ↔ ((𝐺dom DProd (𝑆 ↾ 𝐶) ∧ 𝐺dom DProd (𝑆 ↾ 𝐷)) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))) ∧ ((𝐺 DProd (𝑆 ↾ 𝐶)) ∩ (𝐺 DProd (𝑆 ↾ 𝐷))) = {(0_g‘𝐺)})))
21	1, 20	mpbid 233	. . . . 5 ⊢ (𝜑 → ((𝐺dom DProd (𝑆 ↾ 𝐶) ∧ 𝐺dom DProd (𝑆 ↾ 𝐷)) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))) ∧ ((𝐺 DProd (𝑆 ↾ 𝐶)) ∩ (𝐺 DProd (𝑆 ↾ 𝐷))) = {(0_g‘𝐺)}))
22	21	simp2d 1149	. . . 4 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷))))
23		dprdsplit.s	. . . . 5 ⊢ ⊕ = (LSSum‘𝐺)
24	23, 18	lsmsubg 19627	. . . 4 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((Cntz‘𝐺)‘(𝐺 DProd (𝑆 ↾ 𝐷)))) → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ∈ (SubGrp‘𝐺))
25	10, 16, 22, 24	syl3anc 1379	. . 3 ⊢ (𝜑 → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ∈ (SubGrp‘𝐺))
26	5	eleq2d 2826	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↔ 𝑥 ∈ (𝐶 ∪ 𝐷)))
27		elun 4090	. . . . . 6 ⊢ (𝑥 ∈ (𝐶 ∪ 𝐷) ↔ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷))
28	26, 27	bitrdi 288	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↔ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷)))
29	28	biimpa 477	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷))
30		fvres 6853	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐶 → ((𝑆 ↾ 𝐶)‘𝑥) = (𝑆‘𝑥))
31	30	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝑆 ↾ 𝐶)‘𝑥) = (𝑆‘𝑥))
32	8	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐺dom DProd (𝑆 ↾ 𝐶))
33	2, 6	fssresd 6701	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 ↾ 𝐶):𝐶⟶(SubGrp‘𝐺))
34	33	fdmd 6672	. . . . . . . . 9 ⊢ (𝜑 → dom (𝑆 ↾ 𝐶) = 𝐶)
35	34	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → dom (𝑆 ↾ 𝐶) = 𝐶)
36		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶)
37	32, 35, 36	dprdub 20000	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝑆 ↾ 𝐶)‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐶)))
38	31, 37	eqsstrrd 3957	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑆‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐶)))
39	23	lsmub1 19630	. . . . . . . 8 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺)) → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
40	10, 16, 39	syl2anc 590	. . . . . . 7 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
41	40	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
42	38, 41	sstrd 3932	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
43		fvres 6853	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐷 → ((𝑆 ↾ 𝐷)‘𝑥) = (𝑆‘𝑥))
44	43	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝑆 ↾ 𝐷)‘𝑥) = (𝑆‘𝑥))
45	14	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐺dom DProd (𝑆 ↾ 𝐷))
46	2, 12	fssresd 6701	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 ↾ 𝐷):𝐷⟶(SubGrp‘𝐺))
47	46	fdmd 6672	. . . . . . . . 9 ⊢ (𝜑 → dom (𝑆 ↾ 𝐷) = 𝐷)
48	47	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → dom (𝑆 ↾ 𝐷) = 𝐷)
49		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝑥 ∈ 𝐷)
50	45, 48, 49	dprdub 20000	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝑆 ↾ 𝐷)‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐷)))
51	44, 50	eqsstrrd 3957	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑆‘𝑥) ⊆ (𝐺 DProd (𝑆 ↾ 𝐷)))
52	23	lsmub2 19631	. . . . . . . 8 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺)) → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
53	10, 16, 52	syl2anc 590	. . . . . . 7 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
54	53	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
55	51, 54	sstrd 3932	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
56	42, 55	jaodan 965	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐷)) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
57	29, 56	syldan 597	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
58	1, 3, 25, 57	dprdlub 20001	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ⊆ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))
59	7	simprd 496	. . 3 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆))
60	13	simprd 496	. . 3 ⊢ (𝜑 → (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆))
61		dprdsubg 19999	. . . . 5 ⊢ (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
62	1, 61	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
63	23	lsmlub 19637	. . . 4 ⊢ (((𝐺 DProd (𝑆 ↾ 𝐶)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ∈ (SubGrp‘𝐺) ∧ (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺)) → (((𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)) ↔ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆)))
64	10, 16, 62, 63	syl3anc 1379	. . 3 ⊢ (𝜑 → (((𝐺 DProd (𝑆 ↾ 𝐶)) ⊆ (𝐺 DProd 𝑆) ∧ (𝐺 DProd (𝑆 ↾ 𝐷)) ⊆ (𝐺 DProd 𝑆)) ↔ ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆)))
65	59, 60, 64	mpbi2and 718	. 2 ⊢ (𝜑 → ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))) ⊆ (𝐺 DProd 𝑆))
66	58, 65	eqssd 3939	1 ⊢ (𝜑 → (𝐺 DProd 𝑆) = ((𝐺 DProd (𝑆 ↾ 𝐶)) ⊕ (𝐺 DProd (𝑆 ↾ 𝐷))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∨ wo 853 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ∪ cun 3888 ∩ cin 3889 ⊆ wss 3890 ∅c0 4268 {csn 4562 class class class wbr 5079 dom cdm 5625 ↾ cres 5627 ⟶wf 6488 ‘cfv 6492 (class class class)co 7363 0_gc0g 17400 SubGrpcsubg 19094 Cntzccntz 19288 LSSumclsm 19607 DProd cdprd 19968

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-iin 4931 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-of 7627 df-om 7814 df-1st 7938 df-2nd 7939 df-supp 8108 df-tpos 8173 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-er 8640 df-map 8772 df-ixp 8843 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-fsupp 9272 df-oi 9422 df-card 9861 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-n0 12436 df-z 12523 df-uz 12787 df-fz 13460 df-fzo 13607 df-seq 13962 df-hash 14291 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-0g 17402 df-gsum 17403 df-mre 17546 df-mrc 17547 df-acs 17549 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-mhm 18749 df-submnd 18750 df-grp 18910 df-minusg 18911 df-sbg 18912 df-mulg 19042 df-subg 19097 df-ghm 19186 df-gim 19232 df-cntz 19290 df-oppg 19319 df-lsm 19609 df-cmn 19755 df-dprd 19970

This theorem is referenced by: dprdpr 20025 dpjlsm 20029 ablfac1eulem 20047 ablfac1eu 20048 pgpfaclem1 20056

W3C validator