| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mndpfo | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| mndpf.b | ⊢ 𝐵 = (Base‘𝐺) |
| mndpf.p | ⊢ ⨣ = (+𝑓‘𝐺) |
| Ref | Expression |
|---|---|
| mndpfo | ⊢ (𝐺 ∈ Mnd → ⨣ :(𝐵 × 𝐵)–onto→𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mndpf.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | mndpf.p | . . 3 ⊢ ⨣ = (+𝑓‘𝐺) | |
| 3 | 1, 2 | mndplusf 18806 | . 2 ⊢ (𝐺 ∈ Mnd → ⨣ :(𝐵 × 𝐵)⟶𝐵) |
| 4 | simpr 489 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 5 | eqid 2769 | . . . . . . 7 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 6 | 1, 5 | mndidcl 18803 | . . . . . 6 ⊢ (𝐺 ∈ Mnd → (0g‘𝐺) ∈ 𝐵) |
| 7 | 6 | adantr 485 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (0g‘𝐺) ∈ 𝐵) |
| 8 | eqid 2769 | . . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 9 | 1, 8, 5 | mndrid 18809 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝐺)(0g‘𝐺)) = 𝑥) |
| 10 | 9 | eqcomd 2775 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → 𝑥 = (𝑥(+g‘𝐺)(0g‘𝐺))) |
| 11 | rspceov 7457 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ (0g‘𝐺) ∈ 𝐵 ∧ 𝑥 = (𝑥(+g‘𝐺)(0g‘𝐺))) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) | |
| 12 | 4, 7, 10, 11 | syl3anc 1396 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) |
| 13 | 1, 8, 2 | plusfval 18701 | . . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦 ⨣ 𝑧) = (𝑦(+g‘𝐺)𝑧)) |
| 14 | 13 | eqeq2d 2780 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑥 = (𝑦 ⨣ 𝑧) ↔ 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 15 | 14 | 2rexbiia 3232 | . . . 4 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) |
| 16 | 12, 15 | sylibr 237 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧)) |
| 17 | 16 | ralrimiva 3163 | . 2 ⊢ (𝐺 ∈ Mnd → ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧)) |
| 18 | foov 7582 | . 2 ⊢ ( ⨣ :(𝐵 × 𝐵)–onto→𝐵 ↔ ( ⨣ :(𝐵 × 𝐵)⟶𝐵 ∧ ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧))) | |
| 19 | 3, 17, 18 | sylanbrc 594 | 1 ⊢ (𝐺 ∈ Mnd → ⨣ :(𝐵 × 𝐵)–onto→𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ∃wrex 3095 × cxp 5657 ⟶wf 6530 –onto→wfo 6532 ‘cfv 6534 (class class class)co 7408 Basecbs 17265 +gcplusg 17306 0gc0g 17488 +𝑓cplusf 18691 Mndcmnd 18788 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-fo 6540 df-fv 6542 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7982 df-2nd 7983 df-0g 17490 df-plusf 18693 df-mgm 18694 df-sgrp 18773 df-mnd 18789 |
| This theorem is referenced by: mndfo 18812 grpplusfo 19012 |
| Copyright terms: Public domain | W3C validator |