Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  grplsmid Structured version   Visualization version   GIF version

Theorem grplsmid 33479
Description: The direct sum of an element 𝑋 of a subgroup 𝐴 is the subgroup itself. (Contributed by Thierry Arnoux, 27-Jul-2024.)
Hypothesis
Ref Expression
grplsmid.p = (LSSum‘𝐺)
Assertion
Ref Expression
grplsmid ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → ({𝑋} 𝐴) = 𝐴)

Proof of Theorem grplsmid
Dummy variables 𝑥 𝑎 𝑜 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 subgrcl 19098 . . . . 5 (𝐴 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
21adantr 480 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝐺 ∈ Grp)
3 eqid 2737 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
43subgss 19094 . . . . . 6 (𝐴 ∈ (SubGrp‘𝐺) → 𝐴 ⊆ (Base‘𝐺))
54sselda 3922 . . . . 5 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝑋 ∈ (Base‘𝐺))
65snssd 4753 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → {𝑋} ⊆ (Base‘𝐺))
74adantr 480 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝐴 ⊆ (Base‘𝐺))
8 eqid 2737 . . . . 5 (+g𝐺) = (+g𝐺)
9 grplsmid.p . . . . 5 = (LSSum‘𝐺)
103, 8, 9lsmelvalx 19606 . . . 4 ((𝐺 ∈ Grp ∧ {𝑋} ⊆ (Base‘𝐺) ∧ 𝐴 ⊆ (Base‘𝐺)) → (𝑥 ∈ ({𝑋} 𝐴) ↔ ∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎)))
112, 6, 7, 10syl3anc 1374 . . 3 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (𝑥 ∈ ({𝑋} 𝐴) ↔ ∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎)))
12 oveq1 7367 . . . . . . 7 (𝑜 = 𝑋 → (𝑜(+g𝐺)𝑎) = (𝑋(+g𝐺)𝑎))
1312eqeq2d 2748 . . . . . 6 (𝑜 = 𝑋 → (𝑥 = (𝑜(+g𝐺)𝑎) ↔ 𝑥 = (𝑋(+g𝐺)𝑎)))
1413rexbidv 3162 . . . . 5 (𝑜 = 𝑋 → (∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
1514rexsng 4621 . . . 4 (𝑋𝐴 → (∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
1615adantl 481 . . 3 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
17 simpr 484 . . . . . 6 ((((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑎𝐴) ∧ 𝑥 = (𝑋(+g𝐺)𝑎)) → 𝑥 = (𝑋(+g𝐺)𝑎))
188subgcl 19103 . . . . . . 7 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴𝑎𝐴) → (𝑋(+g𝐺)𝑎) ∈ 𝐴)
1918ad4ant123 1174 . . . . . 6 ((((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑎𝐴) ∧ 𝑥 = (𝑋(+g𝐺)𝑎)) → (𝑋(+g𝐺)𝑎) ∈ 𝐴)
2017, 19eqeltrd 2837 . . . . 5 ((((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑎𝐴) ∧ 𝑥 = (𝑋(+g𝐺)𝑎)) → 𝑥𝐴)
2120r19.29an 3142 . . . 4 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)) → 𝑥𝐴)
22 simpll 767 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝐴 ∈ (SubGrp‘𝐺))
23 eqid 2737 . . . . . . . 8 (invg𝐺) = (invg𝐺)
2423subginvcl 19102 . . . . . . 7 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → ((invg𝐺)‘𝑋) ∈ 𝐴)
2524adantr 480 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → ((invg𝐺)‘𝑋) ∈ 𝐴)
26 simpr 484 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑥𝐴)
278subgcl 19103 . . . . . 6 ((𝐴 ∈ (SubGrp‘𝐺) ∧ ((invg𝐺)‘𝑋) ∈ 𝐴𝑥𝐴) → (((invg𝐺)‘𝑋)(+g𝐺)𝑥) ∈ 𝐴)
2822, 25, 26, 27syl3anc 1374 . . . . 5 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → (((invg𝐺)‘𝑋)(+g𝐺)𝑥) ∈ 𝐴)
29 oveq2 7368 . . . . . . 7 (𝑎 = (((invg𝐺)‘𝑋)(+g𝐺)𝑥) → (𝑋(+g𝐺)𝑎) = (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥)))
3029eqeq2d 2748 . . . . . 6 (𝑎 = (((invg𝐺)‘𝑋)(+g𝐺)𝑥) → (𝑥 = (𝑋(+g𝐺)𝑎) ↔ 𝑥 = (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥))))
3130adantl 481 . . . . 5 ((((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) ∧ 𝑎 = (((invg𝐺)‘𝑋)(+g𝐺)𝑥)) → (𝑥 = (𝑋(+g𝐺)𝑎) ↔ 𝑥 = (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥))))
322adantr 480 . . . . . . 7 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝐺 ∈ Grp)
335adantr 480 . . . . . . 7 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑋 ∈ (Base‘𝐺))
347sselda 3922 . . . . . . 7 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑥 ∈ (Base‘𝐺))
353, 8, 23grpasscan1 18968 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)) → (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥)) = 𝑥)
3632, 33, 34, 35syl3anc 1374 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥)) = 𝑥)
3736eqcomd 2743 . . . . 5 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑥 = (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥)))
3828, 31, 37rspcedvd 3567 . . . 4 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎))
3921, 38impbida 801 . . 3 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎) ↔ 𝑥𝐴))
4011, 16, 393bitrd 305 . 2 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (𝑥 ∈ ({𝑋} 𝐴) ↔ 𝑥𝐴))
4140eqrdv 2735 1 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → ({𝑋} 𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3062  wss 3890  {csn 4568  cfv 6492  (class class class)co 7360  Basecbs 17170  +gcplusg 17211  Grpcgrp 18900  invgcminusg 18901  SubGrpcsubg 19087  LSSumclsm 19600
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  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-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-er 8636  df-en 8887  df-dom 8888  df-sdom 8889  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-0g 17395  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-grp 18903  df-minusg 18904  df-subg 19090  df-lsm 19602
This theorem is referenced by:  nsgmgc  33487  nsgqusf1olem2  33489  nsgqusf1olem3  33490
  Copyright terms: Public domain W3C validator