| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0cnALT2 | Structured version Visualization version GIF version | ||
| Description: Alternate proof of 0cnALT 11584 which is shorter, but depends on ax-8 2149, ax-13 2404, ax-sep 5255, ax-nul 5266, ax-pow 5334, ax-pr 5398, ax-un 7783, and every complex number axiom except ax-pre-mulgt0 11316 and ax-pre-sup 11317. (Contributed by NM, 19-Feb-2005.) (Revised by Mario Carneiro, 27-May-2016.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| 0cnALT2 | ⊢ 0 ∈ ℂ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-icn 11298 | . . 3 ⊢ i ∈ ℂ | |
| 2 | cnegex 11530 | . . 3 ⊢ (i ∈ ℂ → ∃𝑥 ∈ ℂ (i + 𝑥) = 0) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ∃𝑥 ∈ ℂ (i + 𝑥) = 0 |
| 4 | addcl 11321 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝑥 ∈ ℂ) → (i + 𝑥) ∈ ℂ) | |
| 5 | 1, 4 | mpan 703 | . . . 4 ⊢ (𝑥 ∈ ℂ → (i + 𝑥) ∈ ℂ) |
| 6 | eleq1 2852 | . . . 4 ⊢ ((i + 𝑥) = 0 → ((i + 𝑥) ∈ ℂ ↔ 0 ∈ ℂ)) | |
| 7 | 5, 6 | syl5ibcom 248 | . . 3 ⊢ (𝑥 ∈ ℂ → ((i + 𝑥) = 0 → 0 ∈ ℂ)) |
| 8 | 7 | rexlimiv 3160 | . 2 ⊢ (∃𝑥 ∈ ℂ (i + 𝑥) = 0 → 0 ∈ ℂ) |
| 9 | 3, 8 | ax-mp 5 | 1 ⊢ 0 ∈ ℂ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 ∃wrex 3090 (class class class)co 7451 ℂcc 11237 0cc0 11239 ici 11241 + caddc 11242 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |