| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: The empty set is not a complex number. |
| Ref | Expression |
|---|---|
| 0ncn | ⊢ ¬ ∅ ∈ ℂ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0nelxp 2475 | . 2 ⊢ ¬ ∅ ∈ (R × R) | |
| 2 | df-c 4034 | . . 3 ⊢ ℂ = (R × R) | |
| 3 | 2 | eleq2i 1153 | . 2 ⊢ (∅ ∈ ℂ ↔ ∅ ∈ (R × R)) |
| 4 | 1, 3 | mtbir 167 | 1 ⊢ ¬ ∅ ∈ ℂ |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 1 ∈ wcel 1092 ∅c0 1707 × cxp 2408 Rcnr 3787 ℂcc 4026 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-pow 1077 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-nul 1708 df-pw 1799 df-sn 1811 df-pr 1812 df-op 1815 df-opab 2098 df-xp 2424 df-c 4034 |