| 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 8062 | . . . . . . 7 ⊢ i ∈ ℂ | |
| 2 | recn 8100 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 3 | mulcl 8094 | . . . . . . 7 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ) → (i · 𝐴) ∈ ℂ) | |
| 4 | 1, 2, 3 | sylancr 414 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (i · 𝐴) ∈ ℂ) |
| 5 | rpre 9824 | . . . . . . 7 ⊢ ((i · 𝐴) ∈ ℝ+ → (i · 𝐴) ∈ ℝ) | |
| 6 | rereb 11340 | . . . . . . 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 8264 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (0 + (i · 𝐴)) = (i · 𝐴)) |
| 10 | 9 | fveq2d 5607 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (ℜ‘(0 + (i · 𝐴))) = (ℜ‘(i · 𝐴))) |
| 11 | 0re 8114 | . . . . . . . 8 ⊢ 0 ∈ ℝ | |
| 12 | crre 11334 | . . . . . . . 8 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (ℜ‘(0 + (i · 𝐴))) = 0) | |
| 13 | 11, 12 | mpan 424 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (ℜ‘(0 + (i · 𝐴))) = 0) |
| 14 | 10, 13 | eqtr3d 2244 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (ℜ‘(i · 𝐴)) = 0) |
| 15 | 14 | eqeq1d 2218 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((ℜ‘(i · 𝐴)) = (i · 𝐴) ↔ 0 = (i · 𝐴))) |
| 16 | 8, 15 | sylibd 149 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → 0 = (i · 𝐴))) |
| 17 | rpne0 9833 | . . . . . 6 ⊢ ((i · 𝐴) ∈ ℝ+ → (i · 𝐴) ≠ 0) | |
| 18 | 17 | necon2bi 2435 | . . . . 5 ⊢ ((i · 𝐴) = 0 → ¬ (i · 𝐴) ∈ ℝ+) |
| 19 | 18 | eqcoms 2212 | . . . 4 ⊢ (0 = (i · 𝐴) → ¬ (i · 𝐴) ∈ ℝ+) |
| 20 | 16, 19 | syl6 33 | . . 3 ⊢ (𝐴 ∈ ℝ → ((i · 𝐴) ∈ ℝ+ → ¬ (i · 𝐴) ∈ ℝ+)) |
| 21 | 20 | pm2.01d 621 | . 2 ⊢ (𝐴 ∈ ℝ → ¬ (i · 𝐴) ∈ ℝ+) |
| 22 | df-nel 2476 | . 2 ⊢ ((i · 𝐴) ∉ ℝ+ ↔ ¬ (i · 𝐴) ∈ ℝ+) | |
| 23 | 21, 22 | sylibr 134 | 1 ⊢ (𝐴 ∈ ℝ → (i · 𝐴) ∉ ℝ+) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1375 ∈ wcel 2180 ∉ wnel 2475 ‘cfv 5294 (class class class)co 5974 ℂcc 7965 ℝcr 7966 0cc0 7967 ici 7969 + caddc 7970 · cmul 7972 ℝ+crp 9817 ℜcre 11317 |
| 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 617 ax-in2 618 ax-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-sep 4181 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-cnex 8058 ax-resscn 8059 ax-1cn 8060 ax-1re 8061 ax-icn 8062 ax-addcl 8063 ax-addrcl 8064 ax-mulcl 8065 ax-mulrcl 8066 ax-addcom 8067 ax-mulcom 8068 ax-addass 8069 ax-mulass 8070 ax-distr 8071 ax-i2m1 8072 ax-0lt1 8073 ax-1rid 8074 ax-0id 8075 ax-rnegex 8076 ax-precex 8077 ax-cnre 8078 ax-pre-ltirr 8079 ax-pre-ltwlin 8080 ax-pre-lttrn 8081 ax-pre-apti 8082 ax-pre-ltadd 8083 ax-pre-mulgt0 8084 ax-pre-mulext 8085 |
| This theorem depends on definitions: df-bi 117 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-nel 2476 df-ral 2493 df-rex 2494 df-reu 2495 df-rmo 2496 df-rab 2497 df-v 2781 df-sbc 3009 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-br 4063 df-opab 4125 df-mpt 4126 df-id 4361 df-po 4364 df-iso 4365 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-fv 5302 df-riota 5927 df-ov 5977 df-oprab 5978 df-mpo 5979 df-pnf 8151 df-mnf 8152 df-xr 8153 df-ltxr 8154 df-le 8155 df-sub 8287 df-neg 8288 df-reap 8690 df-ap 8697 df-div 8788 df-2 9137 df-rp 9818 df-cj 11319 df-re 11320 df-im 11321 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |