Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > addcan | Unicode version |
Description: Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 22-Nov-1994.) (Proof shortened by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
addcan |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnegex2 7190 | . . 3 | |
2 | 1 | 3ad2ant1 925 | . 2 |
3 | oveq2 5520 | . . . 4 | |
4 | simprr 484 | . . . . . . 7 | |
5 | 4 | oveq1d 5527 | . . . . . 6 |
6 | simprl 483 | . . . . . . 7 | |
7 | simpl1 907 | . . . . . . 7 | |
8 | simpl2 908 | . . . . . . 7 | |
9 | 6, 7, 8 | addassd 7049 | . . . . . 6 |
10 | addid2 7152 | . . . . . . 7 | |
11 | 8, 10 | syl 14 | . . . . . 6 |
12 | 5, 9, 11 | 3eqtr3d 2080 | . . . . 5 |
13 | 4 | oveq1d 5527 | . . . . . 6 |
14 | simpl3 909 | . . . . . . 7 | |
15 | 6, 7, 14 | addassd 7049 | . . . . . 6 |
16 | addid2 7152 | . . . . . . 7 | |
17 | 14, 16 | syl 14 | . . . . . 6 |
18 | 13, 15, 17 | 3eqtr3d 2080 | . . . . 5 |
19 | 12, 18 | eqeq12d 2054 | . . . 4 |
20 | 3, 19 | syl5ib 143 | . . 3 |
21 | oveq2 5520 | . . 3 | |
22 | 20, 21 | impbid1 130 | . 2 |
23 | 2, 22 | rexlimddv 2437 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 w3a 885 wceq 1243 wcel 1393 wrex 2307 (class class class)co 5512 cc 6887 cc0 6889 caddc 6892 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-resscn 6976 ax-1cn 6977 ax-icn 6979 ax-addcl 6980 ax-addrcl 6981 ax-mulcl 6982 ax-addcom 6984 ax-addass 6986 ax-distr 6988 ax-i2m1 6989 ax-0id 6992 ax-rnegex 6993 ax-cnre 6995 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-un 2922 df-in 2924 df-ss 2931 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-br 3765 df-iota 4867 df-fv 4910 df-ov 5515 |
This theorem is referenced by: addcani 7193 addcand 7195 subcan 7266 |
Copyright terms: Public domain | W3C validator |