| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subval | GIF version | ||
| Description: Value of subtraction, which is the (unique) element 𝑥 such that 𝐵 + 𝑥 = 𝐴. (Contributed by NM, 4-Aug-2007.) (Revised by Mario Carneiro, 2-Nov-2013.) |
| Ref | Expression |
|---|---|
| subval | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | negeu 8270 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) | |
| 2 | riotacl 5921 | . . . 4 ⊢ (∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴 → (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) ∈ ℂ) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) ∈ ℂ) |
| 4 | 3 | ancoms 268 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) ∈ ℂ) |
| 5 | eqeq2 2216 | . . . 4 ⊢ (𝑦 = 𝐴 → ((𝑧 + 𝑥) = 𝑦 ↔ (𝑧 + 𝑥) = 𝐴)) | |
| 6 | 5 | riotabidv 5908 | . . 3 ⊢ (𝑦 = 𝐴 → (℩𝑥 ∈ ℂ (𝑧 + 𝑥) = 𝑦) = (℩𝑥 ∈ ℂ (𝑧 + 𝑥) = 𝐴)) |
| 7 | oveq1 5958 | . . . . 5 ⊢ (𝑧 = 𝐵 → (𝑧 + 𝑥) = (𝐵 + 𝑥)) | |
| 8 | 7 | eqeq1d 2215 | . . . 4 ⊢ (𝑧 = 𝐵 → ((𝑧 + 𝑥) = 𝐴 ↔ (𝐵 + 𝑥) = 𝐴)) |
| 9 | 8 | riotabidv 5908 | . . 3 ⊢ (𝑧 = 𝐵 → (℩𝑥 ∈ ℂ (𝑧 + 𝑥) = 𝐴) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴)) |
| 10 | df-sub 8252 | . . 3 ⊢ − = (𝑦 ∈ ℂ, 𝑧 ∈ ℂ ↦ (℩𝑥 ∈ ℂ (𝑧 + 𝑥) = 𝑦)) | |
| 11 | 6, 9, 10 | ovmpog 6087 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴)) |
| 12 | 4, 11 | mpd3an3 1351 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2177 ∃!wreu 2487 ℩crio 5905 (class class class)co 5951 ℂcc 7930 + caddc 7935 − cmin 8250 |
| 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 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2180 ax-ext 2188 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-setind 4589 ax-resscn 8024 ax-1cn 8025 ax-icn 8027 ax-addcl 8028 ax-addrcl 8029 ax-mulcl 8030 ax-addcom 8032 ax-addass 8034 ax-distr 8036 ax-i2m1 8037 ax-0id 8040 ax-rnegex 8041 ax-cnre 8043 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3000 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-br 4048 df-opab 4110 df-id 4344 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-iota 5237 df-fun 5278 df-fv 5284 df-riota 5906 df-ov 5954 df-oprab 5955 df-mpo 5956 df-sub 8252 |
| This theorem is referenced by: subcl 8278 subf 8281 subadd 8282 |
| Copyright terms: Public domain | W3C validator |