Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > crne0 | Structured version Visualization version GIF version |
Description: The real representation of complex numbers is nonzero iff one of its terms is nonzero. (Contributed by NM, 29-Apr-2005.) (Proof shortened by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
crne0 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≠ 0 ∨ 𝐵 ≠ 0) ↔ (𝐴 + (i · 𝐵)) ≠ 0)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | neorian 3081 | . 2 ⊢ ((𝐴 ≠ 0 ∨ 𝐵 ≠ 0) ↔ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) | |
2 | ax-icn 10585 | . . . . . . . 8 ⊢ i ∈ ℂ | |
3 | 2 | mul01i 10819 | . . . . . . 7 ⊢ (i · 0) = 0 |
4 | 3 | oveq2i 7146 | . . . . . 6 ⊢ (0 + (i · 0)) = (0 + 0) |
5 | 00id 10804 | . . . . . 6 ⊢ (0 + 0) = 0 | |
6 | 4, 5 | eqtri 2821 | . . . . 5 ⊢ (0 + (i · 0)) = 0 |
7 | 6 | eqeq2i 2811 | . . . 4 ⊢ ((𝐴 + (i · 𝐵)) = (0 + (i · 0)) ↔ (𝐴 + (i · 𝐵)) = 0) |
8 | 0re 10632 | . . . . 5 ⊢ 0 ∈ ℝ | |
9 | cru 11617 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (0 ∈ ℝ ∧ 0 ∈ ℝ)) → ((𝐴 + (i · 𝐵)) = (0 + (i · 0)) ↔ (𝐴 = 0 ∧ 𝐵 = 0))) | |
10 | 8, 8, 9 | mpanr12 704 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 + (i · 𝐵)) = (0 + (i · 0)) ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
11 | 7, 10 | bitr3id 288 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 + (i · 𝐵)) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
12 | 11 | necon3abid 3023 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 + (i · 𝐵)) ≠ 0 ↔ ¬ (𝐴 = 0 ∧ 𝐵 = 0))) |
13 | 1, 12 | bitr4id 293 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≠ 0 ∨ 𝐵 ≠ 0) ↔ (𝐴 + (i · 𝐵)) ≠ 0)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 (class class class)co 7135 ℝcr 10525 0cc0 10526 ici 10528 + caddc 10529 · cmul 10531 |
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-pow 5231 ax-pr 5295 ax-un 7441 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 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-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 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-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 |
This theorem is referenced by: crreczi 13585 creq0 30497 |
Copyright terms: Public domain | W3C validator |