![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > subcl | Unicode version |
Description: Closure law for subtraction. (Contributed by NM, 10-May-1999.) (Revised by Mario Carneiro, 21-Dec-2013.) |
Ref | Expression |
---|---|
subcl |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | subval 7978 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | negeu 7977 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | 2 | ancoms 266 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
4 | riotacl 5752 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
5 | 3, 4 | syl 14 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | 1, 5 | eqeltrd 2217 |
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 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 ax-setind 4460 ax-resscn 7736 ax-1cn 7737 ax-icn 7739 ax-addcl 7740 ax-addrcl 7741 ax-mulcl 7742 ax-addcom 7744 ax-addass 7746 ax-distr 7748 ax-i2m1 7749 ax-0id 7752 ax-rnegex 7753 ax-cnre 7755 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-reu 2424 df-rab 2426 df-v 2691 df-sbc 2914 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-opab 3998 df-id 4223 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-iota 5096 df-fun 5133 df-fv 5139 df-riota 5738 df-ov 5785 df-oprab 5786 df-mpo 5787 df-sub 7959 |
This theorem is referenced by: negcl 7986 subf 7988 pncan3 7994 npcan 7995 addsubass 7996 addsub 7997 addsub12 7999 addsubeq4 8001 npncan 8007 nppcan 8008 nnpcan 8009 nppcan3 8010 subcan2 8011 subsub2 8014 subsub4 8019 nnncan 8021 nnncan1 8022 nnncan2 8023 npncan3 8024 addsub4 8029 subadd4 8030 peano2cnm 8052 subcli 8062 subcld 8097 subeqrev 8162 subdi 8171 subdir 8172 mulsub2 8188 recextlem1 8436 recexap 8438 div2subap 8620 cju 8743 halfaddsubcl 8977 halfaddsub 8978 iccf1o 9817 ser3sub 10310 sqsubswap 10384 subsq 10430 subsq2 10431 bcn2 10542 shftval2 10630 2shfti 10635 sqabssub 10860 abssub 10905 abs3dif 10909 abs2dif 10910 abs2difabs 10912 climuni 11094 cjcn2 11117 recn2 11118 imcn2 11119 climsub 11129 fisum0diag2 11248 arisum2 11300 geosergap 11307 geolim 11312 geolim2 11313 georeclim 11314 geo2sum 11315 tanaddap 11482 addsin 11485 fzocongeq 11592 odd2np1 11606 phiprm 11935 cnmet 12738 dveflem 12895 dvef 12896 efimpi 12948 ptolemy 12953 tangtx 12967 abssinper 12975 |
Copyright terms: Public domain | W3C validator |