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

Theorem grplactcnv 19019
Description: The left group action of element 𝐴 of group 𝐺 maps the underlying set 𝑋 of 𝐺 one-to-one onto itself. (Contributed by Paul Chapman, 18-Mar-2008.) (Proof shortened by Mario Carneiro, 14-Aug-2015.)
Hypotheses
Ref Expression
grplact.1 𝐹 = (𝑔𝑋 ↦ (𝑎𝑋 ↦ (𝑔 + 𝑎)))
grplact.2 𝑋 = (Base‘𝐺)
grplact.3 + = (+g𝐺)
grplactcnv.4 𝐼 = (invg𝐺)
Assertion
Ref Expression
grplactcnv ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐹𝐴):𝑋1-1-onto𝑋(𝐹𝐴) = (𝐹‘(𝐼𝐴))))
Distinct variable groups:   𝑔,𝑎,𝐴   𝐺,𝑎,𝑔   𝐼,𝑎,𝑔   + ,𝑎,𝑔   𝑋,𝑎,𝑔
Allowed substitution hints:   𝐹(𝑔,𝑎)

Proof of Theorem grplactcnv
Dummy variable 𝑏 is distinct from all other variables.
StepHypRef Expression
1 eqid 2736 . . 3 (𝑎𝑋 ↦ (𝐴 + 𝑎)) = (𝑎𝑋 ↦ (𝐴 + 𝑎))
2 grplact.2 . . . . 5 𝑋 = (Base‘𝐺)
3 grplact.3 . . . . 5 + = (+g𝐺)
42, 3grpcl 18917 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋𝑎𝑋) → (𝐴 + 𝑎) ∈ 𝑋)
543expa 1119 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑎𝑋) → (𝐴 + 𝑎) ∈ 𝑋)
6 grplactcnv.4 . . . . 5 𝐼 = (invg𝐺)
72, 6grpinvcl 18963 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐼𝐴) ∈ 𝑋)
82, 3grpcl 18917 . . . . 5 ((𝐺 ∈ Grp ∧ (𝐼𝐴) ∈ 𝑋𝑏𝑋) → ((𝐼𝐴) + 𝑏) ∈ 𝑋)
983expa 1119 . . . 4 (((𝐺 ∈ Grp ∧ (𝐼𝐴) ∈ 𝑋) ∧ 𝑏𝑋) → ((𝐼𝐴) + 𝑏) ∈ 𝑋)
107, 9syldanl 603 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑏𝑋) → ((𝐼𝐴) + 𝑏) ∈ 𝑋)
11 eqcom 2743 . . . . 5 (𝑎 = ((𝐼𝐴) + 𝑏) ↔ ((𝐼𝐴) + 𝑏) = 𝑎)
12 eqid 2736 . . . . . . . . . 10 (0g𝐺) = (0g𝐺)
132, 3, 12, 6grplinv 18965 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐼𝐴) + 𝐴) = (0g𝐺))
1413adantr 480 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → ((𝐼𝐴) + 𝐴) = (0g𝐺))
1514oveq1d 7382 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (((𝐼𝐴) + 𝐴) + 𝑎) = ((0g𝐺) + 𝑎))
16 simpll 767 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝐺 ∈ Grp)
177adantr 480 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (𝐼𝐴) ∈ 𝑋)
18 simplr 769 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝐴𝑋)
19 simprl 771 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝑎𝑋)
202, 3grpass 18918 . . . . . . . 8 ((𝐺 ∈ Grp ∧ ((𝐼𝐴) ∈ 𝑋𝐴𝑋𝑎𝑋)) → (((𝐼𝐴) + 𝐴) + 𝑎) = ((𝐼𝐴) + (𝐴 + 𝑎)))
2116, 17, 18, 19, 20syl13anc 1375 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (((𝐼𝐴) + 𝐴) + 𝑎) = ((𝐼𝐴) + (𝐴 + 𝑎)))
222, 3, 12grplid 18943 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑎𝑋) → ((0g𝐺) + 𝑎) = 𝑎)
2322ad2ant2r 748 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → ((0g𝐺) + 𝑎) = 𝑎)
2415, 21, 233eqtr3rd 2780 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝑎 = ((𝐼𝐴) + (𝐴 + 𝑎)))
2524eqeq2d 2747 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (((𝐼𝐴) + 𝑏) = 𝑎 ↔ ((𝐼𝐴) + 𝑏) = ((𝐼𝐴) + (𝐴 + 𝑎))))
2611, 25bitrid 283 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (𝑎 = ((𝐼𝐴) + 𝑏) ↔ ((𝐼𝐴) + 𝑏) = ((𝐼𝐴) + (𝐴 + 𝑎))))
27 simprr 773 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝑏𝑋)
285adantrr 718 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (𝐴 + 𝑎) ∈ 𝑋)
292, 3grplcan 18976 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑏𝑋 ∧ (𝐴 + 𝑎) ∈ 𝑋 ∧ (𝐼𝐴) ∈ 𝑋)) → (((𝐼𝐴) + 𝑏) = ((𝐼𝐴) + (𝐴 + 𝑎)) ↔ 𝑏 = (𝐴 + 𝑎)))
3016, 27, 28, 17, 29syl13anc 1375 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (((𝐼𝐴) + 𝑏) = ((𝐼𝐴) + (𝐴 + 𝑎)) ↔ 𝑏 = (𝐴 + 𝑎)))
3126, 30bitrd 279 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (𝑎 = ((𝐼𝐴) + 𝑏) ↔ 𝑏 = (𝐴 + 𝑎)))
321, 5, 10, 31f1ocnv2d 7620 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝑎𝑋 ↦ (𝐴 + 𝑎)):𝑋1-1-onto𝑋(𝑎𝑋 ↦ (𝐴 + 𝑎)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏))))
33 grplact.1 . . . . . 6 𝐹 = (𝑔𝑋 ↦ (𝑎𝑋 ↦ (𝑔 + 𝑎)))
3433, 2grplactfval 19017 . . . . 5 (𝐴𝑋 → (𝐹𝐴) = (𝑎𝑋 ↦ (𝐴 + 𝑎)))
3534adantl 481 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐹𝐴) = (𝑎𝑋 ↦ (𝐴 + 𝑎)))
3635f1oeq1d 6775 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐹𝐴):𝑋1-1-onto𝑋 ↔ (𝑎𝑋 ↦ (𝐴 + 𝑎)):𝑋1-1-onto𝑋))
3735cnveqd 5830 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐹𝐴) = (𝑎𝑋 ↦ (𝐴 + 𝑎)))
3833, 2grplactfval 19017 . . . . . 6 ((𝐼𝐴) ∈ 𝑋 → (𝐹‘(𝐼𝐴)) = (𝑎𝑋 ↦ ((𝐼𝐴) + 𝑎)))
39 oveq2 7375 . . . . . . 7 (𝑎 = 𝑏 → ((𝐼𝐴) + 𝑎) = ((𝐼𝐴) + 𝑏))
4039cbvmptv 5189 . . . . . 6 (𝑎𝑋 ↦ ((𝐼𝐴) + 𝑎)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏))
4138, 40eqtrdi 2787 . . . . 5 ((𝐼𝐴) ∈ 𝑋 → (𝐹‘(𝐼𝐴)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏)))
427, 41syl 17 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐹‘(𝐼𝐴)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏)))
4337, 42eqeq12d 2752 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐹𝐴) = (𝐹‘(𝐼𝐴)) ↔ (𝑎𝑋 ↦ (𝐴 + 𝑎)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏))))
4436, 43anbi12d 633 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (((𝐹𝐴):𝑋1-1-onto𝑋(𝐹𝐴) = (𝐹‘(𝐼𝐴))) ↔ ((𝑎𝑋 ↦ (𝐴 + 𝑎)):𝑋1-1-onto𝑋(𝑎𝑋 ↦ (𝐴 + 𝑎)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏)))))
4532, 44mpbird 257 1 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐹𝐴):𝑋1-1-onto𝑋(𝐹𝐴) = (𝐹‘(𝐼𝐴))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  cmpt 5166  ccnv 5630  1-1-ontowf1o 6497  cfv 6498  (class class class)co 7367  Basecbs 17179  +gcplusg 17220  0gc0g 17402  Grpcgrp 18909  invgcminusg 18910
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-0g 17404  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-grp 18912  df-minusg 18913
This theorem is referenced by:  grplactf1o  19020  eqglact  19154  tgplacthmeo  24068  tgpconncompeqg  24077
  Copyright terms: Public domain W3C validator