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

Theorem gafo 19361
Description: A group action is onto its base set. (Contributed by Jeff Hankins, 10-Aug-2009.) (Revised by Mario Carneiro, 13-Jan-2015.)
Hypothesis
Ref Expression
gaf.1 𝑋 = (Base‘𝐺)
Assertion
Ref Expression
gafo ( ∈ (𝐺 GrpAct 𝑌) → :(𝑋 × 𝑌)–onto𝑌)

Proof of Theorem gafo
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 gaf.1 . . 3 𝑋 = (Base‘𝐺)
21gaf 19360 . 2 ( ∈ (𝐺 GrpAct 𝑌) → :(𝑋 × 𝑌)⟶𝑌)
3 gagrp 19357 . . . . . 6 ( ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
43adantr 485 . . . . 5 (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥𝑌) → 𝐺 ∈ Grp)
5 eqid 2763 . . . . . 6 (0g𝐺) = (0g𝐺)
61, 5grpidcl 19027 . . . . 5 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝑋)
74, 6syl 18 . . . 4 (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥𝑌) → (0g𝐺) ∈ 𝑋)
8 simpr 489 . . . 4 (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥𝑌) → 𝑥𝑌)
95gagrpid 19359 . . . . 5 (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥𝑌) → ((0g𝐺) 𝑥) = 𝑥)
109eqcomd 2769 . . . 4 (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥𝑌) → 𝑥 = ((0g𝐺) 𝑥))
11 rspceov 7459 . . . 4 (((0g𝐺) ∈ 𝑋𝑥𝑌𝑥 = ((0g𝐺) 𝑥)) → ∃𝑦𝑋𝑧𝑌 𝑥 = (𝑦 𝑧))
127, 8, 10, 11syl3anc 1398 . . 3 (( ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥𝑌) → ∃𝑦𝑋𝑧𝑌 𝑥 = (𝑦 𝑧))
1312ralrimiva 3157 . 2 ( ∈ (𝐺 GrpAct 𝑌) → ∀𝑥𝑌𝑦𝑋𝑧𝑌 𝑥 = (𝑦 𝑧))
14 foov 7584 . 2 ( :(𝑋 × 𝑌)–onto𝑌 ↔ ( :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥𝑌𝑦𝑋𝑧𝑌 𝑥 = (𝑦 𝑧)))
152, 13, 14sylanbrc 594 1 ( ∈ (𝐺 GrpAct 𝑌) → :(𝑋 × 𝑌)–onto𝑌)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  wral 3079  wrex 3089   × cxp 5659  wf 6532  ontowfo 6534  cfv 6536  (class class class)co 7410  Basecbs 17264  0gc0g 17487  Grpcgrp 18995   GrpAct cga 19354
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fo 6542  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8822  df-0g 17489  df-mgm 18693  df-sgrp 18772  df-mnd 18788  df-grp 18998  df-ga 19355
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator