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 33810
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 4750 . . 3 (𝜑 → {𝑋} ⊆ 𝐵)
5 elgrplsmsn.1 . . . 4 𝐵 = (Base‘𝐺)
6 elgrplsmsn.2 . . . 4 + = (+g𝐺)
7 elgrplsmsn.3 . . . 4 = (LSSum‘𝐺)
85, 6, 7lsmelvalx 19768 . . 3 ((𝐺𝑉𝐴𝐵 ∧ {𝑋} ⊆ 𝐵) → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
91, 2, 4, 8syl3anc 1398 . 2 (𝜑 → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
10 oveq2 7424 . . . . . 6 (𝑦 = 𝑋 → (𝑥 + 𝑦) = (𝑥 + 𝑋))
1110eqeq2d 2773 . . . . 5 (𝑦 = 𝑋 → (𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
1211rexsng 4640 . . . 4 (𝑋𝐵 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
133, 12syl 18 . . 3 (𝜑 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
1413rexbidv 3188 . 2 (𝜑 → (∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ ∃𝑥𝐴 𝑍 = (𝑥 + 𝑋)))
159, 14bitrd 282 1 (𝜑 → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴 𝑍 = (𝑥 + 𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209   = wceq 1570  wcel 2145  wrex 3088  wss 3902  {csn 4587  cfv 6537  (class class class)co 7416  Basecbs 17305  +gcplusg 17346  LSSumclsm 19762
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-lsm 19764
This theorem is used by:  lsmsnorb  33811  lsmsnpridl  33816  mxidlprm  33860
  Copyright terms: Public domain W3C validator