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

Theorem grplactcnv 13815
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 2232 . . 3 (𝑎𝑋 ↦ (𝐴 + 𝑎)) = (𝑎𝑋 ↦ (𝐴 + 𝑎))
2 grplact.2 . . . . 5 𝑋 = (Base‘𝐺)
3 grplact.3 . . . . 5 + = (+g𝐺)
42, 3grpcl 13721 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋𝑎𝑋) → (𝐴 + 𝑎) ∈ 𝑋)
543expa 1230 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑎𝑋) → (𝐴 + 𝑎) ∈ 𝑋)
6 grplactcnv.4 . . . . 5 𝐼 = (invg𝐺)
72, 6grpinvcl 13761 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐼𝐴) ∈ 𝑋)
82, 3grpcl 13721 . . . . 5 ((𝐺 ∈ Grp ∧ (𝐼𝐴) ∈ 𝑋𝑏𝑋) → ((𝐼𝐴) + 𝑏) ∈ 𝑋)
983expa 1230 . . . 4 (((𝐺 ∈ Grp ∧ (𝐼𝐴) ∈ 𝑋) ∧ 𝑏𝑋) → ((𝐼𝐴) + 𝑏) ∈ 𝑋)
107, 9syldanl 449 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑏𝑋) → ((𝐼𝐴) + 𝑏) ∈ 𝑋)
11 eqcom 2234 . . . . 5 (𝑎 = ((𝐼𝐴) + 𝑏) ↔ ((𝐼𝐴) + 𝑏) = 𝑎)
12 eqid 2232 . . . . . . . . . 10 (0g𝐺) = (0g𝐺)
132, 3, 12, 6grplinv 13763 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐼𝐴) + 𝐴) = (0g𝐺))
1413adantr 276 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → ((𝐼𝐴) + 𝐴) = (0g𝐺))
1514oveq1d 6065 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (((𝐼𝐴) + 𝐴) + 𝑎) = ((0g𝐺) + 𝑎))
16 simpll 527 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝐺 ∈ Grp)
177adantr 276 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (𝐼𝐴) ∈ 𝑋)
18 simplr 529 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝐴𝑋)
19 simprl 531 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝑎𝑋)
202, 3grpass 13722 . . . . . . . 8 ((𝐺 ∈ Grp ∧ ((𝐼𝐴) ∈ 𝑋𝐴𝑋𝑎𝑋)) → (((𝐼𝐴) + 𝐴) + 𝑎) = ((𝐼𝐴) + (𝐴 + 𝑎)))
2116, 17, 18, 19, 20syl13anc 1276 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (((𝐼𝐴) + 𝐴) + 𝑎) = ((𝐼𝐴) + (𝐴 + 𝑎)))
222, 3, 12grplid 13744 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑎𝑋) → ((0g𝐺) + 𝑎) = 𝑎)
2322ad2ant2r 509 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → ((0g𝐺) + 𝑎) = 𝑎)
2415, 21, 233eqtr3rd 2274 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝑎 = ((𝐼𝐴) + (𝐴 + 𝑎)))
2524eqeq2d 2244 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (((𝐼𝐴) + 𝑏) = 𝑎 ↔ ((𝐼𝐴) + 𝑏) = ((𝐼𝐴) + (𝐴 + 𝑎))))
2611, 25bitrid 192 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (𝑎 = ((𝐼𝐴) + 𝑏) ↔ ((𝐼𝐴) + 𝑏) = ((𝐼𝐴) + (𝐴 + 𝑎))))
27 simprr 533 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → 𝑏𝑋)
285adantrr 479 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (𝐴 + 𝑎) ∈ 𝑋)
292, 3grplcan 13775 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑏𝑋 ∧ (𝐴 + 𝑎) ∈ 𝑋 ∧ (𝐼𝐴) ∈ 𝑋)) → (((𝐼𝐴) + 𝑏) = ((𝐼𝐴) + (𝐴 + 𝑎)) ↔ 𝑏 = (𝐴 + 𝑎)))
3016, 27, 28, 17, 29syl13anc 1276 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (((𝐼𝐴) + 𝑏) = ((𝐼𝐴) + (𝐴 + 𝑎)) ↔ 𝑏 = (𝐴 + 𝑎)))
3126, 30bitrd 188 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑎𝑋𝑏𝑋)) → (𝑎 = ((𝐼𝐴) + 𝑏) ↔ 𝑏 = (𝐴 + 𝑎)))
321, 5, 10, 31f1ocnv2d 6259 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝑎𝑋 ↦ (𝐴 + 𝑎)):𝑋1-1-onto𝑋(𝑎𝑋 ↦ (𝐴 + 𝑎)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏))))
33 grplact.1 . . . . . 6 𝐹 = (𝑔𝑋 ↦ (𝑎𝑋 ↦ (𝑔 + 𝑎)))
3433, 2grplactfval 13814 . . . . 5 (𝐴𝑋 → (𝐹𝐴) = (𝑎𝑋 ↦ (𝐴 + 𝑎)))
3534adantl 277 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐹𝐴) = (𝑎𝑋 ↦ (𝐴 + 𝑎)))
3635f1oeq1d 5609 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐹𝐴):𝑋1-1-onto𝑋 ↔ (𝑎𝑋 ↦ (𝐴 + 𝑎)):𝑋1-1-onto𝑋))
3735cnveqd 4931 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐹𝐴) = (𝑎𝑋 ↦ (𝐴 + 𝑎)))
3833, 2grplactfval 13814 . . . . . 6 ((𝐼𝐴) ∈ 𝑋 → (𝐹‘(𝐼𝐴)) = (𝑎𝑋 ↦ ((𝐼𝐴) + 𝑎)))
39 oveq2 6058 . . . . . . 7 (𝑎 = 𝑏 → ((𝐼𝐴) + 𝑎) = ((𝐼𝐴) + 𝑏))
4039cbvmptv 4206 . . . . . 6 (𝑎𝑋 ↦ ((𝐼𝐴) + 𝑎)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏))
4138, 40eqtrdi 2281 . . . . 5 ((𝐼𝐴) ∈ 𝑋 → (𝐹‘(𝐼𝐴)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏)))
427, 41syl 14 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐹‘(𝐼𝐴)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏)))
4337, 42eqeq12d 2247 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐹𝐴) = (𝐹‘(𝐼𝐴)) ↔ (𝑎𝑋 ↦ (𝐴 + 𝑎)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏))))
4436, 43anbi12d 473 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (((𝐹𝐴):𝑋1-1-onto𝑋(𝐹𝐴) = (𝐹‘(𝐼𝐴))) ↔ ((𝑎𝑋 ↦ (𝐴 + 𝑎)):𝑋1-1-onto𝑋(𝑎𝑋 ↦ (𝐴 + 𝑎)) = (𝑏𝑋 ↦ ((𝐼𝐴) + 𝑏)))))
4532, 44mpbird 167 1 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝐹𝐴):𝑋1-1-onto𝑋(𝐹𝐴) = (𝐹‘(𝐼𝐴))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2203  cmpt 4171  ccnv 4748  1-1-ontowf1o 5351  cfv 5352  (class class class)co 6050  Basecbs 13212  +gcplusg 13290  0gc0g 13469  Grpcgrp 13713  invgcminusg 13714
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-inn 9238  df-2 9296  df-ndx 13215  df-slot 13216  df-base 13218  df-plusg 13303  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-grp 13716  df-minusg 13717
This theorem is referenced by:  grplactf1o  13816  eqglact  13942
  Copyright terms: Public domain W3C validator