Theorem elgrplsmsn 34012

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.

Step	Hyp	Ref	Expression
1		elgrplsmsn.4	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑉)
2		elgrplsmsn.5	. . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
3		elgrplsmsn.6	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
4	3	snssd 4747	. . 3 ⊢ (𝜑 → {𝑋} ⊆ 𝐵)
5		elgrplsmsn.1	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
6		elgrplsmsn.2	. . . 4 ⊢ + = (+g‘𝐺)
7		elgrplsmsn.3	. . . 4 ⊢ ⊕ = (LSSum‘𝐺)
8	5, 6, 7	lsmelvalx 19881	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝐴 ⊆ 𝐵 ∧ {𝑋} ⊆ 𝐵) → (𝑍 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
9	1, 2, 4, 8	syl3anc 1399	. 2 ⊢ (𝜑 → (𝑍 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
10		oveq2 7448	. . . . . 6 ⊢ (𝑦 = 𝑋 → (𝑥 + 𝑦) = (𝑥 + 𝑋))
11	10	eqeq2d 2774	. . . . 5 ⊢ (𝑦 = 𝑋 → (𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
12	11	rexsng 4637	. . . 4 ⊢ (𝑋 ∈ 𝐵 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
13	3, 12	syl 18	. . 3 ⊢ (𝜑 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
14	13	rexbidv 3190	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ ∃𝑥 ∈ 𝐴 𝑍 = (𝑥 + 𝑋)))
15	9, 14	bitrd 282	1 ⊢ (𝜑 → (𝑍 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃𝑥 ∈ 𝐴 𝑍 = (𝑥 + 𝑋)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900  {csn 4588  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  +_gcplusg 17454  LSSumclsm 19875

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-lsm 19877

This theorem is used by:  lsmsnorb  34013  lsmsnpridl  34018  mxidlprm  34062