| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rennim | 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 8127 | . . . . . . 7 ⊢ i ∈ ℂ | |
| 2 | recn 8165 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 3 | mulcl 8159 | . . . . . . 7 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
| 4 | 1, 2, 3 | sylancr 414 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (i · 𝐴) ∈ ℂ) |
| 5 | rpre 9895 | . . . . . . 7 ⊢ ((i · 𝐴) ∈ ℝ+ → (i · 𝐴) ∈ ℝ) | |
| 6 | rereb 11425 | . . . . . . 7 ⊢ ((i · 𝐴) ∈ ℂ → ((i · 𝐴) ∈ ℝ ↔ (ℜ‘(i · 𝐴)) = (i · 𝐴))) | |
| 7 | 5, 6 | imbitrid 154 | . . . . . 6 ⊢ ((i · 𝐴) ∈ ℂ → ((i · 𝐴) ∈ ℝ+ → (ℜ‘(i · 𝐴)) = (i · 𝐴))) |
| 8 | 4, 7 | syl 14 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → (ℜ‘(i · 𝐴)) = (i · 𝐴))) |
| 9 | 4 | addlidd 8329 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (0 + (i · 𝐴)) = (i · 𝐴)) |
| 10 | 9 | fveq2d 5643 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (ℜ‘(0 + (i · 𝐴))) = (ℜ‘(i · 𝐴))) |
| 11 | 0re 8179 | . . . . . . . 8 ⊢ 0 ∈ ℝ | |
| 12 | crre 11419 | . . . . . . . 8 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (ℜ‘(0 + (i · 𝐴))) = 0) | |
| 13 | 11, 12 | mpan 424 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (ℜ‘(0 + (i · 𝐴))) = 0) |
| 14 | 10, 13 | eqtr3d 2266 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (ℜ‘(i · 𝐴)) = 0) |
| 15 | 14 | eqeq1d 2240 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((ℜ‘(i · 𝐴)) = (i · 𝐴) ↔ 0 = (i · 𝐴))) |
| 16 | 8, 15 | sylibd 149 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → 0 = (i · 𝐴))) |
| 17 | rpne0 9904 | . . . . . 6 ⊢ ((i · 𝐴) ∈ ℝ+ → (i · 𝐴) ≠ 0) | |
| 18 | 17 | necon2bi 2457 | . . . . 5 ⊢ ((i · 𝐴) = 0 → ¬ (i · 𝐴) ∈ ℝ+) |
| 19 | 18 | eqcoms 2234 | . . . 4 ⊢ (0 = (i · 𝐴) → ¬ (i · 𝐴) ∈ ℝ+) |
| 20 | 16, 19 | syl6 33 | . . 3 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → ¬ (i · 𝐴) ∈ ℝ+)) |
| 21 | 20 | pm2.01d 623 | . 2 ⊢ (𝐴 ∈ ℝ → ¬ (i · 𝐴) ∈ ℝ+) |
| 22 | df-nel 2498 | . 2 ⊢ ((i · 𝐴) ∉ ℝ+ ↔ ¬ (i · 𝐴) ∈ ℝ+) | |
| 23 | 21, 22 | sylibr 134 | 1 ⊢ (𝐴 ∈ ℝ → (i · 𝐴) ∉ ℝ+) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1397 ∈ wcel 2202 ∉ wnel 2497 ‘cfv 5326 (class class class)co 6018 ℂcc 8030 ℝcr 8031 0cc0 8032 ici 8034 + caddc 8035 · cmul 8037 ℝ+crp 9888 ℜcre 11402 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-2 9202 df-rp 9889 df-cj 11404 df-re 11405 df-im 11406 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |