| 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 2966 | . 2 ⊢ ¬ ∅ ≠ ∅ | |
| 2 | rn0 5914 | . . . 4 ⊢ ran ∅ = ∅ | |
| 3 | 2 | eqcomi 2771 | . . 3 ⊢ ∅ = ran ∅ |
| 4 | 3 | grpon0 30991 | . 2 ⊢ (∅ ∈ GrpOp → ∅ ≠ ∅) |
| 5 | 1, 4 | mto 200 | 1 ⊢ ¬ ∅ ∈ GrpOp |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∈ wcel 2145 ≠ wne 2957 ∅c0 4282 ran crn 5660 GrpOpcgr 30978 |
| 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 ax-un 7740 |
| 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-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 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-iun 4956 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-rn 5670 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fo 6543 df-fv 6545 df-ov 7420 df-grpo 30982 |
| This theorem is used by: vsfval 31122 zrdivrng 38711 |
| Copyright terms: Public domain | W3C validator |