| 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 18686 | . 2 ⊢ (𝐺 ∈ Mnd → ⨣ :(𝐵 × 𝐵)⟶𝐵) |
| 4 | simpr 484 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 5 | eqid 2730 | . . . . . . 7 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 6 | 1, 5 | mndidcl 18683 | . . . . . 6 ⊢ (𝐺 ∈ Mnd → (0g‘𝐺) ∈ 𝐵) |
| 7 | 6 | adantr 480 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (0g‘𝐺) ∈ 𝐵) |
| 8 | eqid 2730 | . . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 9 | 1, 8, 5 | mndrid 18689 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝐺)(0g‘𝐺)) = 𝑥) |
| 10 | 9 | eqcomd 2736 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → 𝑥 = (𝑥(+g‘𝐺)(0g‘𝐺))) |
| 11 | rspceov 7439 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ (0g‘𝐺) ∈ 𝐵 ∧ 𝑥 = (𝑥(+g‘𝐺)(0g‘𝐺))) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) | |
| 12 | 4, 7, 10, 11 | syl3anc 1373 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) |
| 13 | 1, 8, 2 | plusfval 18581 | . . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦 ⨣ 𝑧) = (𝑦(+g‘𝐺)𝑧)) |
| 14 | 13 | eqeq2d 2741 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑥 = (𝑦 ⨣ 𝑧) ↔ 𝑥 = (𝑦(+g‘𝐺)𝑧))) |
| 15 | 14 | 2rexbiia 3199 | . . . 4 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦(+g‘𝐺)𝑧)) |
| 16 | 12, 15 | sylibr 234 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧)) |
| 17 | 16 | ralrimiva 3126 | . 2 ⊢ (𝐺 ∈ Mnd → ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧)) |
| 18 | foov 7566 | . 2 ⊢ ( ⨣ :(𝐵 × 𝐵)–onto→𝐵 ↔ ( ⨣ :(𝐵 × 𝐵)⟶𝐵 ∧ ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 ⨣ 𝑧))) | |
| 19 | 3, 17, 18 | sylanbrc 583 | 1 ⊢ (𝐺 ∈ Mnd → ⨣ :(𝐵 × 𝐵)–onto→𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3045 ∃wrex 3054 × cxp 5639 ⟶wf 6510 –onto→wfo 6512 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 +gcplusg 17227 0gc0g 17409 +𝑓cplusf 18571 Mndcmnd 18668 |
| 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 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-fo 6520 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 df-0g 17411 df-plusf 18573 df-mgm 18574 df-sgrp 18653 df-mnd 18669 |
| This theorem is referenced by: mndfo 18692 grpplusfo 18888 |
| Copyright terms: Public domain | W3C validator |