MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eqglact Structured version   Visualization version   GIF version

Theorem eqglact 18326
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.
StepHypRef Expression
1 eqger.x . . . . . . 7 𝑋 = (Base‘𝐺)
2 eqid 2801 . . . . . . 7 (invg𝐺) = (invg𝐺)
3 eqglact.3 . . . . . . 7 + = (+g𝐺)
4 eqger.r . . . . . . 7 = (𝐺 ~QG 𝑌)
51, 2, 3, 4eqgval 18324 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑌𝑋) → (𝐴 𝑥 ↔ (𝐴𝑋𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌)))
6 3anass 1092 . . . . . 6 ((𝐴𝑋𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌) ↔ (𝐴𝑋 ∧ (𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌)))
75, 6syl6bb 290 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑌𝑋) → (𝐴 𝑥 ↔ (𝐴𝑋 ∧ (𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌))))
87baibd 543 . . . 4 (((𝐺 ∈ Grp ∧ 𝑌𝑋) ∧ 𝐴𝑋) → (𝐴 𝑥 ↔ (𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌)))
983impa 1107 . . 3 ((𝐺 ∈ Grp ∧ 𝑌𝑋𝐴𝑋) → (𝐴 𝑥 ↔ (𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌)))
109abbidv 2865 . 2 ((𝐺 ∈ Grp ∧ 𝑌𝑋𝐴𝑋) → {𝑥𝐴 𝑥} = {𝑥 ∣ (𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌)})
11 dfec2 8279 . . 3 (𝐴𝑋 → [𝐴] = {𝑥𝐴 𝑥})
12113ad2ant3 1132 . 2 ((𝐺 ∈ Grp ∧ 𝑌𝑋𝐴𝑋) → [𝐴] = {𝑥𝐴 𝑥})
13 eqid 2801 . . . . . . . . 9 (𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥))) = (𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))
1413, 1, 3, 2grplactcnv 18197 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘𝐴):𝑋1-1-onto𝑋((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = ((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘((invg𝐺)‘𝐴))))
1514simprd 499 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = ((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘((invg𝐺)‘𝐴)))
1613, 1grplactfval 18195 . . . . . . . . 9 (𝐴𝑋 → ((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = (𝑥𝑋 ↦ (𝐴 + 𝑥)))
1716adantl 485 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = (𝑥𝑋 ↦ (𝐴 + 𝑥)))
1817cnveqd 5714 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘𝐴) = (𝑥𝑋 ↦ (𝐴 + 𝑥)))
191, 2grpinvcl 18146 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((invg𝐺)‘𝐴) ∈ 𝑋)
2013, 1grplactfval 18195 . . . . . . . 8 (((invg𝐺)‘𝐴) ∈ 𝑋 → ((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘((invg𝐺)‘𝐴)) = (𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)))
2119, 20syl 17 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝑔𝑋 ↦ (𝑥𝑋 ↦ (𝑔 + 𝑥)))‘((invg𝐺)‘𝐴)) = (𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)))
2215, 18, 213eqtr3d 2844 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝑥𝑋 ↦ (𝐴 + 𝑥)) = (𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)))
2322cnveqd 5714 . . . . 5 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝑥𝑋 ↦ (𝐴 + 𝑥)) = (𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)))
24233adant2 1128 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝑋𝐴𝑋) → (𝑥𝑋 ↦ (𝐴 + 𝑥)) = (𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)))
2524imaeq1d 5899 . . 3 ((𝐺 ∈ Grp ∧ 𝑌𝑋𝐴𝑋) → ((𝑥𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌) = ((𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)) “ 𝑌))
26 imacnvcnv 6034 . . 3 ((𝑥𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌) = ((𝑥𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌)
27 eqid 2801 . . . . 5 (𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)) = (𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥))
2827mptpreima 6063 . . . 4 ((𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)) “ 𝑌) = {𝑥𝑋 ∣ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌}
29 df-rab 3118 . . . 4 {𝑥𝑋 ∣ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌} = {𝑥 ∣ (𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌)}
3028, 29eqtri 2824 . . 3 ((𝑥𝑋 ↦ (((invg𝐺)‘𝐴) + 𝑥)) “ 𝑌) = {𝑥 ∣ (𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌)}
3125, 26, 303eqtr3g 2859 . 2 ((𝐺 ∈ Grp ∧ 𝑌𝑋𝐴𝑋) → ((𝑥𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌) = {𝑥 ∣ (𝑥𝑋 ∧ (((invg𝐺)‘𝐴) + 𝑥) ∈ 𝑌)})
3210, 12, 313eqtr4d 2846 1 ((𝐺 ∈ Grp ∧ 𝑌𝑋𝐴𝑋) → [𝐴] = ((𝑥𝑋 ↦ (𝐴 + 𝑥)) “ 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2112  {cab 2779  {crab 3113  wss 3884   class class class wbr 5033  cmpt 5113  ccnv 5522  cima 5526  1-1-ontowf1o 6327  cfv 6328  (class class class)co 7139  [cec 8274  Basecbs 16478  +gcplusg 16560  Grpcgrp 18098  invgcminusg 18099   ~QG cqg 18270
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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-rep 5157  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rex 3115  df-reu 3116  df-rmo 3117  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-iun 4886  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-riota 7097  df-ov 7142  df-oprab 7143  df-mpo 7144  df-ec 8278  df-0g 16710  df-mgm 17847  df-sgrp 17896  df-mnd 17907  df-grp 18101  df-minusg 18102  df-eqg 18273
This theorem is referenced by:  eqgen  18328  cldsubg  22719  tgpconncompeqg  22720  snclseqg  22724
  Copyright terms: Public domain W3C validator