![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mndfo | Structured version Visualization version GIF version |
Description: The addition operation of a monoid is an onto function (assuming it is a function). (Contributed by Mario Carneiro, 11-Oct-2013.) (Proof shortened by AV, 23-Jan-2020.) |
Ref | Expression |
---|---|
mndfo.b | ⊢ 𝐵 = (Base‘𝐺) |
mndfo.p | ⊢ + = (+g‘𝐺) |
Ref | Expression |
---|---|
mndfo | ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → + :(𝐵 × 𝐵)–onto→𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mndfo.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
2 | eqid 2740 | . . . 4 ⊢ (+𝑓‘𝐺) = (+𝑓‘𝐺) | |
3 | 1, 2 | mndpfo 18795 | . . 3 ⊢ (𝐺 ∈ Mnd → (+𝑓‘𝐺):(𝐵 × 𝐵)–onto→𝐵) |
4 | 3 | adantr 480 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → (+𝑓‘𝐺):(𝐵 × 𝐵)–onto→𝐵) |
5 | mndfo.p | . . . . . 6 ⊢ + = (+g‘𝐺) | |
6 | 1, 5, 2 | plusfeq 18686 | . . . . 5 ⊢ ( + Fn (𝐵 × 𝐵) → (+𝑓‘𝐺) = + ) |
7 | 6 | eqcomd 2746 | . . . 4 ⊢ ( + Fn (𝐵 × 𝐵) → + = (+𝑓‘𝐺)) |
8 | 7 | adantl 481 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → + = (+𝑓‘𝐺)) |
9 | foeq1 6830 | . . 3 ⊢ ( + = (+𝑓‘𝐺) → ( + :(𝐵 × 𝐵)–onto→𝐵 ↔ (+𝑓‘𝐺):(𝐵 × 𝐵)–onto→𝐵)) | |
10 | 8, 9 | syl 17 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → ( + :(𝐵 × 𝐵)–onto→𝐵 ↔ (+𝑓‘𝐺):(𝐵 × 𝐵)–onto→𝐵)) |
11 | 4, 10 | mpbird 257 | 1 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → + :(𝐵 × 𝐵)–onto→𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 × cxp 5698 Fn wfn 6568 –onto→wfo 6571 ‘cfv 6573 Basecbs 17258 +gcplusg 17311 +𝑓cplusf 18675 Mndcmnd 18772 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-fo 6579 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 df-0g 17501 df-plusf 18677 df-mgm 18678 df-sgrp 18757 df-mnd 18773 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |