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

Theorem ga0 19225
Description: The action of a group on the empty set. (Contributed by Jeff Hankins, 11-Aug-2009.) (Revised by Mario Carneiro, 13-Jan-2015.)
Assertion
Ref Expression
ga0 (𝐺 ∈ Grp → ∅ ∈ (𝐺 GrpAct ∅))

Proof of Theorem ga0
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 5250 . . 3 ∅ ∈ V
21jctr 524 . 2 (𝐺 ∈ Grp → (𝐺 ∈ Grp ∧ ∅ ∈ V))
3 f0 6713 . . . 4 ∅:∅⟶∅
4 xp0 5722 . . . . 5 ((Base‘𝐺) × ∅) = ∅
54feq2i 6652 . . . 4 (∅:((Base‘𝐺) × ∅)⟶∅ ↔ ∅:∅⟶∅)
63, 5mpbir 231 . . 3 ∅:((Base‘𝐺) × ∅)⟶∅
7 ral0 4449 . . 3 𝑥 ∈ ∅ (((0g𝐺)∅𝑥) = 𝑥 ∧ ∀𝑦 ∈ (Base‘𝐺)∀𝑧 ∈ (Base‘𝐺)((𝑦(+g𝐺)𝑧)∅𝑥) = (𝑦∅(𝑧𝑥)))
86, 7pm3.2i 470 . 2 (∅:((Base‘𝐺) × ∅)⟶∅ ∧ ∀𝑥 ∈ ∅ (((0g𝐺)∅𝑥) = 𝑥 ∧ ∀𝑦 ∈ (Base‘𝐺)∀𝑧 ∈ (Base‘𝐺)((𝑦(+g𝐺)𝑧)∅𝑥) = (𝑦∅(𝑧𝑥))))
9 eqid 2734 . . 3 (Base‘𝐺) = (Base‘𝐺)
10 eqid 2734 . . 3 (+g𝐺) = (+g𝐺)
11 eqid 2734 . . 3 (0g𝐺) = (0g𝐺)
129, 10, 11isga 19218 . 2 (∅ ∈ (𝐺 GrpAct ∅) ↔ ((𝐺 ∈ Grp ∧ ∅ ∈ V) ∧ (∅:((Base‘𝐺) × ∅)⟶∅ ∧ ∀𝑥 ∈ ∅ (((0g𝐺)∅𝑥) = 𝑥 ∧ ∀𝑦 ∈ (Base‘𝐺)∀𝑧 ∈ (Base‘𝐺)((𝑦(+g𝐺)𝑧)∅𝑥) = (𝑦∅(𝑧𝑥))))))
132, 8, 12sylanblrc 590 1 (𝐺 ∈ Grp → ∅ ∈ (𝐺 GrpAct ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  wral 3049  Vcvv 3438  c0 4283   × cxp 5620  wf 6486  cfv 6490  (class class class)co 7356  Basecbs 17134  +gcplusg 17175  0gc0g 17357  Grpcgrp 18861   GrpAct cga 19216
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 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
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 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-map 8763  df-ga 19217
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator