Theorem subval 10567

Description: Value of subtraction, which is the (unique) element 𝑥 such that 𝐵 + 𝑥 = 𝐴. (Contributed by NM, 4-Aug-2007.) (Revised by Mario Carneiro, 2-Nov-2013.)

Assertion

Ref	Expression
subval	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem subval

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq2 2828	. . 3 ⊢ (𝑦 = 𝐴 → ((𝑧 + 𝑥) = 𝑦 ↔ (𝑧 + 𝑥) = 𝐴))
2	1	riotabidv 6847	. 2 ⊢ (𝑦 = 𝐴 → (℩𝑥 ∈ ℂ (𝑧 + 𝑥) = 𝑦) = (℩𝑥 ∈ ℂ (𝑧 + 𝑥) = 𝐴))
3		oveq1 6891	. . . 4 ⊢ (𝑧 = 𝐵 → (𝑧 + 𝑥) = (𝐵 + 𝑥))
4	3	eqeq1d 2819	. . 3 ⊢ (𝑧 = 𝐵 → ((𝑧 + 𝑥) = 𝐴 ↔ (𝐵 + 𝑥) = 𝐴))
5	4	riotabidv 6847	. 2 ⊢ (𝑧 = 𝐵 → (℩𝑥 ∈ ℂ (𝑧 + 𝑥) = 𝐴) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴))
6		df-sub 10563	. 2 ⊢ − = (𝑦 ∈ ℂ, 𝑧 ∈ ℂ ↦ (℩𝑥 ∈ ℂ (𝑧 + 𝑥) = 𝑦))
7		riotaex 6849	. 2 ⊢ (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) ∈ V
8	2, 5, 6, 7	ovmpt2 7036	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1637   ∈ wcel 2157  ℩crio 6844  (class class class)co 6884  ℂcc 10229   + caddc 10234   − cmin 10561

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-9 2166  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422  ax-ext 2795  ax-sep 4988  ax-nul 4996  ax-pr 5109

This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2062  df-mo 2635  df-eu 2642  df-clab 2804  df-cleq 2810  df-clel 2813  df-nfc 2948  df-ral 3112  df-rex 3113  df-rab 3116  df-v 3404  df-sbc 3645  df-dif 3783  df-un 3785  df-in 3787  df-ss 3794  df-nul 4128  df-if 4291  df-sn 4382  df-pr 4384  df-op 4388  df-uni 4642  df-br 4856  df-opab 4918  df-id 5232  df-xp 5330  df-rel 5331  df-cnv 5332  df-co 5333  df-dm 5334  df-iota 6074  df-fun 6113  df-fv 6119  df-riota 6845  df-ov 6887  df-oprab 6888  df-mpt2 6889  df-sub 10563

This theorem is referenced by:  subcl  10575  subf  10578  subadd  10579