| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mndbn0 | Structured version Visualization version GIF version | ||
| Description: The base set of a monoid is not empty. Statement in [Lang] p. 3. (Contributed by AV, 29-Dec-2023.) |
| Ref | Expression |
|---|---|
| mndbn0.b | ⊢ 𝐵 = (Base‘𝐺) |
| Ref | Expression |
|---|---|
| mndbn0 | ⊢ (𝐺 ∈ Mnd → 𝐵 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mndbn0.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2737 | . . 3 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 3 | 1, 2 | mndidcl 18688 | . 2 ⊢ (𝐺 ∈ Mnd → (0g‘𝐺) ∈ 𝐵) |
| 4 | 3 | ne0d 4296 | 1 ⊢ (𝐺 ∈ Mnd → 𝐵 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∅c0 4287 ‘cfv 6502 Basecbs 17150 0gc0g 17373 Mndcmnd 18673 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pr 5381 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-iota 6458 df-fun 6504 df-fv 6510 df-riota 7327 df-ov 7373 df-0g 17375 df-mgm 18579 df-sgrp 18658 df-mnd 18674 |
| This theorem is referenced by: slmdbn0 33308 slmdsn0 33311 |
| Copyright terms: Public domain | W3C validator |