ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  grplactcnv GIF version

Theorem grplactcnv 13960
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 2238 . . 3 (𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)) = (𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎))
2 grplact.2 . . . . 5 𝑋 = (Base‘𝐺)
3 grplact.3 . . . . 5 + = (+g‘𝐺)
42, 3grpcl 13866 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝑎 ∈ 𝑋) → (𝐴 + 𝑎) ∈ 𝑋)
543expa 1234 . . 3 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑎 ∈ 𝑋) → (𝐴 + 𝑎) ∈ 𝑋)
6 grplactcnv.4 . . . . 5 𝐼 = (invg‘𝐺)
72, 6grpinvcl 13906 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐼‘𝐴) ∈ 𝑋)
82, 3grpcl 13866 . . . . 5 ((𝐺 ∈ Grp ∧ (𝐼‘𝐴) ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → ((𝐼‘𝐴) + 𝑏) ∈ 𝑋)
983expa 1234 . . . 4 (((𝐺 ∈ Grp ∧ (𝐼‘𝐴) ∈ 𝑋) ∧ 𝑏 ∈ 𝑋) → ((𝐼‘𝐴) + 𝑏) ∈ 𝑋)
107, 9syldanl 453 . . 3 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑏 ∈ 𝑋) → ((𝐼‘𝐴) + 𝑏) ∈ 𝑋)
11 eqcom 2240 . . . . 5 (𝑎 = ((𝐼‘𝐴) + 𝑏) ↔ ((𝐼‘𝐴) + 𝑏) = 𝑎)
12 eqid 2238 . . . . . . . . . 10 (0g‘𝐺) = (0g‘𝐺)
132, 3, 12, 6grplinv 13908 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝐼‘𝐴) + 𝐴) = (0g‘𝐺))
1413adantr 276 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → ((𝐼‘𝐴) + 𝐴) = (0g‘𝐺))
1514oveq1d 6100 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (((𝐼‘𝐴) + 𝐴) + 𝑎) = ((0g‘𝐺) + 𝑎))
16 simpll 531 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → 𝐺 ∈ Grp)
177adantr 276 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝐼‘𝐴) ∈ 𝑋)
18 simplr 533 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
19 simprl 535 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → 𝑎 ∈ 𝑋)
202, 3grpass 13867 . . . . . . . 8 ((𝐺 ∈ Grp ∧ ((𝐼‘𝐴) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝑎 ∈ 𝑋)) → (((𝐼‘𝐴) + 𝐴) + 𝑎) = ((𝐼‘𝐴) + (𝐴 + 𝑎)))
2116, 17, 18, 19, 20syl13anc 1280 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (((𝐼‘𝐴) + 𝐴) + 𝑎) = ((𝐼‘𝐴) + (𝐴 + 𝑎)))
222, 3, 12grplid 13889 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝑋) → ((0g‘𝐺) + 𝑎) = 𝑎)
2322ad2ant2r 513 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → ((0g‘𝐺) + 𝑎) = 𝑎)
2415, 21, 233eqtr3rd 2280 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → 𝑎 = ((𝐼‘𝐴) + (𝐴 + 𝑎)))
2524eqeq2d 2250 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (((𝐼‘𝐴) + 𝑏) = 𝑎 ↔ ((𝐼‘𝐴) + 𝑏) = ((𝐼‘𝐴) + (𝐴 + 𝑎))))
2611, 25bitrid 192 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎 = ((𝐼‘𝐴) + 𝑏) ↔ ((𝐼‘𝐴) + 𝑏) = ((𝐼‘𝐴) + (𝐴 + 𝑎))))
27 simprr 537 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → 𝑏 ∈ 𝑋)
285adantrr 483 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝐴 + 𝑎) ∈ 𝑋)
292, 3grplcan 13920 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑏 ∈ 𝑋 ∧ (𝐴 + 𝑎) ∈ 𝑋 ∧ (𝐼‘𝐴) ∈ 𝑋)) → (((𝐼‘𝐴) + 𝑏) = ((𝐼‘𝐴) + (𝐴 + 𝑎)) ↔ 𝑏 = (𝐴 + 𝑎)))
3016, 27, 28, 17, 29syl13anc 1280 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (((𝐼‘𝐴) + 𝑏) = ((𝐼‘𝐴) + (𝐴 + 𝑎)) ↔ 𝑏 = (𝐴 + 𝑎)))
3126, 30bitrd 188 . . 3 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎 = ((𝐼‘𝐴) + 𝑏) ↔ 𝑏 = (𝐴 + 𝑎)))
321, 5, 10, 31f1ocnv2d 6294 . 2 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)):𝑋–1-1-onto→𝑋 ∧ ◡(𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)) = (𝑏 ∈ 𝑋 ↦ ((𝐼‘𝐴) + 𝑏))))
33 grplact.1 . . . . . 6 𝐹 = (𝑔 ∈ 𝑋 ↦ (𝑎 ∈ 𝑋 ↦ (𝑔 + 𝑎)))
3433, 2grplactfval 13959 . . . . 5 (𝐴 ∈ 𝑋 → (𝐹‘𝐴) = (𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)))
3534adantl 277 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) = (𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)))
3635f1oeq1d 5634 . . 3 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴):𝑋–1-1-onto→𝑋 ↔ (𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)):𝑋–1-1-onto→𝑋))
3735cnveqd 4956 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ◡(𝐹‘𝐴) = ◡(𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)))
3833, 2grplactfval 13959 . . . . . 6 ((𝐼‘𝐴) ∈ 𝑋 → (𝐹‘(𝐼‘𝐴)) = (𝑎 ∈ 𝑋 ↦ ((𝐼‘𝐴) + 𝑎)))
39 oveq2 6093 . . . . . . 7 (𝑎 = 𝑏 → ((𝐼‘𝐴) + 𝑎) = ((𝐼‘𝐴) + 𝑏))
4039cbvmptv 4227 . . . . . 6 (𝑎 ∈ 𝑋 ↦ ((𝐼‘𝐴) + 𝑎)) = (𝑏 ∈ 𝑋 ↦ ((𝐼‘𝐴) + 𝑏))
4138, 40eqtrdi 2287 . . . . 5 ((𝐼‘𝐴) ∈ 𝑋 → (𝐹‘(𝐼‘𝐴)) = (𝑏 ∈ 𝑋 ↦ ((𝐼‘𝐴) + 𝑏)))
427, 41syl 14 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐹‘(𝐼‘𝐴)) = (𝑏 ∈ 𝑋 ↦ ((𝐼‘𝐴) + 𝑏)))
4337, 42eqeq12d 2253 . . 3 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (◡(𝐹‘𝐴) = (𝐹‘(𝐼‘𝐴)) ↔ ◡(𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)) = (𝑏 ∈ 𝑋 ↦ ((𝐼‘𝐴) + 𝑏))))
4436, 43anbi12d 477 . 2 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (((𝐹‘𝐴):𝑋–1-1-onto→𝑋 ∧ ◡(𝐹‘𝐴) = (𝐹‘(𝐼‘𝐴))) ↔ ((𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)):𝑋–1-1-onto→𝑋 ∧ ◡(𝑎 ∈ 𝑋 ↦ (𝐴 + 𝑎)) = (𝑏 ∈ 𝑋 ↦ ((𝐼‘𝐴) + 𝑏)))))
4532, 44mpbird 167 1 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴):𝑋–1-1-onto→𝑋 ∧ ◡(𝐹‘𝐴) = (𝐹‘(𝐼‘𝐴))))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209   ↦ cmpt 4192  ◡ccnv 4773  –1-1-onto→wf1o 5376  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +gcplusg 13484  0gc0g 13663  Grpcgrp 13858  invgcminusg 13859
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-inn 9308  df-2 9366  df-ndx 13407  df-slot 13408  df-base 13410  df-plusg 13497  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862
This theorem is used by:  grplactf1o  13961  eqglact  14081
  Copyright terms: Public domain W3C validator