| 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 2965 | . 2 ⊢ ¬ ∅ ≠ ∅ | |
| 2 | rn0 5908 | . . . 4 ⊢ ran ∅ = ∅ | |
| 3 | 2 | eqcomi 2770 | . . 3 ⊢ ∅ = ran ∅ |
| 4 | 3 | grpon0 31086 | . 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 2956 ∅c0 4279 ran crn 5652 GrpOpcgr 31073 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fo 6537 df-fv 6539 df-ov 7415 df-grpo 31077 |
| This theorem is used by: vsfval 31217 zrdivrng 38855 |
| Copyright terms: Public domain | W3C validator |