Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rennim | Structured version Visualization version GIF version |
Description: A real number does not lie on the negative imaginary axis. (Contributed by Mario Carneiro, 8-Jul-2013.) |
Ref | Expression |
---|---|
rennim | ⊢ (𝐴 ∈ ℝ → (i · 𝐴) ∉ ℝ+) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-icn 10990 | . . . . . . 7 ⊢ i ∈ ℂ | |
2 | recn 11021 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
3 | mulcl 11015 | . . . . . . 7 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
4 | 1, 2, 3 | sylancr 587 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (i · 𝐴) ∈ ℂ) |
5 | rpre 12798 | . . . . . . 7 ⊢ ((i · 𝐴) ∈ ℝ+ → (i · 𝐴) ∈ ℝ) | |
6 | rereb 14890 | . . . . . . 7 ⊢ ((i · 𝐴) ∈ ℂ → ((i · 𝐴) ∈ ℝ ↔ (ℜ‘(i · 𝐴)) = (i · 𝐴))) | |
7 | 5, 6 | syl5ib 243 | . . . . . 6 ⊢ ((i · 𝐴) ∈ ℂ → ((i · 𝐴) ∈ ℝ+ → (ℜ‘(i · 𝐴)) = (i · 𝐴))) |
8 | 4, 7 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → (ℜ‘(i · 𝐴)) = (i · 𝐴))) |
9 | 4 | addid2d 11236 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (0 + (i · 𝐴)) = (i · 𝐴)) |
10 | 9 | fveq2d 6808 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (ℜ‘(0 + (i · 𝐴))) = (ℜ‘(i · 𝐴))) |
11 | 0re 11037 | . . . . . . . 8 ⊢ 0 ∈ ℝ | |
12 | crre 14884 | . . . . . . . 8 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (ℜ‘(0 + (i · 𝐴))) = 0) | |
13 | 11, 12 | mpan 687 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (ℜ‘(0 + (i · 𝐴))) = 0) |
14 | 10, 13 | eqtr3d 2777 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (ℜ‘(i · 𝐴)) = 0) |
15 | 14 | eqeq1d 2737 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((ℜ‘(i · 𝐴)) = (i · 𝐴) ↔ 0 = (i · 𝐴))) |
16 | 8, 15 | sylibd 238 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → 0 = (i · 𝐴))) |
17 | rpne0 12806 | . . . . . 6 ⊢ ((i · 𝐴) ∈ ℝ+ → (i · 𝐴) ≠ 0) | |
18 | 17 | necon2bi 2970 | . . . . 5 ⊢ ((i · 𝐴) = 0 → ¬ (i · 𝐴) ∈ ℝ+) |
19 | 18 | eqcoms 2743 | . . . 4 ⊢ (0 = (i · 𝐴) → ¬ (i · 𝐴) ∈ ℝ+) |
20 | 16, 19 | syl6 35 | . . 3 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → ¬ (i · 𝐴) ∈ ℝ+)) |
21 | 20 | pm2.01d 189 | . 2 ⊢ (𝐴 ∈ ℝ → ¬ (i · 𝐴) ∈ ℝ+) |
22 | df-nel 3046 | . 2 ⊢ ((i · 𝐴) ∉ ℝ+ ↔ ¬ (i · 𝐴) ∈ ℝ+) | |
23 | 21, 22 | sylibr 233 | 1 ⊢ (𝐴 ∈ ℝ → (i · 𝐴) ∉ ℝ+) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1538 ∈ wcel 2103 ∉ wnel 3045 ‘cfv 6458 (class class class)co 7308 ℂcc 10929 ℝcr 10930 0cc0 10931 ici 10933 + caddc 10934 · cmul 10936 ℝ+crp 12790 ℜcre 14867 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1968 ax-7 2008 ax-8 2105 ax-9 2113 ax-10 2134 ax-11 2151 ax-12 2168 ax-ext 2706 ax-sep 5231 ax-nul 5238 ax-pow 5296 ax-pr 5360 ax-un 7621 ax-resscn 10988 ax-1cn 10989 ax-icn 10990 ax-addcl 10991 ax-addrcl 10992 ax-mulcl 10993 ax-mulrcl 10994 ax-mulcom 10995 ax-addass 10996 ax-mulass 10997 ax-distr 10998 ax-i2m1 10999 ax-1ne0 11000 ax-1rid 11001 ax-rnegex 11002 ax-rrecex 11003 ax-cnre 11004 ax-pre-lttri 11005 ax-pre-lttrn 11006 ax-pre-ltadd 11007 ax-pre-mulgt0 11008 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1541 df-fal 1551 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2727 df-clel 2813 df-nfc 2885 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3339 df-reu 3340 df-rab 3357 df-v 3438 df-sbc 3721 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4565 df-pr 4567 df-op 4571 df-uni 4844 df-br 5081 df-opab 5143 df-mpt 5164 df-id 5500 df-po 5514 df-so 5515 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7265 df-ov 7311 df-oprab 7312 df-mpo 7313 df-er 8534 df-en 8770 df-dom 8771 df-sdom 8772 df-pnf 11071 df-mnf 11072 df-xr 11073 df-ltxr 11074 df-le 11075 df-sub 11267 df-neg 11268 df-div 11693 df-2 12096 df-rp 12791 df-cj 14869 df-re 14870 df-im 14871 |
This theorem is referenced by: sqr0lem 15011 resqreu 15023 resqrtcl 15024 |
Copyright terms: Public domain | W3C validator |