| 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 2763 | . . 3 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 3 | 1, 2 | mndidcl 18965 | . 2 ⊢ (𝐺 ∈ Mnd → (0g‘𝐺) ∈ 𝐵) |
| 4 | 3 | ne0d 4291 | 1 ⊢ (𝐺 ∈ Mnd → 𝐵 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∅c0 4281 ‘cfv 6555 Basecbs 17413 0gc0g 17636 Mndcmnd 18949 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6509 df-fun 6557 df-fv 6563 df-riota 7397 df-ov 7443 df-0g 17638 df-mgm 18842 df-sgrp 18934 df-mnd 18950 |
| This theorem is used by: slmdbn0 33836 slmdsn0 33839 |
| Copyright terms: Public domain | W3C validator |