Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rimul | GIF version |
Description: A real number times the imaginary unit is real only if the number is 0. (Contributed by NM, 28-May-1999.) (Revised by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
rimul | ⊢ ((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) → 𝐴 = 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inelr 8346 | . . 3 ⊢ ¬ i ∈ ℝ | |
2 | recexre 8340 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 #ℝ 0) → ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1) | |
3 | 2 | adantlr 468 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) → ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1) |
4 | simplll 522 | . . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → 𝐴 ∈ ℝ) | |
5 | 4 | recnd 7794 | . . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → 𝐴 ∈ ℂ) |
6 | simprl 520 | . . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → 𝑥 ∈ ℝ) | |
7 | 6 | recnd 7794 | . . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → 𝑥 ∈ ℂ) |
8 | ax-icn 7715 | . . . . . . . . 9 ⊢ i ∈ ℂ | |
9 | mulass 7751 | . . . . . . . . 9 ⊢ ((i ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → ((i · 𝐴) · 𝑥) = (i · (𝐴 · 𝑥))) | |
10 | 8, 9 | mp3an1 1302 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → ((i · 𝐴) · 𝑥) = (i · (𝐴 · 𝑥))) |
11 | 5, 7, 10 | syl2anc 408 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → ((i · 𝐴) · 𝑥) = (i · (𝐴 · 𝑥))) |
12 | oveq2 5782 | . . . . . . . . 9 ⊢ ((𝐴 · 𝑥) = 1 → (i · (𝐴 · 𝑥)) = (i · 1)) | |
13 | 8 | mulid1i 7768 | . . . . . . . . 9 ⊢ (i · 1) = i |
14 | 12, 13 | syl6eq 2188 | . . . . . . . 8 ⊢ ((𝐴 · 𝑥) = 1 → (i · (𝐴 · 𝑥)) = i) |
15 | 14 | ad2antll 482 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → (i · (𝐴 · 𝑥)) = i) |
16 | 11, 15 | eqtrd 2172 | . . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → ((i · 𝐴) · 𝑥) = i) |
17 | simpllr 523 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → (i · 𝐴) ∈ ℝ) | |
18 | 17, 6 | remulcld 7796 | . . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → ((i · 𝐴) · 𝑥) ∈ ℝ) |
19 | 16, 18 | eqeltrrd 2217 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) ∧ (𝑥 ∈ ℝ ∧ (𝐴 · 𝑥) = 1)) → i ∈ ℝ) |
20 | 3, 19 | rexlimddv 2554 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) ∧ 𝐴 #ℝ 0) → i ∈ ℝ) |
21 | 20 | ex 114 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) → (𝐴 #ℝ 0 → i ∈ ℝ)) |
22 | 1, 21 | mtoi 653 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) → ¬ 𝐴 #ℝ 0) |
23 | 0re 7766 | . . . 4 ⊢ 0 ∈ ℝ | |
24 | reapti 8341 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 = 0 ↔ ¬ 𝐴 #ℝ 0)) | |
25 | 23, 24 | mpan2 421 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 = 0 ↔ ¬ 𝐴 #ℝ 0)) |
26 | 25 | adantr 274 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) → (𝐴 = 0 ↔ ¬ 𝐴 #ℝ 0)) |
27 | 22, 26 | mpbird 166 | 1 ⊢ ((𝐴 ∈ ℝ ∧ (i · 𝐴) ∈ ℝ) → 𝐴 = 0) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 ∃wrex 2417 class class class wbr 3929 (class class class)co 5774 ℂcc 7618 ℝcr 7619 0cc0 7620 1c1 7621 ici 7622 · cmul 7625 #ℝ creap 8336 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-mulrcl 7719 ax-addcom 7720 ax-mulcom 7721 ax-addass 7722 ax-mulass 7723 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-1rid 7727 ax-0id 7728 ax-rnegex 7729 ax-precex 7730 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 ax-pre-mulgt0 7737 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7802 df-mnf 7803 df-ltxr 7805 df-sub 7935 df-neg 7936 df-reap 8337 |
This theorem is referenced by: rereim 8348 cru 8364 cju 8719 crre 10629 |
Copyright terms: Public domain | W3C validator |