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

Theorem gapm 19376
Description: The action of a particular group element is a permutation of the base set. (Contributed by Jeff Hankins, 11-Aug-2009.) (Proof shortened by Mario Carneiro, 13-Jan-2015.)
Hypotheses
Ref Expression
gapm.1 𝑋 = (Base‘𝐺)
gapm.2 𝐹 = (𝑥𝑌 ↦ (𝐴 𝑥))
Assertion
Ref Expression
gapm (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) → 𝐹:𝑌1-1-onto𝑌)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐺   𝑥,   𝑥,𝑋   𝑥,𝑌
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem gapm
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 gapm.2 . 2 𝐹 = (𝑥𝑌 ↦ (𝐴 𝑥))
2 gapm.1 . . . . 5 𝑋 = (Base‘𝐺)
32gaf 19365 . . . 4 ( ∈ (𝐺 GrpAct 𝑌) → :(𝑋 × 𝑌)⟶𝑌)
43ad2antrr 738 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑥𝑌) → :(𝑋 × 𝑌)⟶𝑌)
5 simplr 780 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑥𝑌) → 𝐴𝑋)
6 simpr 489 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑥𝑌) → 𝑥𝑌)
74, 5, 6fovcdmd 7583 . 2 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑥𝑌) → (𝐴 𝑥) ∈ 𝑌)
83ad2antrr 738 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → :(𝑋 × 𝑌)⟶𝑌)
9 gagrp 19362 . . . . 5 ( ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
109ad2antrr 738 . . . 4 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → 𝐺 ∈ Grp)
11 simplr 780 . . . 4 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → 𝐴𝑋)
12 eqid 2769 . . . . 5 (invg𝐺) = (invg𝐺)
132, 12grpinvcl 19054 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((invg𝐺)‘𝐴) ∈ 𝑋)
1410, 11, 13syl2anc 595 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → ((invg𝐺)‘𝐴) ∈ 𝑋)
15 simpr 489 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → 𝑦𝑌)
168, 14, 15fovcdmd 7583 . 2 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → (((invg𝐺)‘𝐴) 𝑦) ∈ 𝑌)
17 simpll 778 . . . . 5 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → ∈ (𝐺 GrpAct 𝑌))
18 simplr 780 . . . . 5 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → 𝐴𝑋)
19 simprl 782 . . . . 5 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → 𝑥𝑌)
20 simprr 784 . . . . 5 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → 𝑦𝑌)
212, 12gacan 19375 . . . . 5 (( ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴𝑋𝑥𝑌𝑦𝑌)) → ((𝐴 𝑥) = 𝑦 ↔ (((invg𝐺)‘𝐴) 𝑦) = 𝑥))
2217, 18, 19, 20, 21syl13anc 1397 . . . 4 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → ((𝐴 𝑥) = 𝑦 ↔ (((invg𝐺)‘𝐴) 𝑦) = 𝑥))
2322bicomd 226 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → ((((invg𝐺)‘𝐴) 𝑦) = 𝑥 ↔ (𝐴 𝑥) = 𝑦))
24 eqcom 2776 . . 3 (𝑥 = (((invg𝐺)‘𝐴) 𝑦) ↔ (((invg𝐺)‘𝐴) 𝑦) = 𝑥)
25 eqcom 2776 . . 3 (𝑦 = (𝐴 𝑥) ↔ (𝐴 𝑥) = 𝑦)
2623, 24, 253bitr4g 317 . 2 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → (𝑥 = (((invg𝐺)‘𝐴) 𝑦) ↔ 𝑦 = (𝐴 𝑥)))
271, 7, 16, 26f1o2d 7665 1 (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) → 𝐹:𝑌1-1-onto𝑌)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  cmpt 5196   × cxp 5660  wf 6533  1-1-ontowf1o 6536  cfv 6537  (class class class)co 7411  Basecbs 17269  Grpcgrp 19000  invgcminusg 19001   GrpAct cga 19359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-map 8826  df-0g 17494  df-mgm 18698  df-sgrp 18777  df-mnd 18793  df-grp 19003  df-minusg 19004  df-ga 19360
This theorem is referenced by:  galactghm  19474
  Copyright terms: Public domain W3C validator