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 33361
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 4773 . . 3 (𝜑 → {𝑋} ⊆ 𝐵)
5 elgrplsmsn.1 . . . 4 𝐵 = (Base‘𝐺)
6 elgrplsmsn.2 . . . 4 + = (+g𝐺)
7 elgrplsmsn.3 . . . 4 = (LSSum‘𝐺)
85, 6, 7lsmelvalx 19570 . . 3 ((𝐺𝑉𝐴𝐵 ∧ {𝑋} ⊆ 𝐵) → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
91, 2, 4, 8syl3anc 1373 . 2 (𝜑 → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
10 oveq2 7395 . . . . . 6 (𝑦 = 𝑋 → (𝑥 + 𝑦) = (𝑥 + 𝑋))
1110eqeq2d 2740 . . . . 5 (𝑦 = 𝑋 → (𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
1211rexsng 4640 . . . 4 (𝑋𝐵 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
133, 12syl 17 . . 3 (𝜑 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
1413rexbidv 3157 . 2 (𝜑 → (∃𝑥𝐴𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ ∃𝑥𝐴 𝑍 = (𝑥 + 𝑋)))
159, 14bitrd 279 1 (𝜑 → (𝑍 ∈ (𝐴 {𝑋}) ↔ ∃𝑥𝐴 𝑍 = (𝑥 + 𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1540  wcel 2109  wrex 3053  wss 3914  {csn 4589  cfv 6511  (class class class)co 7387  Basecbs 17179  +gcplusg 17220  LSSumclsm 19564
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-lsm 19566
This theorem is referenced by:  lsmsnorb  33362  lsmsnpridl  33369  mxidlprm  33441
  Copyright terms: Public domain W3C validator