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

Theorem lsmcomx 18466
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.
StepHypRef Expression
1 simpl1 1227 . . . . . . 7 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → 𝐺 ∈ Abel)
2 simpl2 1229 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → 𝑇𝐵)
3 simprl 754 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → 𝑦𝑇)
42, 3sseldd 3753 . . . . . . 7 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → 𝑦𝐵)
5 simpl3 1231 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → 𝑈𝐵)
6 simprr 756 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → 𝑧𝑈)
75, 6sseldd 3753 . . . . . . 7 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → 𝑧𝐵)
8 lsmcomx.v . . . . . . . 8 𝐵 = (Base‘𝐺)
9 eqid 2771 . . . . . . . 8 (+g𝐺) = (+g𝐺)
108, 9ablcom 18417 . . . . . . 7 ((𝐺 ∈ Abel ∧ 𝑦𝐵𝑧𝐵) → (𝑦(+g𝐺)𝑧) = (𝑧(+g𝐺)𝑦))
111, 4, 7, 10syl3anc 1476 . . . . . 6 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → (𝑦(+g𝐺)𝑧) = (𝑧(+g𝐺)𝑦))
1211eqeq2d 2781 . . . . 5 (((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) ∧ (𝑦𝑇𝑧𝑈)) → (𝑥 = (𝑦(+g𝐺)𝑧) ↔ 𝑥 = (𝑧(+g𝐺)𝑦)))
13122rexbidva 3204 . . . 4 ((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) → (∃𝑦𝑇𝑧𝑈 𝑥 = (𝑦(+g𝐺)𝑧) ↔ ∃𝑦𝑇𝑧𝑈 𝑥 = (𝑧(+g𝐺)𝑦)))
14 rexcom 3247 . . . 4 (∃𝑦𝑇𝑧𝑈 𝑥 = (𝑧(+g𝐺)𝑦) ↔ ∃𝑧𝑈𝑦𝑇 𝑥 = (𝑧(+g𝐺)𝑦))
1513, 14syl6bb 276 . . 3 ((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) → (∃𝑦𝑇𝑧𝑈 𝑥 = (𝑦(+g𝐺)𝑧) ↔ ∃𝑧𝑈𝑦𝑇 𝑥 = (𝑧(+g𝐺)𝑦)))
16 lsmcomx.s . . . 4 = (LSSum‘𝐺)
178, 9, 16lsmelvalx 18262 . . 3 ((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) → (𝑥 ∈ (𝑇 𝑈) ↔ ∃𝑦𝑇𝑧𝑈 𝑥 = (𝑦(+g𝐺)𝑧)))
188, 9, 16lsmelvalx 18262 . . . 4 ((𝐺 ∈ Abel ∧ 𝑈𝐵𝑇𝐵) → (𝑥 ∈ (𝑈 𝑇) ↔ ∃𝑧𝑈𝑦𝑇 𝑥 = (𝑧(+g𝐺)𝑦)))
19183com23 1120 . . 3 ((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) → (𝑥 ∈ (𝑈 𝑇) ↔ ∃𝑧𝑈𝑦𝑇 𝑥 = (𝑧(+g𝐺)𝑦)))
2015, 17, 193bitr4d 300 . 2 ((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) → (𝑥 ∈ (𝑇 𝑈) ↔ 𝑥 ∈ (𝑈 𝑇)))
2120eqrdv 2769 1 ((𝐺 ∈ Abel ∧ 𝑇𝐵𝑈𝐵) → (𝑇 𝑈) = (𝑈 𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382  w3a 1071   = wceq 1631  wcel 2145  wrex 3062  wss 3723  cfv 6030  (class class class)co 6796  Basecbs 16064  +gcplusg 16149  LSSumclsm 18256  Abelcabl 18401
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-rep 4905  ax-sep 4916  ax-nul 4924  ax-pow 4975  ax-pr 5035  ax-un 7100
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4227  df-pw 4300  df-sn 4318  df-pr 4320  df-op 4324  df-uni 4576  df-iun 4657  df-br 4788  df-opab 4848  df-mpt 4865  df-id 5158  df-xp 5256  df-rel 5257  df-cnv 5258  df-co 5259  df-dm 5260  df-rn 5261  df-res 5262  df-ima 5263  df-iota 5993  df-fun 6032  df-fn 6033  df-f 6034  df-f1 6035  df-fo 6036  df-f1o 6037  df-fv 6038  df-ov 6799  df-oprab 6800  df-mpt2 6801  df-1st 7319  df-2nd 7320  df-lsm 18258  df-cmn 18402  df-abl 18403
This theorem is referenced by:  lsmcom  18468
  Copyright terms: Public domain W3C validator