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

Theorem mndpfo 18453
Description: The addition operation of a monoid as a function is an onto function. (Contributed by FL, 2-Nov-2009.) (Revised by Mario Carneiro, 11-Oct-2013.) (Revised by AV, 23-Jan-2020.)
Hypotheses
Ref Expression
mndpf.b 𝐵 = (Base‘𝐺)
mndpf.p = (+𝑓𝐺)
Assertion
Ref Expression
mndpfo (𝐺 ∈ Mnd → :(𝐵 × 𝐵)–onto𝐵)

Proof of Theorem mndpfo
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mndpf.b . . 3 𝐵 = (Base‘𝐺)
2 mndpf.p . . 3 = (+𝑓𝐺)
31, 2mndplusf 18448 . 2 (𝐺 ∈ Mnd → :(𝐵 × 𝐵)⟶𝐵)
4 simpr 486 . . . . 5 ((𝐺 ∈ Mnd ∧ 𝑥𝐵) → 𝑥𝐵)
5 eqid 2736 . . . . . . 7 (0g𝐺) = (0g𝐺)
61, 5mndidcl 18445 . . . . . 6 (𝐺 ∈ Mnd → (0g𝐺) ∈ 𝐵)
76adantr 482 . . . . 5 ((𝐺 ∈ Mnd ∧ 𝑥𝐵) → (0g𝐺) ∈ 𝐵)
8 eqid 2736 . . . . . . 7 (+g𝐺) = (+g𝐺)
91, 8, 5mndrid 18451 . . . . . 6 ((𝐺 ∈ Mnd ∧ 𝑥𝐵) → (𝑥(+g𝐺)(0g𝐺)) = 𝑥)
109eqcomd 2742 . . . . 5 ((𝐺 ∈ Mnd ∧ 𝑥𝐵) → 𝑥 = (𝑥(+g𝐺)(0g𝐺)))
11 rspceov 7354 . . . . 5 ((𝑥𝐵 ∧ (0g𝐺) ∈ 𝐵𝑥 = (𝑥(+g𝐺)(0g𝐺))) → ∃𝑦𝐵𝑧𝐵 𝑥 = (𝑦(+g𝐺)𝑧))
124, 7, 10, 11syl3anc 1371 . . . 4 ((𝐺 ∈ Mnd ∧ 𝑥𝐵) → ∃𝑦𝐵𝑧𝐵 𝑥 = (𝑦(+g𝐺)𝑧))
131, 8, 2plusfval 18378 . . . . . 6 ((𝑦𝐵𝑧𝐵) → (𝑦 𝑧) = (𝑦(+g𝐺)𝑧))
1413eqeq2d 2747 . . . . 5 ((𝑦𝐵𝑧𝐵) → (𝑥 = (𝑦 𝑧) ↔ 𝑥 = (𝑦(+g𝐺)𝑧)))
15142rexbiia 3206 . . . 4 (∃𝑦𝐵𝑧𝐵 𝑥 = (𝑦 𝑧) ↔ ∃𝑦𝐵𝑧𝐵 𝑥 = (𝑦(+g𝐺)𝑧))
1612, 15sylibr 233 . . 3 ((𝐺 ∈ Mnd ∧ 𝑥𝐵) → ∃𝑦𝐵𝑧𝐵 𝑥 = (𝑦 𝑧))
1716ralrimiva 3140 . 2 (𝐺 ∈ Mnd → ∀𝑥𝐵𝑦𝐵𝑧𝐵 𝑥 = (𝑦 𝑧))
18 foov 7478 . 2 ( :(𝐵 × 𝐵)–onto𝐵 ↔ ( :(𝐵 × 𝐵)⟶𝐵 ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 𝑥 = (𝑦 𝑧)))
193, 17, 18sylanbrc 584 1 (𝐺 ∈ Mnd → :(𝐵 × 𝐵)–onto𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1539  wcel 2104  wral 3062  wrex 3071   × cxp 5598  wf 6454  ontowfo 6456  cfv 6458  (class class class)co 7307  Basecbs 16957  +gcplusg 17007  0gc0g 17195  +𝑓cplusf 18368  Mndcmnd 18430
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-sep 5232  ax-nul 5239  ax-pow 5297  ax-pr 5361  ax-un 7620
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3285  df-reu 3286  df-rab 3287  df-v 3439  df-sbc 3722  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4566  df-pr 4568  df-op 4572  df-uni 4845  df-iun 4933  df-br 5082  df-opab 5144  df-mpt 5165  df-id 5500  df-xp 5606  df-rel 5607  df-cnv 5608  df-co 5609  df-dm 5610  df-rn 5611  df-res 5612  df-ima 5613  df-iota 6410  df-fun 6460  df-fn 6461  df-f 6462  df-fo 6464  df-fv 6466  df-riota 7264  df-ov 7310  df-oprab 7311  df-mpo 7312  df-1st 7863  df-2nd 7864  df-0g 17197  df-plusf 18370  df-mgm 18371  df-sgrp 18420  df-mnd 18431
This theorem is referenced by:  mndfo  18454  grpplusfo  18637
  Copyright terms: Public domain W3C validator