Theorem lsmcomx 19770

Description: Subgroup sum commutes (extended domain version). (Contributed by NM, 25-Feb-2014.) (Revised by Mario Carneiro, 19-Apr-2016.)

Hypotheses

Ref	Expression
lsmcomx.v	⊢ 𝐵 = (Base‘𝐺)
lsmcomx.s	⊢ ⊕ = (LSSum‘𝐺)

Assertion

Ref	Expression
lsmcomx	⊢ ((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇))

Proof of Theorem lsmcomx

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl1 1192	. . . . . . 7 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → 𝐺 ∈ Abel)
2		simpl2 1193	. . . . . . . 8 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → 𝑇 ⊆ 𝐵)
3		simprl 770	. . . . . . . 8 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → 𝑦 ∈ 𝑇)
4	2, 3	sseldd 3931	. . . . . . 7 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → 𝑦 ∈ 𝐵)
5		simpl3 1194	. . . . . . . 8 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → 𝑈 ⊆ 𝐵)
6		simprr 772	. . . . . . . 8 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → 𝑧 ∈ 𝑈)
7	5, 6	sseldd 3931	. . . . . . 7 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → 𝑧 ∈ 𝐵)
8		lsmcomx.v	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐺)
9		eqid 2733	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
10	8, 9	ablcom 19713	. . . . . . 7 ⊢ ((𝐺 ∈ Abel ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦(+g‘𝐺)𝑧) = (𝑧(+g‘𝐺)𝑦))
11	1, 4, 7, 10	syl3anc 1373	. . . . . 6 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → (𝑦(+g‘𝐺)𝑧) = (𝑧(+g‘𝐺)𝑦))
12	11	eqeq2d 2744	. . . . 5 ⊢ (((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ (𝑦 ∈ 𝑇 ∧ 𝑧 ∈ 𝑈)) → (𝑥 = (𝑦(+g‘𝐺)𝑧) ↔ 𝑥 = (𝑧(+g‘𝐺)𝑦)))
13	12	2rexbidva 3196	. . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧) ↔ ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑧(+g‘𝐺)𝑦)))
14		rexcom 3262	. . . 4 ⊢ (∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑧(+g‘𝐺)𝑦) ↔ ∃𝑧 ∈ 𝑈 ∃𝑦 ∈ 𝑇 𝑥 = (𝑧(+g‘𝐺)𝑦))
15	13, 14	bitrdi 287	. . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧) ↔ ∃𝑧 ∈ 𝑈 ∃𝑦 ∈ 𝑇 𝑥 = (𝑧(+g‘𝐺)𝑦)))
16		lsmcomx.s	. . . 4 ⊢ ⊕ = (LSSum‘𝐺)
17	8, 9, 16	lsmelvalx 19554	. . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑦 ∈ 𝑇 ∃𝑧 ∈ 𝑈 𝑥 = (𝑦(+g‘𝐺)𝑧)))
18	8, 9, 16	lsmelvalx 19554	. . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑈 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑥 ∈ (𝑈 ⊕ 𝑇) ↔ ∃𝑧 ∈ 𝑈 ∃𝑦 ∈ 𝑇 𝑥 = (𝑧(+g‘𝐺)𝑦)))
19	18	3com23 1126	. . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑈 ⊕ 𝑇) ↔ ∃𝑧 ∈ 𝑈 ∃𝑦 ∈ 𝑇 𝑥 = (𝑧(+g‘𝐺)𝑦)))
20	15, 17, 19	3bitr4d 311	. 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ 𝑥 ∈ (𝑈 ⊕ 𝑇)))
21	20	eqrdv 2731	1 ⊢ ((𝐺 ∈ Abel ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∃wrex 3057   ⊆ wss 3898  ‘cfv 6486  (class class class)co 7352  Basecbs 17122  +_gcplusg 17163  LSSumclsm 19548  Abelcabl 19695

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-1st 7927  df-2nd 7928  df-lsm 19550  df-cmn 19696  df-abl 19697

This theorem is referenced by:  lsmcom  19772