| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rerecclap | GIF version | ||
| Description: Closure law for reciprocal. (Contributed by Jim Kingdon, 26-Feb-2020.) |
| Ref | Expression |
|---|---|
| rerecclap | ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (1 / 𝐴) ∈ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0re 8316 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 2 | apreap 8905 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 # 0 ↔ 𝐴 #ℝ 0)) | |
| 3 | 1, 2 | mpan2 429 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 # 0 ↔ 𝐴 #ℝ 0)) |
| 4 | 3 | pm5.32i 458 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) ↔ (𝐴 ∈ ℝ ∧ 𝐴 #ℝ 0)) |
| 5 | recexre 8896 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 #ℝ 0) → ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1) | |
| 6 | 4, 5 | sylbi 121 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1) |
| 7 | eqcom 2240 | . . . . 5 ⊢ (𝑥 = (1 / 𝐴) ↔ (1 / 𝐴) = 𝑥) | |
| 8 | 1cnd 8332 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 1 ∈ ℂ) | |
| 9 | simpr 110 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
| 10 | 9 | recnd 8344 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℂ) |
| 11 | simpll 531 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 12 | 11 | recnd 8344 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℂ) |
| 13 | simplr 533 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 # 0) | |
| 14 | divmulap 8995 | . . . . . 6 ⊢ ((1 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) → ((1 / 𝐴) = 𝑥 ↔ (𝐴 · 𝑥) = 1)) | |
| 15 | 8, 10, 12, 13, 14 | syl112anc 1282 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → ((1 / 𝐴) = 𝑥 ↔ (𝐴 · 𝑥) = 1)) |
| 16 | 7, 15 | bitrid 192 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → (𝑥 = (1 / 𝐴) ↔ (𝐴 · 𝑥) = 1)) |
| 17 | 16 | rexbidva 2547 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (∃𝑥 ∈ ℝ 𝑥 = (1 / 𝐴) ↔ ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1)) |
| 18 | 6, 17 | mpbird 167 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ∃𝑥 ∈ ℝ 𝑥 = (1 / 𝐴)) |
| 19 | risset 2578 | . 2 ⊢ ((1 / 𝐴) ∈ ℝ ↔ ∃𝑥 ∈ ℝ 𝑥 = (1 / 𝐴)) | |
| 20 | 18, 19 | sylibr 134 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (1 / 𝐴) ∈ ℝ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 class class class wbr 4125 (class class class)co 6075 ℂcc 8167 ℝcr 8168 0cc0 8169 1c1 8170 · cmul 8174 #ℝ creap 8892 # cap 8899 / cdiv 8992 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-mulrcl 8268 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-precex 8279 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 ax-pre-mulgt0 8286 ax-pre-mulext 8287 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-id 4433 df-po 4436 df-iso 4437 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-iota 5332 df-fun 5374 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-reap 8893 df-ap 8900 df-div 8993 |
| This theorem is referenced by: redivclap 9051 rerecclapzi 9096 rerecclapd 9154 rerecapb 9163 ltdiv2 9207 recnz 9718 reexpclzap 10974 redivap 11617 imdivap 11624 caucvgrelemrec 11723 trirec0 16998 |
| Copyright terms: Public domain | W3C validator |