![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 0ngrp | Structured version Visualization version GIF version |
Description: The empty set is not a group. (Contributed by NM, 25-Apr-2007.) (New usage is discouraged.) |
Ref | Expression |
---|---|
0ngrp | ⊢ ¬ ∅ ∈ GrpOp |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | neirr 2996 | . 2 ⊢ ¬ ∅ ≠ ∅ | |
2 | rn0 5760 | . . . 4 ⊢ ran ∅ = ∅ | |
3 | 2 | eqcomi 2807 | . . 3 ⊢ ∅ = ran ∅ |
4 | 3 | grpon0 28285 | . 2 ⊢ (∅ ∈ GrpOp → ∅ ≠ ∅) |
5 | 1, 4 | mto 200 | 1 ⊢ ¬ ∅ ∈ GrpOp |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 2111 ≠ wne 2987 ∅c0 4243 ran crn 5520 GrpOpcgr 28272 |
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-pr 5295 ax-un 7441 |
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-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 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-iun 4883 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-rn 5530 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-fo 6330 df-fv 6332 df-ov 7138 df-grpo 28276 |
This theorem is referenced by: vsfval 28416 zrdivrng 35391 |
Copyright terms: Public domain | W3C validator |