nnpcan - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > nnpcan		GIF version

Theorem nnpcan 8093

Description: Cancellation law for subtraction: ((a-b)-c)+b = a-c holds for complex numbers a,b,c. (Contributed by Alexander van der Vekens, 24-Mar-2018.)

**Assertion**
Ref	Expression
nnpcan	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 − 𝐵) − 𝐶) + 𝐵) = (𝐴 − 𝐶))

**Proof of Theorem nnpcan**
Step	Hyp	Ref	Expression
1		subcl 8069	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ)
2	1	3adant3 1002	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ)
3		addsub 8081	. . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 − 𝐵) + 𝐵) − 𝐶) = (((𝐴 − 𝐵) − 𝐶) + 𝐵))
4	3	eqcomd 2163	. . 3 ⊢ (((𝐴 − 𝐵) ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 − 𝐵) − 𝐶) + 𝐵) = (((𝐴 − 𝐵) + 𝐵) − 𝐶))
5	2, 4	syld3an1 1266	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 − 𝐵) − 𝐶) + 𝐵) = (((𝐴 − 𝐵) + 𝐵) − 𝐶))
6		npcan 8079	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴)
7	6	3adant3 1002	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴)
8	7	oveq1d 5836	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 − 𝐵) + 𝐵) − 𝐶) = (𝐴 − 𝐶))
9	5, 8	eqtrd 2190	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 − 𝐵) − 𝐶) + 𝐵) = (𝐴 − 𝐶))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ w3a 963 = wceq 1335 ∈ wcel 2128 (class class class)co 5821 ℂcc 7725 + caddc 7730 − cmin 8041

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-14 2131 ax-ext 2139 ax-sep 4082 ax-pow 4135 ax-pr 4169 ax-setind 4495 ax-resscn 7819 ax-1cn 7820 ax-icn 7822 ax-addcl 7823 ax-addrcl 7824 ax-mulcl 7825 ax-addcom 7827 ax-addass 7829 ax-distr 7831 ax-i2m1 7832 ax-0id 7835 ax-rnegex 7836 ax-cnre 7838

This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-ral 2440 df-rex 2441 df-reu 2442 df-rab 2444 df-v 2714 df-sbc 2938 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-br 3966 df-opab 4026 df-id 4253 df-xp 4591 df-rel 4592 df-cnv 4593 df-co 4594 df-dm 4595 df-iota 5134 df-fun 5171 df-fv 5177 df-riota 5777 df-ov 5824 df-oprab 5825 df-mpo 5826 df-sub 8043

This theorem is referenced by: (None)

W3C validator