| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mndfo | 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 2229 | . . . 4 ⊢ (+𝑓‘𝐺) = (+𝑓‘𝐺) | |
| 3 | 1, 2 | mndpfo 13457 | . . 3 ⊢ (𝐺 ∈ Mnd → (+𝑓‘𝐺):(𝐵 × 𝐵)–onto→𝐵) |
| 4 | 3 | adantr 276 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → (+𝑓‘𝐺):(𝐵 × 𝐵)–onto→𝐵) |
| 5 | mndfo.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 6 | 1, 5, 2 | plusfeqg 13383 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → (+𝑓‘𝐺) = + ) |
| 7 | 6 | eqcomd 2235 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → + = (+𝑓‘𝐺)) |
| 8 | foeq1 5540 | . . 3 ⊢ ( + = (+𝑓‘𝐺) → ( + :(𝐵 × 𝐵)–onto→𝐵 ↔ (+𝑓‘𝐺):(𝐵 × 𝐵)–onto→𝐵)) | |
| 9 | 7, 8 | syl 14 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → ( + :(𝐵 × 𝐵)–onto→𝐵 ↔ (+𝑓‘𝐺):(𝐵 × 𝐵)–onto→𝐵)) |
| 10 | 4, 9 | mpbird 167 | 1 ⊢ ((𝐺 ∈ Mnd ∧ + Fn (𝐵 × 𝐵)) → + :(𝐵 × 𝐵)–onto→𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 × cxp 4714 Fn wfn 5309 –onto→wfo 5312 ‘cfv 5314 Basecbs 13018 +gcplusg 13096 +𝑓cplusf 13372 Mndcmnd 13435 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4521 ax-setind 4626 ax-cnex 8078 ax-resscn 8079 ax-1re 8081 ax-addrcl 8084 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4381 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-rn 4727 df-res 4728 df-ima 4729 df-iota 5274 df-fun 5316 df-fn 5317 df-f 5318 df-f1 5319 df-fo 5320 df-f1o 5321 df-fv 5322 df-riota 5947 df-ov 5997 df-oprab 5998 df-mpo 5999 df-1st 6276 df-2nd 6277 df-inn 9099 df-2 9157 df-ndx 13021 df-slot 13022 df-base 13024 df-plusg 13109 df-0g 13277 df-plusf 13374 df-mgm 13375 df-sgrp 13421 df-mnd 13436 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |