| 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 1028 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → 𝐴 ∈ ℂ) | |
| 2 | simp2 1029 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → 𝐵 ∈ ℂ) | |
| 3 | 0cn 8318 | . . . . . 6 ⊢ 0 ∈ ℂ | |
| 4 | apne 8952 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 0 ∈ ℂ) → (𝐵 # 0 → 𝐵 ≠ 0)) | |
| 5 | 3, 4 | mpan2 429 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 # 0 → 𝐵 ≠ 0)) |
| 6 | 5 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 # 0 → 𝐵 ≠ 0)) |
| 7 | 6 | 3impia 1231 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → 𝐵 ≠ 0) |
| 8 | eldifsn 3841 | . . 3 ⊢ (𝐵 ∈ (ℂ ∖ {0}) ↔ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) | |
| 9 | 2, 7, 8 | sylanbrc 421 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → 𝐵 ∈ (ℂ ∖ {0})) |
| 10 | receuap 9000 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ∃!𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) | |
| 11 | riotacl 6054 | . . 3 ⊢ (∃!𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴 → (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) ∈ ℂ) | |
| 12 | 10, 11 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) ∈ ℂ) |
| 13 | eqeq2 2248 | . . . 4 ⊢ (𝑧 = 𝐴 → ((𝑦 · 𝑥) = 𝑧 ↔ (𝑦 · 𝑥) = 𝐴)) | |
| 14 | 13 | riotabidv 6040 | . . 3 ⊢ (𝑧 = 𝐴 → (℩𝑥 ∈ ℂ (𝑦 · 𝑥) = 𝑧) = (℩𝑥 ∈ ℂ (𝑦 · 𝑥) = 𝐴)) |
| 15 | oveq1 6092 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 · 𝑥) = (𝐵 · 𝑥)) | |
| 16 | 15 | eqeq1d 2247 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝑦 · 𝑥) = 𝐴 ↔ (𝐵 · 𝑥) = 𝐴)) |
| 17 | 16 | riotabidv 6040 | . . 3 ⊢ (𝑦 = 𝐵 → (℩𝑥 ∈ ℂ (𝑦 · 𝑥) = 𝐴) = (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴)) |
| 18 | df-div 9004 | . . 3 ⊢ / = (𝑧 ∈ ℂ, 𝑦 ∈ (ℂ ∖ {0}) ↦ (℩𝑥 ∈ ℂ (𝑦 · 𝑥) = 𝑧)) | |
| 19 | 14, 17, 18 | ovmpog 6223 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ (ℂ ∖ {0}) ∧ (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) ∈ ℂ) → (𝐴 / 𝐵) = (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴)) |
| 20 | 1, 9, 12, 19 | syl3anc 1278 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ∃!wreu 2530 ∖ cdif 3217 {csn 3709 class class class wbr 4130 ℩crio 6037 (class class class)co 6085 ℂcc 8177 0cc0 8179 · cmul 8184 # cap 8910 / cdiv 9003 |
| This proof depends on 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 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 |
| This proof 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 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-id 4438 df-po 4441 df-iso 4442 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-iota 5337 df-fun 5379 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8904 df-ap 8911 df-div 9004 |
| This theorem is used by: divmulap 9006 divclap 9009 |
| Copyright terms: Public domain | W3C validator |