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

Theorem gaid 19329
Description: The trivial action of a group on any set. Each group element corresponds to the identity permutation. (Contributed by Jeff Hankins, 11-Aug-2009.) (Proof shortened by Mario Carneiro, 13-Jan-2015.)
Hypothesis
Ref Expression
gaid.1 𝑋 = (Base‘𝐺)
Assertion
Ref Expression
gaid ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (2nd ↾ (𝑋 × 𝑆)) ∈ (𝐺 GrpAct 𝑆))

Proof of Theorem gaid
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3474 . . 3 (𝑆𝑉𝑆 ∈ V)
21anim2i 626 . 2 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (𝐺 ∈ Grp ∧ 𝑆 ∈ V))
3 gaid.1 . . . . . . . 8 𝑋 = (Base‘𝐺)
4 eqid 2761 . . . . . . . 8 (0g𝐺) = (0g𝐺)
53, 4grpidcl 18997 . . . . . . 7 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝑋)
65adantr 484 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (0g𝐺) ∈ 𝑋)
7 ovres 7556 . . . . . . 7 (((0g𝐺) ∈ 𝑋𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = ((0g𝐺)2nd 𝑥))
8 df-ov 7393 . . . . . . . 8 ((0g𝐺)2nd 𝑥) = (2nd ‘⟨(0g𝐺), 𝑥⟩)
9 fvex 6874 . . . . . . . . 9 (0g𝐺) ∈ V
10 vex 3457 . . . . . . . . 9 𝑥 ∈ V
119, 10op2nd 7973 . . . . . . . 8 (2nd ‘⟨(0g𝐺), 𝑥⟩) = 𝑥
128, 11eqtri 2784 . . . . . . 7 ((0g𝐺)2nd 𝑥) = 𝑥
137, 12eqtrdi 2812 . . . . . 6 (((0g𝐺) ∈ 𝑋𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
146, 13sylan 589 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
15 simprl 780 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑦𝑋)
16 simplr 778 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑥𝑆)
17 ovres 7556 . . . . . . . . 9 ((𝑦𝑋𝑥𝑆) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦2nd 𝑥))
18 df-ov 7393 . . . . . . . . . 10 (𝑦2nd 𝑥) = (2nd ‘⟨𝑦, 𝑥⟩)
19 vex 3457 . . . . . . . . . . 11 𝑦 ∈ V
2019, 10op2nd 7973 . . . . . . . . . 10 (2nd ‘⟨𝑦, 𝑥⟩) = 𝑥
2118, 20eqtri 2784 . . . . . . . . 9 (𝑦2nd 𝑥) = 𝑥
2217, 21eqtrdi 2812 . . . . . . . 8 ((𝑦𝑋𝑥𝑆) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
2315, 16, 22syl2anc 593 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
24 simprr 782 . . . . . . . . 9 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑧𝑋)
25 ovres 7556 . . . . . . . . . 10 ((𝑧𝑋𝑥𝑆) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑧2nd 𝑥))
26 df-ov 7393 . . . . . . . . . . 11 (𝑧2nd 𝑥) = (2nd ‘⟨𝑧, 𝑥⟩)
27 vex 3457 . . . . . . . . . . . 12 𝑧 ∈ V
2827, 10op2nd 7973 . . . . . . . . . . 11 (2nd ‘⟨𝑧, 𝑥⟩) = 𝑥
2926, 28eqtri 2784 . . . . . . . . . 10 (𝑧2nd 𝑥) = 𝑥
3025, 29eqtrdi 2812 . . . . . . . . 9 ((𝑧𝑋𝑥𝑆) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
3124, 16, 30syl2anc 593 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
3231oveq2d 7406 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)) = (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥))
33 eqid 2761 . . . . . . . . . . 11 (+g𝐺) = (+g𝐺)
343, 33grpcl 18973 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑦𝑋𝑧𝑋) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
35343expb 1132 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
3635ad4ant14 762 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
37 ovres 7556 . . . . . . . . 9 (((𝑦(+g𝐺)𝑧) ∈ 𝑋𝑥𝑆) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = ((𝑦(+g𝐺)𝑧)2nd 𝑥))
38 df-ov 7393 . . . . . . . . . 10 ((𝑦(+g𝐺)𝑧)2nd 𝑥) = (2nd ‘⟨(𝑦(+g𝐺)𝑧), 𝑥⟩)
39 ovex 7423 . . . . . . . . . . 11 (𝑦(+g𝐺)𝑧) ∈ V
4039, 10op2nd 7973 . . . . . . . . . 10 (2nd ‘⟨(𝑦(+g𝐺)𝑧), 𝑥⟩) = 𝑥
4138, 40eqtri 2784 . . . . . . . . 9 ((𝑦(+g𝐺)𝑧)2nd 𝑥) = 𝑥
4237, 41eqtrdi 2812 . . . . . . . 8 (((𝑦(+g𝐺)𝑧) ∈ 𝑋𝑥𝑆) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
4336, 16, 42syl2anc 593 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
4423, 32, 433eqtr4rd 2807 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))
4544ralrimivva 3204 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))
4614, 45jca 519 . . . 4 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥))))
4746ralrimiva 3153 . . 3 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → ∀𝑥𝑆 (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥))))
48 f2ndres 7989 . . 3 (2nd ↾ (𝑋 × 𝑆)):(𝑋 × 𝑆)⟶𝑆
4947, 48jctil 527 . 2 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → ((2nd ↾ (𝑋 × 𝑆)):(𝑋 × 𝑆)⟶𝑆 ∧ ∀𝑥𝑆 (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))))
503, 33, 4isga 19321 . 2 ((2nd ↾ (𝑋 × 𝑆)) ∈ (𝐺 GrpAct 𝑆) ↔ ((𝐺 ∈ Grp ∧ 𝑆 ∈ V) ∧ ((2nd ↾ (𝑋 × 𝑆)):(𝑋 × 𝑆)⟶𝑆 ∧ ∀𝑥𝑆 (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥))))))
512, 49, 50sylanbrc 592 1 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (2nd ↾ (𝑋 × 𝑆)) ∈ (𝐺 GrpAct 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  wral 3075  Vcvv 3453  cop 4585   × cxp 5641  cres 5645  wf 6511  cfv 6515  (class class class)co 7390  2nd c2nd 7963  Basecbs 17235  +gcplusg 17276  0gc0g 17458  Grpcgrp 18965   GrpAct cga 19319
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-fv 6523  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-2nd 7965  df-map 8803  df-0g 17460  df-mgm 18664  df-sgrp 18743  df-mnd 18759  df-grp 18968  df-ga 19320
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator