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 33376
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 19046 . . . . 5 (𝐴 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
21adantr 480 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝐺 ∈ Grp)
3 eqid 2733 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
43subgss 19042 . . . . . 6 (𝐴 ∈ (SubGrp‘𝐺) → 𝐴 ⊆ (Base‘𝐺))
54sselda 3930 . . . . 5 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝑋 ∈ (Base‘𝐺))
65snssd 4760 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → {𝑋} ⊆ (Base‘𝐺))
74adantr 480 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝐴 ⊆ (Base‘𝐺))
8 eqid 2733 . . . . 5 (+g𝐺) = (+g𝐺)
9 grplsmid.p . . . . 5 = (LSSum‘𝐺)
103, 8, 9lsmelvalx 19554 . . . 4 ((𝐺 ∈ Grp ∧ {𝑋} ⊆ (Base‘𝐺) ∧ 𝐴 ⊆ (Base‘𝐺)) → (𝑥 ∈ ({𝑋} 𝐴) ↔ ∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎)))
112, 6, 7, 10syl3anc 1373 . . 3 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (𝑥 ∈ ({𝑋} 𝐴) ↔ ∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎)))
12 oveq1 7359 . . . . . . 7 (𝑜 = 𝑋 → (𝑜(+g𝐺)𝑎) = (𝑋(+g𝐺)𝑎))
1312eqeq2d 2744 . . . . . 6 (𝑜 = 𝑋 → (𝑥 = (𝑜(+g𝐺)𝑎) ↔ 𝑥 = (𝑋(+g𝐺)𝑎)))
1413rexbidv 3157 . . . . 5 (𝑜 = 𝑋 → (∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
1514rexsng 4628 . . . 4 (𝑋𝐴 → (∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
1615adantl 481 . . 3 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
17 simpr 484 . . . . . 6 ((((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑎𝐴) ∧ 𝑥 = (𝑋(+g𝐺)𝑎)) → 𝑥 = (𝑋(+g𝐺)𝑎))
188subgcl 19051 . . . . . . 7 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴𝑎𝐴) → (𝑋(+g𝐺)𝑎) ∈ 𝐴)
1918ad4ant123 1173 . . . . . 6 ((((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑎𝐴) ∧ 𝑥 = (𝑋(+g𝐺)𝑎)) → (𝑋(+g𝐺)𝑎) ∈ 𝐴)
2017, 19eqeltrd 2833 . . . . 5 ((((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑎𝐴) ∧ 𝑥 = (𝑋(+g𝐺)𝑎)) → 𝑥𝐴)
2120r19.29an 3137 . . . 4 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)) → 𝑥𝐴)
22 simpll 766 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝐴 ∈ (SubGrp‘𝐺))
23 eqid 2733 . . . . . . . 8 (invg𝐺) = (invg𝐺)
2423subginvcl 19050 . . . . . . 7 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → ((invg𝐺)‘𝑋) ∈ 𝐴)
2524adantr 480 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → ((invg𝐺)‘𝑋) ∈ 𝐴)
26 simpr 484 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑥𝐴)
278subgcl 19051 . . . . . 6 ((𝐴 ∈ (SubGrp‘𝐺) ∧ ((invg𝐺)‘𝑋) ∈ 𝐴𝑥𝐴) → (((invg𝐺)‘𝑋)(+g𝐺)𝑥) ∈ 𝐴)
2822, 25, 26, 27syl3anc 1373 . . . . 5 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → (((invg𝐺)‘𝑋)(+g𝐺)𝑥) ∈ 𝐴)
29 oveq2 7360 . . . . . . 7 (𝑎 = (((invg𝐺)‘𝑋)(+g𝐺)𝑥) → (𝑋(+g𝐺)𝑎) = (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥)))
3029eqeq2d 2744 . . . . . 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 3930 . . . . . . 7 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑥 ∈ (Base‘𝐺))
353, 8, 23grpasscan1 18916 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)) → (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥)) = 𝑥)
3632, 33, 34, 35syl3anc 1373 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥)) = 𝑥)
3736eqcomd 2739 . . . . 5 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑥 = (𝑋(+g𝐺)(((invg𝐺)‘𝑋)(+g𝐺)𝑥)))
3828, 31, 37rspcedvd 3575 . . . 4 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎))
3921, 38impbida 800 . . 3 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎) ↔ 𝑥𝐴))
4011, 16, 393bitrd 305 . 2 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (𝑥 ∈ ({𝑋} 𝐴) ↔ 𝑥𝐴))
4140eqrdv 2731 1 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → ({𝑋} 𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wrex 3057  wss 3898  {csn 4575  cfv 6486  (class class class)co 7352  Basecbs 17122  +gcplusg 17163  Grpcgrp 18848  invgcminusg 18849  SubGrpcsubg 19035  LSSumclsm 19548
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  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  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-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  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-pss 3918  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-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  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-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  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-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-nn 12133  df-2 12195  df-sets 17077  df-slot 17095  df-ndx 17107  df-base 17123  df-ress 17144  df-plusg 17176  df-0g 17347  df-mgm 18550  df-sgrp 18629  df-mnd 18645  df-grp 18851  df-minusg 18852  df-subg 19038  df-lsm 19550
This theorem is referenced by:  nsgmgc  33384  nsgqusf1olem2  33386  nsgqusf1olem3  33387
  Copyright terms: Public domain W3C validator