Theorem eqglact 14005

Description: A left coset can be expressed as the image of a left action. (Contributed by Mario Carneiro, 20-Sep-2015.)

Hypotheses

Ref	Expression
eqger.x	⊢ 𝑋 = (Base‘𝐺)
eqger.r	⊢ ∼ = (𝐺 ~QG 𝑌)
eqglact.3	⊢ + = (+g‘𝐺)

Assertion

Ref	Expression
eqglact	⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → [𝐴] ∼ = ((𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌))

Distinct variable groups:   𝑥, +   𝑥, ∼   𝑥,𝐺   𝑥,𝑋   𝑥,𝐴   𝑥,𝑌

Proof of Theorem eqglact

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqger.x	. . . . . . 7 ⊢ 𝑋 = (Base‘𝐺)
2		eqid 2238	. . . . . . 7 ⊢ (invg‘𝐺) = (invg‘𝐺)
3		eqglact.3	. . . . . . 7 ⊢ + = (+g‘𝐺)
4		eqger.r	. . . . . . 7 ⊢ ∼ = (𝐺 ~QG 𝑌)
5	1, 2, 3, 4	eqgval 14003	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋) → (𝐴 ∼ 𝑥 ↔ (𝐴 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌)))
6		3anass 1013	. . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌) ↔ (𝐴 ∈ 𝑋 ∧ (𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌)))
7	5, 6	bitrdi 196	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋) → (𝐴 ∼ 𝑥 ↔ (𝐴 ∈ 𝑋 ∧ (𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌))))
8	7	baibd 935	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐴 ∼ 𝑥 ↔ (𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌)))
9	8	3impa 1225	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∼ 𝑥 ↔ (𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌)))
10	9	abbidv 2358	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → {𝑥 ∣ 𝐴 ∼ 𝑥} = {𝑥 ∣ (𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌)})
11		dfec2 6800	. . 3 ⊢ (𝐴 ∈ 𝑋 → [𝐴] ∼ = {𝑥 ∣ 𝐴 ∼ 𝑥})
12	11	3ad2ant3 1051	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → [𝐴] ∼ = {𝑥 ∣ 𝐴 ∼ 𝑥})
13		eqid 2238	. . . . . . . . 9 ⊢ (𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥))) = (𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))
14	13, 1, 3, 2	grplactcnv 13884	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘𝐴):𝑋–1-1-onto→𝑋 ∧ ◡((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = ((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘((invg‘𝐺)‘𝐴))))
15	14	simprd 114	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ◡((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = ((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘((invg‘𝐺)‘𝐴)))
16	13, 1	grplactfval 13883	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑋 → ((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)))
17	16	adantl 277	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = (𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)))
18	17	cnveqd 4951	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ◡((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = ◡(𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)))
19	1, 2	grpinvcl 13830	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((invg‘𝐺)‘𝐴) ∈ 𝑋)
20	13, 1	grplactfval 13883	. . . . . . . 8 ⊢ (((invg‘𝐺)‘𝐴) ∈ 𝑋 → ((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘((invg‘𝐺)‘𝐴)) = (𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)))
21	19, 20	syl 14	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝑔 ∈ 𝑋 ↦ (𝑥 ∈ 𝑋 ↦ (𝑔 + 𝑥)))‘((invg‘𝐺)‘𝐴)) = (𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)))
22	15, 18, 21	3eqtr3d 2279	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ◡(𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) = (𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)))
23	22	cnveqd 4951	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ◡◡(𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) = ◡(𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)))
24	23	3adant2 1047	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ◡◡(𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) = ◡(𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)))
25	24	imaeq1d 5120	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (◡◡(𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌) = (◡(𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)) “ 𝑌))
26		imacnvcnv 5247	. . 3 ⊢ (◡◡(𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌) = ((𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌)
27		eqid 2238	. . . . 5 ⊢ (𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)) = (𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥))
28	27	mptpreima 5276	. . . 4 ⊢ (◡(𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)) “ 𝑌) = {𝑥 ∈ 𝑋 ∣ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌}
29		df-rab 2537	. . . 4 ⊢ {𝑥 ∈ 𝑋 ∣ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌} = {𝑥 ∣ (𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌)}
30	28, 29	eqtri 2259	. . 3 ⊢ (◡(𝑥 ∈ 𝑋 ↦ (((invg‘𝐺)‘𝐴) + 𝑥)) “ 𝑌) = {𝑥 ∣ (𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌)}
31	25, 26, 30	3eqtr3g 2294	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌) = {𝑥 ∣ (𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐴) + 𝑥) ∈ 𝑌)})
32	10, 12, 31	3eqtr4d 2281	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → [𝐴] ∼ = ((𝑥 ∈ 𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  {cab 2224  {crab 2532   ⊆ wss 3220   class class class wbr 4125   ↦ cmpt 4187  ^◡ccnv 4768   “ cima 4772  –1-1-onto→wf1o 5371  ‘cfv 5372  (class class class)co 6075  [cec 6795  Basecbs 13330  +_gcplusg 13408  Grpcgrp 13782  inv_gcminusg 13783   ~_QG cqg 13949

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-ec 6799  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-minusg 13786  df-eqg 13952

This theorem is referenced by:  eqgen  14007