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

Theorem gaid 19215
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 3458 . . 3 (𝑆𝑉𝑆 ∈ V)
21anim2i 617 . 2 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (𝐺 ∈ Grp ∧ 𝑆 ∈ V))
3 gaid.1 . . . . . . . 8 𝑋 = (Base‘𝐺)
4 eqid 2733 . . . . . . . 8 (0g𝐺) = (0g𝐺)
53, 4grpidcl 18882 . . . . . . 7 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝑋)
65adantr 480 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (0g𝐺) ∈ 𝑋)
7 ovres 7520 . . . . . . 7 (((0g𝐺) ∈ 𝑋𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = ((0g𝐺)2nd 𝑥))
8 df-ov 7357 . . . . . . . 8 ((0g𝐺)2nd 𝑥) = (2nd ‘⟨(0g𝐺), 𝑥⟩)
9 fvex 6843 . . . . . . . . 9 (0g𝐺) ∈ V
10 vex 3441 . . . . . . . . 9 𝑥 ∈ V
119, 10op2nd 7938 . . . . . . . 8 (2nd ‘⟨(0g𝐺), 𝑥⟩) = 𝑥
128, 11eqtri 2756 . . . . . . 7 ((0g𝐺)2nd 𝑥) = 𝑥
137, 12eqtrdi 2784 . . . . . 6 (((0g𝐺) ∈ 𝑋𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
146, 13sylan 580 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
15 simprl 770 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑦𝑋)
16 simplr 768 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑥𝑆)
17 ovres 7520 . . . . . . . . 9 ((𝑦𝑋𝑥𝑆) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦2nd 𝑥))
18 df-ov 7357 . . . . . . . . . 10 (𝑦2nd 𝑥) = (2nd ‘⟨𝑦, 𝑥⟩)
19 vex 3441 . . . . . . . . . . 11 𝑦 ∈ V
2019, 10op2nd 7938 . . . . . . . . . 10 (2nd ‘⟨𝑦, 𝑥⟩) = 𝑥
2118, 20eqtri 2756 . . . . . . . . 9 (𝑦2nd 𝑥) = 𝑥
2217, 21eqtrdi 2784 . . . . . . . 8 ((𝑦𝑋𝑥𝑆) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
2315, 16, 22syl2anc 584 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
24 simprr 772 . . . . . . . . 9 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑧𝑋)
25 ovres 7520 . . . . . . . . . 10 ((𝑧𝑋𝑥𝑆) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑧2nd 𝑥))
26 df-ov 7357 . . . . . . . . . . 11 (𝑧2nd 𝑥) = (2nd ‘⟨𝑧, 𝑥⟩)
27 vex 3441 . . . . . . . . . . . 12 𝑧 ∈ V
2827, 10op2nd 7938 . . . . . . . . . . 11 (2nd ‘⟨𝑧, 𝑥⟩) = 𝑥
2926, 28eqtri 2756 . . . . . . . . . 10 (𝑧2nd 𝑥) = 𝑥
3025, 29eqtrdi 2784 . . . . . . . . 9 ((𝑧𝑋𝑥𝑆) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
3124, 16, 30syl2anc 584 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
3231oveq2d 7370 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)) = (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥))
33 eqid 2733 . . . . . . . . . . 11 (+g𝐺) = (+g𝐺)
343, 33grpcl 18858 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑦𝑋𝑧𝑋) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
35343expb 1120 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
3635ad4ant14 752 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
37 ovres 7520 . . . . . . . . 9 (((𝑦(+g𝐺)𝑧) ∈ 𝑋𝑥𝑆) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = ((𝑦(+g𝐺)𝑧)2nd 𝑥))
38 df-ov 7357 . . . . . . . . . 10 ((𝑦(+g𝐺)𝑧)2nd 𝑥) = (2nd ‘⟨(𝑦(+g𝐺)𝑧), 𝑥⟩)
39 ovex 7387 . . . . . . . . . . 11 (𝑦(+g𝐺)𝑧) ∈ V
4039, 10op2nd 7938 . . . . . . . . . 10 (2nd ‘⟨(𝑦(+g𝐺)𝑧), 𝑥⟩) = 𝑥
4138, 40eqtri 2756 . . . . . . . . 9 ((𝑦(+g𝐺)𝑧)2nd 𝑥) = 𝑥
4237, 41eqtrdi 2784 . . . . . . . 8 (((𝑦(+g𝐺)𝑧) ∈ 𝑋𝑥𝑆) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
4336, 16, 42syl2anc 584 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
4423, 32, 433eqtr4rd 2779 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))
4544ralrimivva 3176 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))
4614, 45jca 511 . . . 4 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥))))
4746ralrimiva 3125 . . 3 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → ∀𝑥𝑆 (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥))))
48 f2ndres 7954 . . 3 (2nd ↾ (𝑋 × 𝑆)):(𝑋 × 𝑆)⟶𝑆
4947, 48jctil 519 . 2 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → ((2nd ↾ (𝑋 × 𝑆)):(𝑋 × 𝑆)⟶𝑆 ∧ ∀𝑥𝑆 (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))))
503, 33, 4isga 19207 . 2 ((2nd ↾ (𝑋 × 𝑆)) ∈ (𝐺 GrpAct 𝑆) ↔ ((𝐺 ∈ Grp ∧ 𝑆 ∈ V) ∧ ((2nd ↾ (𝑋 × 𝑆)):(𝑋 × 𝑆)⟶𝑆 ∧ ∀𝑥𝑆 (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥))))))
512, 49, 50sylanbrc 583 1 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (2nd ↾ (𝑋 × 𝑆)) ∈ (𝐺 GrpAct 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  wral 3048  Vcvv 3437  cop 4583   × cxp 5619  cres 5623  wf 6484  cfv 6488  (class class class)co 7354  2nd c2nd 7928  Basecbs 17124  +gcplusg 17165  0gc0g 17347  Grpcgrp 18850   GrpAct cga 19205
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7676
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-fv 6496  df-riota 7311  df-ov 7357  df-oprab 7358  df-mpo 7359  df-2nd 7930  df-map 8760  df-0g 17349  df-mgm 18552  df-sgrp 18631  df-mnd 18647  df-grp 18853  df-ga 19206
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator