| 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 8072 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 2 | apreap 8660 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 # 0 ↔ 𝐴 #ℝ 0)) | |
| 3 | 1, 2 | mpan2 425 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 # 0 ↔ 𝐴 #ℝ 0)) |
| 4 | 3 | pm5.32i 454 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) ↔ (𝐴 ∈ ℝ ∧ 𝐴 #ℝ 0)) |
| 5 | recexre 8651 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 #ℝ 0) → ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1) | |
| 6 | 4, 5 | sylbi 121 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1) |
| 7 | eqcom 2207 | . . . . 5 ⊢ (𝑥 = (1 / 𝐴) ↔ (1 / 𝐴) = 𝑥) | |
| 8 | 1cnd 8088 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 1 ∈ ℂ) | |
| 9 | simpr 110 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
| 10 | 9 | recnd 8101 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℂ) |
| 11 | simpll 527 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 12 | 11 | recnd 8101 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℂ) |
| 13 | simplr 528 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 # 0) | |
| 14 | divmulap 8748 | . . . . . 6 ⊢ ((1 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) → ((1 / 𝐴) = 𝑥 ↔ (𝐴 · 𝑥) = 1)) | |
| 15 | 8, 10, 12, 13, 14 | syl112anc 1254 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → ((1 / 𝐴) = 𝑥 ↔ (𝐴 · 𝑥) = 1)) |
| 16 | 7, 15 | bitrid 192 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → (𝑥 = (1 / 𝐴) ↔ (𝐴 · 𝑥) = 1)) |
| 17 | 16 | rexbidva 2503 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (∃𝑥 ∈ ℝ 𝑥 = (1 / 𝐴) ↔ ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1)) |
| 18 | 6, 17 | mpbird 167 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ∃𝑥 ∈ ℝ 𝑥 = (1 / 𝐴)) |
| 19 | risset 2534 | . 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 1373 ∈ wcel 2176 ∃wrex 2485 class class class wbr 4044 (class class class)co 5944 ℂcc 7923 ℝcr 7924 0cc0 7925 1c1 7926 · cmul 7930 #ℝ creap 8647 # cap 8654 / cdiv 8745 |
| 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 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-sep 4162 ax-pow 4218 ax-pr 4253 ax-un 4480 ax-setind 4585 ax-cnex 8016 ax-resscn 8017 ax-1cn 8018 ax-1re 8019 ax-icn 8020 ax-addcl 8021 ax-addrcl 8022 ax-mulcl 8023 ax-mulrcl 8024 ax-addcom 8025 ax-mulcom 8026 ax-addass 8027 ax-mulass 8028 ax-distr 8029 ax-i2m1 8030 ax-0lt1 8031 ax-1rid 8032 ax-0id 8033 ax-rnegex 8034 ax-precex 8035 ax-cnre 8036 ax-pre-ltirr 8037 ax-pre-ltwlin 8038 ax-pre-lttrn 8039 ax-pre-apti 8040 ax-pre-ltadd 8041 ax-pre-mulgt0 8042 ax-pre-mulext 8043 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-nel 2472 df-ral 2489 df-rex 2490 df-reu 2491 df-rmo 2492 df-rab 2493 df-v 2774 df-sbc 2999 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-br 4045 df-opab 4106 df-id 4340 df-po 4343 df-iso 4344 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-iota 5232 df-fun 5273 df-fv 5279 df-riota 5899 df-ov 5947 df-oprab 5948 df-mpo 5949 df-pnf 8109 df-mnf 8110 df-xr 8111 df-ltxr 8112 df-le 8113 df-sub 8245 df-neg 8246 df-reap 8648 df-ap 8655 df-div 8746 |
| This theorem is referenced by: redivclap 8804 rerecclapzi 8849 rerecclapd 8907 rerecapb 8916 ltdiv2 8960 recnz 9466 reexpclzap 10704 redivap 11185 imdivap 11192 caucvgrelemrec 11290 trirec0 15983 |
| Copyright terms: Public domain | W3C validator |