Theorem elgrplsmsn 33468

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 4753	. . 3 ⊢ (𝜑 → {𝑋} ⊆ 𝐵)
5		elgrplsmsn.1	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
6		elgrplsmsn.2	. . . 4 ⊢ + = (+g‘𝐺)
7		elgrplsmsn.3	. . . 4 ⊢ ⊕ = (LSSum‘𝐺)
8	5, 6, 7	lsmelvalx 19609	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝐴 ⊆ 𝐵 ∧ {𝑋} ⊆ 𝐵) → (𝑍 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
9	1, 2, 4, 8	syl3anc 1374	. 2 ⊢ (𝜑 → (𝑍 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦)))
10		oveq2 7369	. . . . . 6 ⊢ (𝑦 = 𝑋 → (𝑥 + 𝑦) = (𝑥 + 𝑋))
11	10	eqeq2d 2748	. . . . 5 ⊢ (𝑦 = 𝑋 → (𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
12	11	rexsng 4621	. . . 4 ⊢ (𝑋 ∈ 𝐵 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
13	3, 12	syl 17	. . 3 ⊢ (𝜑 → (∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ 𝑍 = (𝑥 + 𝑋)))
14	13	rexbidv 3162	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ {𝑋}𝑍 = (𝑥 + 𝑦) ↔ ∃𝑥 ∈ 𝐴 𝑍 = (𝑥 + 𝑋)))
15	9, 14	bitrd 279	1 ⊢ (𝜑 → (𝑍 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃𝑥 ∈ 𝐴 𝑍 = (𝑥 + 𝑋)))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542   ∈ wcel 2114  ∃wrex 3062   ⊆ wss 3890  {csn 4568  ‘cfv 6493  (class class class)co 7361  Basecbs 17173  +_gcplusg 17214  LSSumclsm 19603

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 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  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-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-1st 7936  df-2nd 7937  df-lsm 19605

This theorem is referenced by:  lsmsnorb  33469  lsmsnpridl  33476  mxidlprm  33548