Theorem lsmsnorb 33352

Description: The sumset of a group with a single element is the element's orbit by the group action. See gaorb 19288. (Contributed by Thierry Arnoux, 21-Jan-2024.)

Hypotheses

Ref	Expression
lsmsnorb.1	⊢ 𝐵 = (Base‘𝐺)
lsmsnorb.2	⊢ + = (+g‘𝐺)
lsmsnorb.3	⊢ ⊕ = (LSSum‘𝐺)
lsmsnorb.4	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)}
lsmsnorb.5	⊢ (𝜑 → 𝐺 ∈ Mnd)
lsmsnorb.6	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
lsmsnorb.7	⊢ (𝜑 → 𝑋 ∈ 𝐵)

Assertion

Ref	Expression
lsmsnorb	⊢ (𝜑 → (𝐴 ⊕ {𝑋}) = [𝑋] ∼ )

Distinct variable groups:   + ,𝑔,𝑥,𝑦   𝐴,𝑔,𝑥,𝑦   𝑥,𝐵,𝑦   𝑔,𝑋,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑔)   𝐵(𝑔)   ⊕ (𝑥,𝑦,𝑔)   ∼ (𝑥,𝑦,𝑔)   𝐺(𝑥,𝑦,𝑔)

Proof of Theorem lsmsnorb

Dummy variables 𝑘 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lsmsnorb.5	. . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd)
2		lsmsnorb.6	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
3		lsmsnorb.7	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
4	3	snssd 4785	. . . 4 ⊢ (𝜑 → {𝑋} ⊆ 𝐵)
5		lsmsnorb.1	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
6		lsmsnorb.3	. . . . 5 ⊢ ⊕ = (LSSum‘𝐺)
7	5, 6	lsmssv 19622	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐴 ⊆ 𝐵 ∧ {𝑋} ⊆ 𝐵) → (𝐴 ⊕ {𝑋}) ⊆ 𝐵)
8	1, 2, 4, 7	syl3anc 1373	. . 3 ⊢ (𝜑 → (𝐴 ⊕ {𝑋}) ⊆ 𝐵)
9	8	sselda 3958	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ⊕ {𝑋})) → 𝑘 ∈ 𝐵)
10		df-ec 8719	. . . 4 ⊢ [𝑋] ∼ = ( ∼ “ {𝑋})
11		imassrn 6058	. . . . . 6 ⊢ ( ∼ “ {𝑋}) ⊆ ran ∼
12		lsmsnorb.4	. . . . . . . 8 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)}
13	12	rneqi 5917	. . . . . . 7 ⊢ ran ∼ = ran {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)}
14		rnopab 5934	. . . . . . . 8 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)} = {𝑦 ∣ ∃𝑥({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)}
15		vex 3463	. . . . . . . . . . . . . 14 ⊢ 𝑥 ∈ V
16		vex 3463	. . . . . . . . . . . . . 14 ⊢ 𝑦 ∈ V
17	15, 16	prss 4796	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵)
18	17	biimpri 228	. . . . . . . . . . . 12 ⊢ ({𝑥, 𝑦} ⊆ 𝐵 → (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
19	18	simprd 495	. . . . . . . . . . 11 ⊢ ({𝑥, 𝑦} ⊆ 𝐵 → 𝑦 ∈ 𝐵)
20	19	adantr 480	. . . . . . . . . 10 ⊢ (({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦) → 𝑦 ∈ 𝐵)
21	20	exlimiv 1930	. . . . . . . . 9 ⊢ (∃𝑥({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦) → 𝑦 ∈ 𝐵)
22	21	abssi 4045	. . . . . . . 8 ⊢ {𝑦 ∣ ∃𝑥({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)} ⊆ 𝐵
23	14, 22	eqsstri 4005	. . . . . . 7 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)} ⊆ 𝐵
24	13, 23	eqsstri 4005	. . . . . 6 ⊢ ran ∼ ⊆ 𝐵
25	11, 24	sstri 3968	. . . . 5 ⊢ ( ∼ “ {𝑋}) ⊆ 𝐵
26	25	a1i 11	. . . 4 ⊢ (𝜑 → ( ∼ “ {𝑋}) ⊆ 𝐵)
27	10, 26	eqsstrid 3997	. . 3 ⊢ (𝜑 → [𝑋] ∼ ⊆ 𝐵)
28	27	sselda 3958	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ [𝑋] ∼ ) → 𝑘 ∈ 𝐵)
29	12	gaorb 19288	. . . 4 ⊢ (𝑋 ∼ 𝑘 ↔ (𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵 ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘))
30	3	anim1i 615	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵))
31	30	biantrurd 532	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵) ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘)))
32		df-3an 1088	. . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵 ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘) ↔ ((𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵) ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘))
33	31, 32	bitr4di 289	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘 ↔ (𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵 ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘)))
34	29, 33	bitr4id 290	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑋 ∼ 𝑘 ↔ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘))
35		vex 3463	. . . 4 ⊢ 𝑘 ∈ V
36	3	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑋 ∈ 𝐵)
37		elecg 8761	. . . 4 ⊢ ((𝑘 ∈ V ∧ 𝑋 ∈ 𝐵) → (𝑘 ∈ [𝑋] ∼ ↔ 𝑋 ∼ 𝑘))
38	35, 36, 37	sylancr 587	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ [𝑋] ∼ ↔ 𝑋 ∼ 𝑘))
39		lsmsnorb.2	. . . . 5 ⊢ + = (+g‘𝐺)
40	1	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐺 ∈ Mnd)
41	2	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐴 ⊆ 𝐵)
42	5, 39, 6, 40, 41, 36	elgrplsmsn 33351	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃ℎ ∈ 𝐴 𝑘 = (ℎ + 𝑋)))
43		eqcom 2742	. . . . 5 ⊢ (𝑘 = (ℎ + 𝑋) ↔ (ℎ + 𝑋) = 𝑘)
44	43	rexbii 3083	. . . 4 ⊢ (∃ℎ ∈ 𝐴 𝑘 = (ℎ + 𝑋) ↔ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘)
45	42, 44	bitrdi 287	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘))
46	34, 38, 45	3bitr4rd 312	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ (𝐴 ⊕ {𝑋}) ↔ 𝑘 ∈ [𝑋] ∼ ))
47	9, 28, 46	eqrdav 2734	1 ⊢ (𝜑 → (𝐴 ⊕ {𝑋}) = [𝑋] ∼ )

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2108  {cab 2713  ∃wrex 3060  Vcvv 3459   ⊆ wss 3926  {csn 4601  {cpr 4603   class class class wbr 5119  {copab 5181  ran crn 5655   “ cima 5657  ‘cfv 6530  (class class class)co 7403  [cec 8715  Basecbs 17226  +_gcplusg 17269  Mndcmnd 18710  LSSumclsm 19613

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7727

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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6483  df-fun 6532  df-fn 6533  df-f 6534  df-f1 6535  df-fo 6536  df-f1o 6537  df-fv 6538  df-ov 7406  df-oprab 7407  df-mpo 7408  df-1st 7986  df-2nd 7987  df-ec 8719  df-mgm 18616  df-sgrp 18695  df-mnd 18711  df-lsm 19615

This theorem is referenced by:  lsmsnorb2  33353