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

Theorem gafo 19519
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 19518 . 2 ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
3 gagrp 19515 . . . . . 6 ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
43adantr 486 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥 ∈ 𝑌) → 𝐺 ∈ Grp)
5 eqid 2760 . . . . . 6 (0g‘𝐺) = (0g‘𝐺)
61, 5grpidcl 19185 . . . . 5 (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝑋)
74, 6syl 18 . . . 4 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥 ∈ 𝑌) → (0g‘𝐺) ∈ 𝑋)
8 simpr 490 . . . 4 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥 ∈ 𝑌) → 𝑥 ∈ 𝑌)
95gagrpid 19517 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝑥) = 𝑥)
109eqcomd 2766 . . . 4 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥 ∈ 𝑌) → 𝑥 = ((0g‘𝐺) ⊕ 𝑥))
11 rspceov 7473 . . . 4 (((0g‘𝐺) ∈ 𝑋 ∧ 𝑥 ∈ 𝑌 ∧ 𝑥 = ((0g‘𝐺) ⊕ 𝑥)) → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑌 𝑥 = (𝑦 ⊕ 𝑧))
127, 8, 10, 11syl3anc 1398 . . 3 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑥 ∈ 𝑌) → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑌 𝑥 = (𝑦 ⊕ 𝑧))
1312ralrimiva 3154 . 2 ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ∀𝑥 ∈ 𝑌 ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑌 𝑥 = (𝑦 ⊕ 𝑧))
14 foov 7599 . 2 ( ⊕ :(𝑋 × 𝑌)–onto→𝑌 ↔ ( ⊕ :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥 ∈ 𝑌 ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑌 𝑥 = (𝑦 ⊕ 𝑧)))
152, 13, 14sylanbrc 595 1 ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)–onto→𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   × cxp 5649  ⟶wf 6539  –onto→wfo 6541  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  0gc0g 17619  Grpcgrp 19153   GrpAct cga 19512
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fo 6549  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-map 8857  df-0g 17621  df-mgm 18825  df-sgrp 18917  df-mnd 18933  df-grp 19156  df-ga 19513
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator