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 33496
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 19073 . . . . 5 (𝐴 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
21adantr 480 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝐺 ∈ Grp)
3 eqid 2737 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
43subgss 19069 . . . . . 6 (𝐴 ∈ (SubGrp‘𝐺) → 𝐴 ⊆ (Base‘𝐺))
54sselda 3935 . . . . 5 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝑋 ∈ (Base‘𝐺))
65snssd 4767 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → {𝑋} ⊆ (Base‘𝐺))
74adantr 480 . . . 4 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → 𝐴 ⊆ (Base‘𝐺))
8 eqid 2737 . . . . 5 (+g𝐺) = (+g𝐺)
9 grplsmid.p . . . . 5 = (LSSum‘𝐺)
103, 8, 9lsmelvalx 19581 . . . 4 ((𝐺 ∈ Grp ∧ {𝑋} ⊆ (Base‘𝐺) ∧ 𝐴 ⊆ (Base‘𝐺)) → (𝑥 ∈ ({𝑋} 𝐴) ↔ ∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎)))
112, 6, 7, 10syl3anc 1374 . . 3 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (𝑥 ∈ ({𝑋} 𝐴) ↔ ∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎)))
12 oveq1 7375 . . . . . . 7 (𝑜 = 𝑋 → (𝑜(+g𝐺)𝑎) = (𝑋(+g𝐺)𝑎))
1312eqeq2d 2748 . . . . . 6 (𝑜 = 𝑋 → (𝑥 = (𝑜(+g𝐺)𝑎) ↔ 𝑥 = (𝑋(+g𝐺)𝑎)))
1413rexbidv 3162 . . . . 5 (𝑜 = 𝑋 → (∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
1514rexsng 4635 . . . 4 (𝑋𝐴 → (∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
1615adantl 481 . . 3 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → (∃𝑜 ∈ {𝑋}∃𝑎𝐴 𝑥 = (𝑜(+g𝐺)𝑎) ↔ ∃𝑎𝐴 𝑥 = (𝑋(+g𝐺)𝑎)))
17 simpr 484 . . . . . 6 ((((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑎𝐴) ∧ 𝑥 = (𝑋(+g𝐺)𝑎)) → 𝑥 = (𝑋(+g𝐺)𝑎))
188subgcl 19078 . . . . . . 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 19077 . . . . . . 7 ((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) → ((invg𝐺)‘𝑋) ∈ 𝐴)
2524adantr 480 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → ((invg𝐺)‘𝑋) ∈ 𝐴)
26 simpr 484 . . . . . 6 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑥𝐴)
278subgcl 19078 . . . . . 6 ((𝐴 ∈ (SubGrp‘𝐺) ∧ ((invg𝐺)‘𝑋) ∈ 𝐴𝑥𝐴) → (((invg𝐺)‘𝑋)(+g𝐺)𝑥) ∈ 𝐴)
2822, 25, 26, 27syl3anc 1374 . . . . 5 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → (((invg𝐺)‘𝑋)(+g𝐺)𝑥) ∈ 𝐴)
29 oveq2 7376 . . . . . . 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 3935 . . . . . . 7 (((𝐴 ∈ (SubGrp‘𝐺) ∧ 𝑋𝐴) ∧ 𝑥𝐴) → 𝑥 ∈ (Base‘𝐺))
353, 8, 23grpasscan1 18943 . . . . . . 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 3580 . . . 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 3903  {csn 4582  cfv 6500  (class class class)co 7368  Basecbs 17148  +gcplusg 17189  Grpcgrp 18875  invgcminusg 18876  SubGrpcsubg 19062  LSSumclsm 19575
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115
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 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-sets 17103  df-slot 17121  df-ndx 17133  df-base 17149  df-ress 17170  df-plusg 17202  df-0g 17373  df-mgm 18577  df-sgrp 18656  df-mnd 18672  df-grp 18878  df-minusg 18879  df-subg 19065  df-lsm 19577
This theorem is referenced by:  nsgmgc  33504  nsgqusf1olem2  33506  nsgqusf1olem3  33507
  Copyright terms: Public domain W3C validator