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

Theorem gapm 19245
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 19234 . . . 4 ( ∈ (𝐺 GrpAct 𝑌) → :(𝑋 × 𝑌)⟶𝑌)
43ad2antrr 726 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑥𝑌) → :(𝑋 × 𝑌)⟶𝑌)
5 simplr 768 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑥𝑌) → 𝐴𝑋)
6 simpr 484 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑥𝑌) → 𝑥𝑌)
74, 5, 6fovcdmd 7564 . 2 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑥𝑌) → (𝐴 𝑥) ∈ 𝑌)
83ad2antrr 726 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → :(𝑋 × 𝑌)⟶𝑌)
9 gagrp 19231 . . . . 5 ( ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
109ad2antrr 726 . . . 4 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → 𝐺 ∈ Grp)
11 simplr 768 . . . 4 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → 𝐴𝑋)
12 eqid 2730 . . . . 5 (invg𝐺) = (invg𝐺)
132, 12grpinvcl 18926 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((invg𝐺)‘𝐴) ∈ 𝑋)
1410, 11, 13syl2anc 584 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → ((invg𝐺)‘𝐴) ∈ 𝑋)
15 simpr 484 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → 𝑦𝑌)
168, 14, 15fovcdmd 7564 . 2 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → (((invg𝐺)‘𝐴) 𝑦) ∈ 𝑌)
17 simpll 766 . . . . 5 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → ∈ (𝐺 GrpAct 𝑌))
18 simplr 768 . . . . 5 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → 𝐴𝑋)
19 simprl 770 . . . . 5 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → 𝑥𝑌)
20 simprr 772 . . . . 5 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → 𝑦𝑌)
212, 12gacan 19244 . . . . 5 (( ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴𝑋𝑥𝑌𝑦𝑌)) → ((𝐴 𝑥) = 𝑦 ↔ (((invg𝐺)‘𝐴) 𝑦) = 𝑥))
2217, 18, 19, 20, 21syl13anc 1374 . . . 4 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → ((𝐴 𝑥) = 𝑦 ↔ (((invg𝐺)‘𝐴) 𝑦) = 𝑥))
2322bicomd 223 . . 3 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → ((((invg𝐺)‘𝐴) 𝑦) = 𝑥 ↔ (𝐴 𝑥) = 𝑦))
24 eqcom 2737 . . 3 (𝑥 = (((invg𝐺)‘𝐴) 𝑦) ↔ (((invg𝐺)‘𝐴) 𝑦) = 𝑥)
25 eqcom 2737 . . 3 (𝑦 = (𝐴 𝑥) ↔ (𝐴 𝑥) = 𝑦)
2623, 24, 253bitr4g 314 . 2 ((( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) ∧ (𝑥𝑌𝑦𝑌)) → (𝑥 = (((invg𝐺)‘𝐴) 𝑦) ↔ 𝑦 = (𝐴 𝑥)))
271, 7, 16, 26f1o2d 7646 1 (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴𝑋) → 𝐹:𝑌1-1-onto𝑌)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  cmpt 5191   × cxp 5639  wf 6510  1-1-ontowf1o 6513  cfv 6514  (class class class)co 7390  Basecbs 17186  Grpcgrp 18872  invgcminusg 18873   GrpAct cga 19228
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-map 8804  df-0g 17411  df-mgm 18574  df-sgrp 18653  df-mnd 18669  df-grp 18875  df-minusg 18876  df-ga 19229
This theorem is referenced by:  galactghm  19341
  Copyright terms: Public domain W3C validator