![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > divvalap | GIF version |
Description: Value of division: the (unique) element 𝑥 such that (𝐵 · 𝑥) = 𝐴. This is meaningful only when 𝐵 is apart from zero. (Contributed by Jim Kingdon, 21-Feb-2020.) |
Ref | Expression |
---|---|
divvalap | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 999 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → 𝐴 ∈ ℂ) | |
2 | simp2 1000 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → 𝐵 ∈ ℂ) | |
3 | 0cn 8013 | . . . . . 6 ⊢ 0 ∈ ℂ | |
4 | apne 8644 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 0 ∈ ℂ) → (𝐵 # 0 → 𝐵 ≠ 0)) | |
5 | 3, 4 | mpan2 425 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 # 0 → 𝐵 ≠ 0)) |
6 | 5 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 # 0 → 𝐵 ≠ 0)) |
7 | 6 | 3impia 1202 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → 𝐵 ≠ 0) |
8 | eldifsn 3746 | . . 3 ⊢ (𝐵 ∈ (ℂ ∖ {0}) ↔ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) | |
9 | 2, 7, 8 | sylanbrc 417 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → 𝐵 ∈ (ℂ ∖ {0})) |
10 | receuap 8690 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ∃!𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) | |
11 | riotacl 5889 | . . 3 ⊢ (∃!𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴 → (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) ∈ ℂ) | |
12 | 10, 11 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) ∈ ℂ) |
13 | eqeq2 2203 | . . . 4 ⊢ (𝑧 = 𝐴 → ((𝑦 · 𝑥) = 𝑧 ↔ (𝑦 · 𝑥) = 𝐴)) | |
14 | 13 | riotabidv 5876 | . . 3 ⊢ (𝑧 = 𝐴 → (℩𝑥 ∈ ℂ (𝑦 · 𝑥) = 𝑧) = (℩𝑥 ∈ ℂ (𝑦 · 𝑥) = 𝐴)) |
15 | oveq1 5926 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 · 𝑥) = (𝐵 · 𝑥)) | |
16 | 15 | eqeq1d 2202 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝑦 · 𝑥) = 𝐴 ↔ (𝐵 · 𝑥) = 𝐴)) |
17 | 16 | riotabidv 5876 | . . 3 ⊢ (𝑦 = 𝐵 → (℩𝑥 ∈ ℂ (𝑦 · 𝑥) = 𝐴) = (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴)) |
18 | df-div 8694 | . . 3 ⊢ / = (𝑧 ∈ ℂ, 𝑦 ∈ (ℂ ∖ {0}) ↦ (℩𝑥 ∈ ℂ (𝑦 · 𝑥) = 𝑧)) | |
19 | 14, 17, 18 | ovmpog 6054 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ (ℂ ∖ {0}) ∧ (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) ∈ ℂ) → (𝐴 / 𝐵) = (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴)) |
20 | 1, 9, 12, 19 | syl3anc 1249 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ≠ wne 2364 ∃!wreu 2474 ∖ cdif 3151 {csn 3619 class class class wbr 4030 ℩crio 5873 (class class class)co 5919 ℂcc 7872 0cc0 7874 · cmul 7879 # cap 8602 / cdiv 8693 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-br 4031 df-opab 4092 df-id 4325 df-po 4328 df-iso 4329 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-iota 5216 df-fun 5257 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 |
This theorem is referenced by: divmulap 8696 divclap 8699 |
Copyright terms: Public domain | W3C validator |