| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nppcan | Unicode version | ||
| Description: Cancellation law for subtraction. (Contributed by NM, 1-Sep-2005.) |
| Ref | Expression |
|---|---|
| nppcan |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subcl 8518 |
. . . 4
| |
| 2 | 1 | 3adant3 1048 |
. . 3
|
| 3 | simp3 1030 |
. . 3
| |
| 4 | simp2 1029 |
. . 3
| |
| 5 | 2, 3, 4 | add32d 8487 |
. 2
|
| 6 | npcan 8528 |
. . . 4
| |
| 7 | 6 | oveq1d 6093 |
. . 3
|
| 8 | 7 | 3adant3 1048 |
. 2
|
| 9 | 5, 8 | eqtrd 2271 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-setind 4682 ax-resscn 8264 ax-1cn 8265 ax-icn 8267 ax-addcl 8268 ax-addrcl 8269 ax-mulcl 8270 ax-addcom 8272 ax-addass 8274 ax-distr 8276 ax-i2m1 8277 ax-0id 8280 ax-rnegex 8281 ax-cnre 8283 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-iota 5335 df-fun 5377 df-fv 5383 df-riota 6031 df-ov 6081 df-oprab 6082 df-mpo 6083 df-sub 8492 |
| This theorem is referenced by: nppcan3 8543 nppcand 8655 modfzo0difsn 10813 |
| Copyright terms: Public domain | W3C validator |