![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > grpn0 | Structured version Visualization version GIF version |
Description: A group is not empty. (Contributed by Szymon Jaroszewicz, 3-Apr-2007.) (Revised by Mario Carneiro, 2-Dec-2014.) |
Ref | Expression |
---|---|
grpn0 | ⊢ (𝐺 ∈ Grp → 𝐺 ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2798 | . . 3 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
2 | 1 | grpbn0 18124 | . 2 ⊢ (𝐺 ∈ Grp → (Base‘𝐺) ≠ ∅) |
3 | fveq2 6645 | . . . 4 ⊢ (𝐺 = ∅ → (Base‘𝐺) = (Base‘∅)) | |
4 | base0 16528 | . . . 4 ⊢ ∅ = (Base‘∅) | |
5 | 3, 4 | eqtr4di 2851 | . . 3 ⊢ (𝐺 = ∅ → (Base‘𝐺) = ∅) |
6 | 5 | necon3i 3019 | . 2 ⊢ ((Base‘𝐺) ≠ ∅ → 𝐺 ≠ ∅) |
7 | 2, 6 | syl 17 | 1 ⊢ (𝐺 ∈ Grp → 𝐺 ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∅c0 4243 ‘cfv 6324 Basecbs 16475 Grpcgrp 18095 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-iota 6283 df-fun 6326 df-fv 6332 df-riota 7093 df-ov 7138 df-slot 16479 df-base 16481 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 |
This theorem is referenced by: lactghmga 18525 |
Copyright terms: Public domain | W3C validator |