Theorem lsmsnorb 34030

Description: The sumset of a group with a single element is the element's orbit by the group action. See gaorb 19554. (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 4747	. . . 4 ⊢ (𝜑 → {𝑋} ⊆ 𝐵)
5		lsmsnorb.1	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
6		lsmsnorb.3	. . . . 5 ⊢ ⊕ = (LSSum‘𝐺)
7	5, 6	lsmssv 19890	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐴 ⊆ 𝐵 ∧ {𝑋} ⊆ 𝐵) → (𝐴 ⊕ {𝑋}) ⊆ 𝐵)
8	1, 2, 4, 7	syl3anc 1399	. . 3 ⊢ (𝜑 → (𝐴 ⊕ {𝑋}) ⊆ 𝐵)
9	8	sselda 3913	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ⊕ {𝑋})) → 𝑘 ∈ 𝐵)
10		df-ec 8750	. . . 4 ⊢ [𝑋] ∼ = ( ∼ “ {𝑋})
11		imassrn 6211	. . . . . 6 ⊢ ( ∼ “ {𝑋}) ⊆ ran ∼
12		lsmsnorb.4	. . . . . . . 8 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)}
13	12	rneqi 5927	. . . . . . 7 ⊢ ran ∼ = ran {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)}
14		rnopab 5944	. . . . . . . 8 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)} = {𝑦 ∣ ∃𝑥({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)}
15		vex 3458	. . . . . . . . . . . . . 14 ⊢ 𝑥 ∈ V
16		vex 3458	. . . . . . . . . . . . . 14 ⊢ 𝑦 ∈ V
17	15, 16	prss 4779	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵)
18	17	biimpri 231	. . . . . . . . . . . 12 ⊢ ({𝑥, 𝑦} ⊆ 𝐵 → (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
19	18	simprd 501	. . . . . . . . . . 11 ⊢ ({𝑥, 𝑦} ⊆ 𝐵 → 𝑦 ∈ 𝐵)
20	19	adantr 486	. . . . . . . . . 10 ⊢ (({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦) → 𝑦 ∈ 𝐵)
21	20	exlimiv 1965	. . . . . . . . 9 ⊢ (∃𝑥({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦) → 𝑦 ∈ 𝐵)
22	21	abssi 3996	. . . . . . . 8 ⊢ {𝑦 ∣ ∃𝑥({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)} ⊆ 𝐵
23	14, 22	eqsstri 3959	. . . . . . 7 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃𝑔 ∈ 𝐴 (𝑔 + 𝑥) = 𝑦)} ⊆ 𝐵
24	13, 23	eqsstri 3959	. . . . . 6 ⊢ ran ∼ ⊆ 𝐵
25	11, 24	sstri 3922	. . . . 5 ⊢ ( ∼ “ {𝑋}) ⊆ 𝐵
26	25	a1i 11	. . . 4 ⊢ (𝜑 → ( ∼ “ {𝑋}) ⊆ 𝐵)
27	10, 26	eqsstrid 3951	. . 3 ⊢ (𝜑 → [𝑋] ∼ ⊆ 𝐵)
28	27	sselda 3913	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ [𝑋] ∼ ) → 𝑘 ∈ 𝐵)
29	12	gaorb 19554	. . . 4 ⊢ (𝑋 ∼ 𝑘 ↔ (𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵 ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘))
30	3	anim1i 627	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵))
31	30	biantrurd 542	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵) ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘)))
32		df-3an 1105	. . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵 ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘) ↔ ((𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵) ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘))
33	31, 32	bitr4di 292	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘 ↔ (𝑋 ∈ 𝐵 ∧ 𝑘 ∈ 𝐵 ∧ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘)))
34	29, 33	bitr4id 293	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑋 ∼ 𝑘 ↔ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘))
35		vex 3458	. . . 4 ⊢ 𝑘 ∈ V
36	3	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑋 ∈ 𝐵)
37		elecg 8793	. . . 4 ⊢ ((𝑘 ∈ V ∧ 𝑋 ∈ 𝐵) → (𝑘 ∈ [𝑋] ∼ ↔ 𝑋 ∼ 𝑘))
38	35, 36, 37	sylancr 599	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ [𝑋] ∼ ↔ 𝑋 ∼ 𝑘))
39		lsmsnorb.2	. . . . 5 ⊢ + = (+g‘𝐺)
40	1	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐺 ∈ Mnd)
41	2	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐴 ⊆ 𝐵)
42	5, 39, 6, 40, 41, 36	elgrplsmsn 34029	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃ℎ ∈ 𝐴 𝑘 = (ℎ + 𝑋)))
43		eqcom 2770	. . . . 5 ⊢ (𝑘 = (ℎ + 𝑋) ↔ (ℎ + 𝑋) = 𝑘)
44	43	rexbii 3113	. . . 4 ⊢ (∃ℎ ∈ 𝐴 𝑘 = (ℎ + 𝑋) ↔ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘)
45	42, 44	bitrdi 290	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ (𝐴 ⊕ {𝑋}) ↔ ∃ℎ ∈ 𝐴 (ℎ + 𝑋) = 𝑘))
46	34, 38, 45	3bitr4rd 315	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ (𝐴 ⊕ {𝑋}) ↔ 𝑘 ∈ [𝑋] ∼ ))
47	9, 28, 46	eqrdav 2762	1 ⊢ (𝜑 → (𝐴 ⊕ {𝑋}) = [𝑋] ∼ )

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  {csn 4588  {cpr 4590   class class class wbr 5106  {copab 5171  ran crn 5657   “ cima 5659  ‘cfv 6561  (class class class)co 7446  [cec 8746  Basecbs 17419  +_gcplusg 17460  Mndcmnd 18955  LSSumclsm 19881

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 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

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 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-1st 8028  df-2nd 8029  df-ec 8750  df-mgm 18848  df-sgrp 18940  df-mnd 18956  df-lsm 19883

This theorem is used by:  lsmsnorb2  34031