![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > npcan | GIF version |
Description: Cancellation law for subtraction. (Contributed by NM, 10-May-2004.) (Revised by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
npcan | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | subcl 8218 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
3 | 1, 2 | addcomd 8170 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = (𝐵 + (𝐴 − 𝐵))) |
4 | pncan3 8227 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) | |
5 | 4 | ancoms 268 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + (𝐴 − 𝐵)) = 𝐴) |
6 | 3, 5 | eqtrd 2226 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 (class class class)co 5918 ℂcc 7870 + caddc 7875 − cmin 8190 |
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-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-setind 4569 ax-resscn 7964 ax-1cn 7965 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-distr 7976 ax-i2m1 7977 ax-0id 7980 ax-rnegex 7981 ax-cnre 7983 |
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-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-br 4030 df-opab 4091 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-iota 5215 df-fun 5256 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-sub 8192 |
This theorem is referenced by: addsubass 8229 npncan 8240 nppcan 8241 nnpcan 8242 subcan2 8244 nnncan 8254 npcand 8334 nn1suc 9001 zlem1lt 9373 zltlem1 9374 peano5uzti 9425 nummac 9492 uzp1 9626 peano2uzr 9650 fz01en 10119 fzsuc2 10145 fseq1m1p1 10161 fzoss2 10239 fzoaddel2 10260 fzosplitsnm1 10276 fzosplitprm1 10301 modfzo0difsn 10466 seq3m1 10544 monoord2 10557 ser3mono 10558 seqf1oglem1 10590 seqf1oglem2 10591 expm1t 10638 expubnd 10667 bcm1k 10831 bcn2 10835 hashfzo 10893 seq3coll 10913 shftlem 10960 shftfvalg 10962 shftfval 10965 iserex 11482 serf0 11495 fsumm1 11559 mptfzshft 11585 binomlem 11626 binom1dif 11630 isumsplit 11634 dvdssub2 11978 4sqlem19 12547 |
Copyright terms: Public domain | W3C validator |