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

Theorem gaid 19228
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 3461 . . 3 (𝑆𝑉𝑆 ∈ V)
21anim2i 617 . 2 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (𝐺 ∈ Grp ∧ 𝑆 ∈ V))
3 gaid.1 . . . . . . . 8 𝑋 = (Base‘𝐺)
4 eqid 2736 . . . . . . . 8 (0g𝐺) = (0g𝐺)
53, 4grpidcl 18895 . . . . . . 7 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝑋)
65adantr 480 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → (0g𝐺) ∈ 𝑋)
7 ovres 7524 . . . . . . 7 (((0g𝐺) ∈ 𝑋𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = ((0g𝐺)2nd 𝑥))
8 df-ov 7361 . . . . . . . 8 ((0g𝐺)2nd 𝑥) = (2nd ‘⟨(0g𝐺), 𝑥⟩)
9 fvex 6847 . . . . . . . . 9 (0g𝐺) ∈ V
10 vex 3444 . . . . . . . . 9 𝑥 ∈ V
119, 10op2nd 7942 . . . . . . . 8 (2nd ‘⟨(0g𝐺), 𝑥⟩) = 𝑥
128, 11eqtri 2759 . . . . . . 7 ((0g𝐺)2nd 𝑥) = 𝑥
137, 12eqtrdi 2787 . . . . . 6 (((0g𝐺) ∈ 𝑋𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
146, 13sylan 580 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → ((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
15 simprl 770 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑦𝑋)
16 simplr 768 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑥𝑆)
17 ovres 7524 . . . . . . . . 9 ((𝑦𝑋𝑥𝑆) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦2nd 𝑥))
18 df-ov 7361 . . . . . . . . . 10 (𝑦2nd 𝑥) = (2nd ‘⟨𝑦, 𝑥⟩)
19 vex 3444 . . . . . . . . . . 11 𝑦 ∈ V
2019, 10op2nd 7942 . . . . . . . . . 10 (2nd ‘⟨𝑦, 𝑥⟩) = 𝑥
2118, 20eqtri 2759 . . . . . . . . 9 (𝑦2nd 𝑥) = 𝑥
2217, 21eqtrdi 2787 . . . . . . . 8 ((𝑦𝑋𝑥𝑆) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
2315, 16, 22syl2anc 584 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
24 simprr 772 . . . . . . . . 9 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → 𝑧𝑋)
25 ovres 7524 . . . . . . . . . 10 ((𝑧𝑋𝑥𝑆) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑧2nd 𝑥))
26 df-ov 7361 . . . . . . . . . . 11 (𝑧2nd 𝑥) = (2nd ‘⟨𝑧, 𝑥⟩)
27 vex 3444 . . . . . . . . . . . 12 𝑧 ∈ V
2827, 10op2nd 7942 . . . . . . . . . . 11 (2nd ‘⟨𝑧, 𝑥⟩) = 𝑥
2926, 28eqtri 2759 . . . . . . . . . 10 (𝑧2nd 𝑥) = 𝑥
3025, 29eqtrdi 2787 . . . . . . . . 9 ((𝑧𝑋𝑥𝑆) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
3124, 16, 30syl2anc 584 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑧(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
3231oveq2d 7374 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)) = (𝑦(2nd ↾ (𝑋 × 𝑆))𝑥))
33 eqid 2736 . . . . . . . . . . 11 (+g𝐺) = (+g𝐺)
343, 33grpcl 18871 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑦𝑋𝑧𝑋) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
35343expb 1120 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
3635ad4ant14 752 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
37 ovres 7524 . . . . . . . . 9 (((𝑦(+g𝐺)𝑧) ∈ 𝑋𝑥𝑆) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = ((𝑦(+g𝐺)𝑧)2nd 𝑥))
38 df-ov 7361 . . . . . . . . . 10 ((𝑦(+g𝐺)𝑧)2nd 𝑥) = (2nd ‘⟨(𝑦(+g𝐺)𝑧), 𝑥⟩)
39 ovex 7391 . . . . . . . . . . 11 (𝑦(+g𝐺)𝑧) ∈ V
4039, 10op2nd 7942 . . . . . . . . . 10 (2nd ‘⟨(𝑦(+g𝐺)𝑧), 𝑥⟩) = 𝑥
4138, 40eqtri 2759 . . . . . . . . 9 ((𝑦(+g𝐺)𝑧)2nd 𝑥) = 𝑥
4237, 41eqtrdi 2787 . . . . . . . 8 (((𝑦(+g𝐺)𝑧) ∈ 𝑋𝑥𝑆) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
4336, 16, 42syl2anc 584 . . . . . . 7 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥)
4423, 32, 433eqtr4rd 2782 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) ∧ (𝑦𝑋𝑧𝑋)) → ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))
4544ralrimivva 3179 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))
4614, 45jca 511 . . . 4 (((𝐺 ∈ Grp ∧ 𝑆𝑉) ∧ 𝑥𝑆) → (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥))))
4746ralrimiva 3128 . . 3 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → ∀𝑥𝑆 (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥))))
48 f2ndres 7958 . . 3 (2nd ↾ (𝑋 × 𝑆)):(𝑋 × 𝑆)⟶𝑆
4947, 48jctil 519 . 2 ((𝐺 ∈ Grp ∧ 𝑆𝑉) → ((2nd ↾ (𝑋 × 𝑆)):(𝑋 × 𝑆)⟶𝑆 ∧ ∀𝑥𝑆 (((0g𝐺)(2nd ↾ (𝑋 × 𝑆))𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦(+g𝐺)𝑧)(2nd ↾ (𝑋 × 𝑆))𝑥) = (𝑦(2nd ↾ (𝑋 × 𝑆))(𝑧(2nd ↾ (𝑋 × 𝑆))𝑥)))))
503, 33, 4isga 19220 . 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 3051  Vcvv 3440  cop 4586   × cxp 5622  cres 5626  wf 6488  cfv 6492  (class class class)co 7358  2nd c2nd 7932  Basecbs 17136  +gcplusg 17177  0gc0g 17359  Grpcgrp 18863   GrpAct cga 19218
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 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-2nd 7934  df-map 8765  df-0g 17361  df-mgm 18565  df-sgrp 18644  df-mnd 18660  df-grp 18866  df-ga 19219
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator