| 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 18677 | . 2 ⊢ (𝐺 ∈ Mnd → ⨣ :(𝐵 × 𝐵)⟶𝐵) |
| 4 | simpr 484 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 5 | eqid 2736 | . . . . . . 7 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 6 | 1, 5 | mndidcl 18674 | . . . . . 6 ⊢ (𝐺 ∈ Mnd → (0g‘𝐺) ∈ 𝐵) |
| 7 | 6 | adantr 480 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (0g‘𝐺) ∈ 𝐵) |
| 8 | eqid 2736 | . . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 9 | 1, 8, 5 | mndrid 18680 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝐺)(0g‘𝐺)) = 𝑥) |
| 10 | 9 | eqcomd 2742 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → 𝑥 = (𝑥(+g‘𝐺)(0g‘𝐺))) |
| 11 | rspceov 7407 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ (0g‘𝐺) ∈ 𝐵 ∧ 𝑥 = (𝑥(+g‘𝐺)(0g‘𝐺))) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) | |
| 12 | 4, 7, 10, 11 | syl3anc 1373 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) |
| 13 | 1, 8, 2 | plusfval 18572 | . . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦 ⨣ 𝑧) = (𝑦(+g‘𝐺)𝑧)) |
| 14 | 13 | eqeq2d 2747 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑥 = (𝑦 ⨣ 𝑧) ↔ 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 15 | 14 | 2rexbiia 3197 | . . . 4 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) |
| 16 | 12, 15 | sylibr 234 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧)) |
| 17 | 16 | ralrimiva 3128 | . 2 ⊢ (𝐺 ∈ Mnd → ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧)) |
| 18 | foov 7532 | . 2 ⊢ ( ⨣ :(𝐵 × 𝐵)–onto→𝐵 ↔ ( ⨣ :(𝐵 × 𝐵)⟶𝐵 ∧ ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧))) | |
| 19 | 3, 17, 18 | sylanbrc 583 | 1 ⊢ (𝐺 ∈ Mnd → ⨣ :(𝐵 × 𝐵)–onto→𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∃wrex 3060 × cxp 5622 ⟶wf 6488 –onto→wfo 6490 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 0gc0g 17359 +𝑓cplusf 18562 Mndcmnd 18659 |
| 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 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fo 6498 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-0g 17361 df-plusf 18564 df-mgm 18565 df-sgrp 18644 df-mnd 18660 |
| This theorem is referenced by: mndfo 18683 grpplusfo 18879 |
| Copyright terms: Public domain | W3C validator |