![]() |
Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > readdcnnred | Structured version Visualization version GIF version |
Description: The sum of a real number and an imaginary number is not a real number. (Contributed by AV, 23-Jan-2023.) |
Ref | Expression |
---|---|
recnaddnred.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
recnaddnred.b | ⊢ (𝜑 → 𝐵 ∈ (ℂ ∖ ℝ)) |
Ref | Expression |
---|---|
readdcnnred | ⊢ (𝜑 → (𝐴 + 𝐵) ∉ ℝ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | recnaddnred.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ (ℂ ∖ ℝ)) | |
2 | 1 | eldifbd 3894 | . 2 ⊢ (𝜑 → ¬ 𝐵 ∈ ℝ) |
3 | df-nel 3092 | . . 3 ⊢ ((𝐴 + 𝐵) ∉ ℝ ↔ ¬ (𝐴 + 𝐵) ∈ ℝ) | |
4 | recnaddnred.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
5 | 4 | recnd 10658 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
6 | 1 | eldifad 3893 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
7 | 5, 6 | addcld 10649 | . . . . . 6 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℂ) |
8 | reim0b 14470 | . . . . . 6 ⊢ ((𝐴 + 𝐵) ∈ ℂ → ((𝐴 + 𝐵) ∈ ℝ ↔ (ℑ‘(𝐴 + 𝐵)) = 0)) | |
9 | 7, 8 | syl 17 | . . . . 5 ⊢ (𝜑 → ((𝐴 + 𝐵) ∈ ℝ ↔ (ℑ‘(𝐴 + 𝐵)) = 0)) |
10 | 4 | reim0d 14576 | . . . . . . . . 9 ⊢ (𝜑 → (ℑ‘𝐴) = 0) |
11 | 10 | oveq1d 7150 | . . . . . . . 8 ⊢ (𝜑 → ((ℑ‘𝐴) + (ℑ‘𝐵)) = (0 + (ℑ‘𝐵))) |
12 | 6 | imcld 14546 | . . . . . . . . . 10 ⊢ (𝜑 → (ℑ‘𝐵) ∈ ℝ) |
13 | 12 | recnd 10658 | . . . . . . . . 9 ⊢ (𝜑 → (ℑ‘𝐵) ∈ ℂ) |
14 | 13 | addid2d 10830 | . . . . . . . 8 ⊢ (𝜑 → (0 + (ℑ‘𝐵)) = (ℑ‘𝐵)) |
15 | 11, 14 | eqtrd 2833 | . . . . . . 7 ⊢ (𝜑 → ((ℑ‘𝐴) + (ℑ‘𝐵)) = (ℑ‘𝐵)) |
16 | 15 | eqeq1d 2800 | . . . . . 6 ⊢ (𝜑 → (((ℑ‘𝐴) + (ℑ‘𝐵)) = 0 ↔ (ℑ‘𝐵) = 0)) |
17 | 5, 6 | imaddd 14566 | . . . . . . 7 ⊢ (𝜑 → (ℑ‘(𝐴 + 𝐵)) = ((ℑ‘𝐴) + (ℑ‘𝐵))) |
18 | 17 | eqeq1d 2800 | . . . . . 6 ⊢ (𝜑 → ((ℑ‘(𝐴 + 𝐵)) = 0 ↔ ((ℑ‘𝐴) + (ℑ‘𝐵)) = 0)) |
19 | reim0b 14470 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ ℝ ↔ (ℑ‘𝐵) = 0)) | |
20 | 6, 19 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝐵 ∈ ℝ ↔ (ℑ‘𝐵) = 0)) |
21 | 16, 18, 20 | 3bitr4d 314 | . . . . 5 ⊢ (𝜑 → ((ℑ‘(𝐴 + 𝐵)) = 0 ↔ 𝐵 ∈ ℝ)) |
22 | 9, 21 | bitrd 282 | . . . 4 ⊢ (𝜑 → ((𝐴 + 𝐵) ∈ ℝ ↔ 𝐵 ∈ ℝ)) |
23 | 22 | notbid 321 | . . 3 ⊢ (𝜑 → (¬ (𝐴 + 𝐵) ∈ ℝ ↔ ¬ 𝐵 ∈ ℝ)) |
24 | 3, 23 | syl5bb 286 | . 2 ⊢ (𝜑 → ((𝐴 + 𝐵) ∉ ℝ ↔ ¬ 𝐵 ∈ ℝ)) |
25 | 2, 24 | mpbird 260 | 1 ⊢ (𝜑 → (𝐴 + 𝐵) ∉ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 = wceq 1538 ∈ wcel 2111 ∉ wnel 3091 ∖ cdif 3878 ‘cfv 6324 (class class class)co 7135 ℂcc 10524 ℝcr 10525 0cc0 10526 + caddc 10529 ℑcim 14449 |
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 df-2 11688 df-cj 14450 df-re 14451 df-im 14452 |
This theorem is referenced by: requad01 44139 |
Copyright terms: Public domain | W3C validator |