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

Theorem elgrplsmsn 33366
Description: Membership in a sumset with a singleton for a group operation. (Contributed by Thierry Arnoux, 21-Jan-2024.)
Hypotheses
Ref Expression
elgrplsmsn.1 𝐵 = (Base‘𝐺)
elgrplsmsn.2 + = (+g𝐺)
elgrplsmsn.3 = (LSSum‘𝐺)
elgrplsmsn.4 (𝜑𝐺𝑉)
elgrplsmsn.5 (𝜑𝐴𝐵)
elgrplsmsn.6 (𝜑𝑋𝐵)
Assertion
Ref Expression
elgrplsmsn (𝜑 → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴 𝑍 = (𝑥 + 𝑋)))
Distinct variable groups:   𝑥, +   𝑥,𝐴   𝑥,𝐵   𝑥,𝐺   𝑥,𝑋   𝑥,𝑍   𝜑,𝑥
Allowed substitution hints:   (𝑥)   𝑉(𝑥)

Proof of Theorem elgrplsmsn
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elgrplsmsn.4 . . 3 (𝜑𝐺𝑉)
2 elgrplsmsn.5 . . 3 (𝜑𝐴𝐵)
3 elgrplsmsn.6 . . . 4 (𝜑𝑋𝐵)
43snssd 4762 . . 3 (𝜑 → {𝑋} ⊆ 𝐵)
5 elgrplsmsn.1 . . . 4 𝐵 = (Base‘𝐺)
6 elgrplsmsn.2 . . . 4 + = (+g𝐺)
7 elgrplsmsn.3 . . . 4 = (LSSum‘𝐺)
85, 6, 7lsmelvalx 19562 . . 3 ((𝐺𝑉𝐴𝐵 ∧ {𝑋} ⊆ 𝐵) → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
91, 2, 4, 8syl3anc 1373 . 2 (𝜑 → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
10 oveq2 7363 . . . . . 6 (𝑦 = 𝑋 → (𝑥 + 𝑦) = (𝑥 + 𝑋))
1110eqeq2d 2744 . . . . 5 (𝑦 = 𝑋 → (𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
1211rexsng 4630 . . . 4 (𝑋𝐵 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
133, 12syl 17 . . 3 (𝜑 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
1413rexbidv 3158 . 2 (𝜑 → (∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ ∃𝑥𝐴 𝑍 = (𝑥 + 𝑋)))
159, 14bitrd 279 1 (𝜑 → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴 𝑍 = (𝑥 + 𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1541  wcel 2113  wrex 3058  wss 3899  {csn 4577  cfv 6489  (class class class)co 7355  Basecbs 17130  +gcplusg 17171  LSSumclsm 19556
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 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677
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 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-1st 7930  df-2nd 7931  df-lsm 19558
This theorem is referenced by:  lsmsnorb  33367  lsmsnpridl  33374  mxidlprm  33446
  Copyright terms: Public domain W3C validator