| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > redivap | GIF version | ||
| Description: Real part of a division. Related to remul2 11038. (Contributed by Jim Kingdon, 14-Jun-2020.) | 
| Ref | Expression | 
|---|---|
| redivap | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → (ℜ‘(𝐴 / 𝐵)) = ((ℜ‘𝐴) / 𝐵)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | ancom 266 | . . . . 5 ⊢ (((𝐵 ∈ ℝ ∧ 𝐵 # 0) ∧ 𝐴 ∈ ℂ) ↔ (𝐴 ∈ ℂ ∧ (𝐵 ∈ ℝ ∧ 𝐵 # 0))) | |
| 2 | 3anass 984 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) ↔ (𝐴 ∈ ℂ ∧ (𝐵 ∈ ℝ ∧ 𝐵 # 0))) | |
| 3 | 1, 2 | bitr4i 187 | . . . 4 ⊢ (((𝐵 ∈ ℝ ∧ 𝐵 # 0) ∧ 𝐴 ∈ ℂ) ↔ (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0)) | 
| 4 | rerecclap 8757 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐵 # 0) → (1 / 𝐵) ∈ ℝ) | |
| 5 | 4 | anim1i 340 | . . . 4 ⊢ (((𝐵 ∈ ℝ ∧ 𝐵 # 0) ∧ 𝐴 ∈ ℂ) → ((1 / 𝐵) ∈ ℝ ∧ 𝐴 ∈ ℂ)) | 
| 6 | 3, 5 | sylbir 135 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → ((1 / 𝐵) ∈ ℝ ∧ 𝐴 ∈ ℂ)) | 
| 7 | remul2 11038 | . . 3 ⊢ (((1 / 𝐵) ∈ ℝ ∧ 𝐴 ∈ ℂ) → (ℜ‘((1 / 𝐵) · 𝐴)) = ((1 / 𝐵) · (ℜ‘𝐴))) | |
| 8 | 6, 7 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → (ℜ‘((1 / 𝐵) · 𝐴)) = ((1 / 𝐵) · (ℜ‘𝐴))) | 
| 9 | recn 8012 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
| 10 | divrecap2 8716 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = ((1 / 𝐵) · 𝐴)) | |
| 11 | 10 | fveq2d 5562 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (ℜ‘(𝐴 / 𝐵)) = (ℜ‘((1 / 𝐵) · 𝐴))) | 
| 12 | 9, 11 | syl3an2 1283 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → (ℜ‘(𝐴 / 𝐵)) = (ℜ‘((1 / 𝐵) · 𝐴))) | 
| 13 | recl 11018 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℝ) | |
| 14 | 13 | recnd 8055 | . . . 4 ⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ∈ ℂ) | 
| 15 | 14 | 3ad2ant1 1020 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → (ℜ‘𝐴) ∈ ℂ) | 
| 16 | 9 | 3ad2ant2 1021 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → 𝐵 ∈ ℂ) | 
| 17 | simp3 1001 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → 𝐵 # 0) | |
| 18 | 15, 16, 17 | divrecap2d 8821 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → ((ℜ‘𝐴) / 𝐵) = ((1 / 𝐵) · (ℜ‘𝐴))) | 
| 19 | 8, 12, 18 | 3eqtr4d 2239 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ 𝐵 # 0) → (ℜ‘(𝐴 / 𝐵)) = ((ℜ‘𝐴) / 𝐵)) | 
| Colors of variables: wff set class | 
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2167 class class class wbr 4033 ‘cfv 5258 (class class class)co 5922 ℂcc 7877 ℝcr 7878 0cc0 7879 1c1 7880 · cmul 7884 # cap 8608 / cdiv 8699 ℜcre 11005 | 
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-cnex 7970 ax-resscn 7971 ax-1cn 7972 ax-1re 7973 ax-icn 7974 ax-addcl 7975 ax-addrcl 7976 ax-mulcl 7977 ax-mulrcl 7978 ax-addcom 7979 ax-mulcom 7980 ax-addass 7981 ax-mulass 7982 ax-distr 7983 ax-i2m1 7984 ax-0lt1 7985 ax-1rid 7986 ax-0id 7987 ax-rnegex 7988 ax-precex 7989 ax-cnre 7990 ax-pre-ltirr 7991 ax-pre-ltwlin 7992 ax-pre-lttrn 7993 ax-pre-apti 7994 ax-pre-ltadd 7995 ax-pre-mulgt0 7996 ax-pre-mulext 7997 | 
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-br 4034 df-opab 4095 df-mpt 4096 df-id 4328 df-po 4331 df-iso 4332 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-fv 5266 df-riota 5877 df-ov 5925 df-oprab 5926 df-mpo 5927 df-pnf 8063 df-mnf 8064 df-xr 8065 df-ltxr 8066 df-le 8067 df-sub 8199 df-neg 8200 df-reap 8602 df-ap 8609 df-div 8700 df-2 9049 df-cj 11007 df-re 11008 df-im 11009 | 
| This theorem is referenced by: redivapd 11139 | 
| Copyright terms: Public domain | W3C validator |