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 7932 | . . . . . 6 ⊢ 0 ∈ ℝ | |
2 | apreap 8518 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 # 0 ↔ 𝐴 #ℝ 0)) | |
3 | 1, 2 | mpan2 425 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 # 0 ↔ 𝐴 #ℝ 0)) |
4 | 3 | pm5.32i 454 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) ↔ (𝐴 ∈ ℝ ∧ 𝐴 #ℝ 0)) |
5 | recexre 8509 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 #ℝ 0) → ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1) | |
6 | 4, 5 | sylbi 121 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1) |
7 | eqcom 2177 | . . . . 5 ⊢ (𝑥 = (1 / 𝐴) ↔ (1 / 𝐴) = 𝑥) | |
8 | 1cnd 7948 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 1 ∈ ℂ) | |
9 | simpr 110 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
10 | 9 | recnd 7960 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℂ) |
11 | simpll 527 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℝ) | |
12 | 11 | recnd 7960 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℂ) |
13 | simplr 528 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → 𝐴 # 0) | |
14 | divmulap 8604 | . . . . . 6 ⊢ ((1 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) → ((1 / 𝐴) = 𝑥 ↔ (𝐴 · 𝑥) = 1)) | |
15 | 8, 10, 12, 13, 14 | syl112anc 1242 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → ((1 / 𝐴) = 𝑥 ↔ (𝐴 · 𝑥) = 1)) |
16 | 7, 15 | bitrid 192 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 # 0) ∧ 𝑥 ∈ ℝ) → (𝑥 = (1 / 𝐴) ↔ (𝐴 · 𝑥) = 1)) |
17 | 16 | rexbidva 2472 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (∃𝑥 ∈ ℝ 𝑥 = (1 / 𝐴) ↔ ∃𝑥 ∈ ℝ (𝐴 · 𝑥) = 1)) |
18 | 6, 17 | mpbird 167 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → ∃𝑥 ∈ ℝ 𝑥 = (1 / 𝐴)) |
19 | risset 2503 | . 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 1353 ∈ wcel 2146 ∃wrex 2454 class class class wbr 3998 (class class class)co 5865 ℂcc 7784 ℝcr 7785 0cc0 7786 1c1 7787 · cmul 7791 #ℝ creap 8505 # cap 8512 / cdiv 8601 |
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 614 ax-in2 615 ax-io 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-13 2148 ax-14 2149 ax-ext 2157 ax-sep 4116 ax-pow 4169 ax-pr 4203 ax-un 4427 ax-setind 4530 ax-cnex 7877 ax-resscn 7878 ax-1cn 7879 ax-1re 7880 ax-icn 7881 ax-addcl 7882 ax-addrcl 7883 ax-mulcl 7884 ax-mulrcl 7885 ax-addcom 7886 ax-mulcom 7887 ax-addass 7888 ax-mulass 7889 ax-distr 7890 ax-i2m1 7891 ax-0lt1 7892 ax-1rid 7893 ax-0id 7894 ax-rnegex 7895 ax-precex 7896 ax-cnre 7897 ax-pre-ltirr 7898 ax-pre-ltwlin 7899 ax-pre-lttrn 7900 ax-pre-apti 7901 ax-pre-ltadd 7902 ax-pre-mulgt0 7903 ax-pre-mulext 7904 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1459 df-sb 1761 df-eu 2027 df-mo 2028 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ne 2346 df-nel 2441 df-ral 2458 df-rex 2459 df-reu 2460 df-rmo 2461 df-rab 2462 df-v 2737 df-sbc 2961 df-dif 3129 df-un 3131 df-in 3133 df-ss 3140 df-pw 3574 df-sn 3595 df-pr 3596 df-op 3598 df-uni 3806 df-br 3999 df-opab 4060 df-id 4287 df-po 4290 df-iso 4291 df-xp 4626 df-rel 4627 df-cnv 4628 df-co 4629 df-dm 4630 df-iota 5170 df-fun 5210 df-fv 5216 df-riota 5821 df-ov 5868 df-oprab 5869 df-mpo 5870 df-pnf 7968 df-mnf 7969 df-xr 7970 df-ltxr 7971 df-le 7972 df-sub 8104 df-neg 8105 df-reap 8506 df-ap 8513 df-div 8602 |
This theorem is referenced by: redivclap 8660 rerecclapzi 8705 rerecclapd 8763 ltdiv2 8815 recnz 9317 reexpclzap 10508 redivap 10849 imdivap 10856 caucvgrelemrec 10954 trirec0 14333 |
Copyright terms: Public domain | W3C validator |