| 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 2762 | . . 3 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 3 | 1, 2 | mndidcl 18854 | . 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 2145 ≠ wne 2957 ∅c0 4282 ‘cfv 6537 Basecbs 17305 0gc0g 17528 Mndcmnd 18838 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| 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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-riota 7373 df-ov 7419 df-0g 17530 df-mgm 18734 df-sgrp 18823 df-mnd 18839 |
| This theorem is used by: slmdbn0 33635 slmdsn0 33638 |
| Copyright terms: Public domain | W3C validator |