| 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 8132 | . . . . . . 7 ⊢ i ∈ ℂ | |
| 2 | recn 8170 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 3 | mulcl 8164 | . . . . . . 7 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
| 4 | 1, 2, 3 | sylancr 414 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (i · 𝐴) ∈ ℂ) |
| 5 | rpre 9900 | . . . . . . 7 ⊢ ((i · 𝐴) ∈ ℝ+ → (i · 𝐴) ∈ ℝ) | |
| 6 | rereb 11446 | . . . . . . 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 8334 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (0 + (i · 𝐴)) = (i · 𝐴)) |
| 10 | 9 | fveq2d 5646 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (ℜ‘(0 + (i · 𝐴))) = (ℜ‘(i · 𝐴))) |
| 11 | 0re 8184 | . . . . . . . 8 ⊢ 0 ∈ ℝ | |
| 12 | crre 11440 | . . . . . . . 8 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (ℜ‘(0 + (i · 𝐴))) = 0) | |
| 13 | 11, 12 | mpan 424 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (ℜ‘(0 + (i · 𝐴))) = 0) |
| 14 | 10, 13 | eqtr3d 2265 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (ℜ‘(i · 𝐴)) = 0) |
| 15 | 14 | eqeq1d 2239 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((ℜ‘(i · 𝐴)) = (i · 𝐴) ↔ 0 = (i · 𝐴))) |
| 16 | 8, 15 | sylibd 149 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → 0 = (i · 𝐴))) |
| 17 | rpne0 9909 | . . . . . 6 ⊢ ((i · 𝐴) ∈ ℝ+ → (i · 𝐴) ≠ 0) | |
| 18 | 17 | necon2bi 2456 | . . . . 5 ⊢ ((i · 𝐴) = 0 → ¬ (i · 𝐴) ∈ ℝ+) |
| 19 | 18 | eqcoms 2233 | . . . 4 ⊢ (0 = (i · 𝐴) → ¬ (i · 𝐴) ∈ ℝ+) |
| 20 | 16, 19 | syl6 33 | . . 3 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → ¬ (i · 𝐴) ∈ ℝ+)) |
| 21 | 20 | pm2.01d 623 | . 2 ⊢ (𝐴 ∈ ℝ → ¬ (i · 𝐴) ∈ ℝ+) |
| 22 | df-nel 2497 | . 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 2201 ∉ wnel 2496 ‘cfv 5328 (class class class)co 6023 ℂcc 8035 ℝcr 8036 0cc0 8037 ici 8039 + caddc 8040 · cmul 8042 ℝ+crp 9893 ℜcre 11423 |
| 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 2203 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-mulrcl 8136 ax-addcom 8137 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-1rid 8144 ax-0id 8145 ax-rnegex 8146 ax-precex 8147 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-apti 8152 ax-pre-ltadd 8153 ax-pre-mulgt0 8154 ax-pre-mulext 8155 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-po 4395 df-iso 4396 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-reap 8760 df-ap 8767 df-div 8858 df-2 9207 df-rp 9894 df-cj 11425 df-re 11426 df-im 11427 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |