![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > addgt0d | Unicode version |
Description: Addition of 2 positive numbers is positive. (Contributed by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
leidd.1 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
ltnegd.2 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
addgt0d.3 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
addgt0d.4 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
addgt0d |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | leidd.1 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | ltnegd.2 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | 0red 8020 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | addgt0d.3 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
5 | 3, 1, 4 | ltled 8138 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | addgt0d.4 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
7 | 1, 2, 5, 6 | addgegt0d 8538 |
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 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-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-i2m1 7977 ax-0id 7980 ax-rnegex 7981 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-ltadd 7988 |
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-nel 2460 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 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-xp 4665 df-cnv 4667 df-iota 5215 df-fv 5262 df-ov 5921 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 |
This theorem is referenced by: nnoddm1d2 12051 pythagtriplem11 12412 pythagtriplem12 12413 pythagtriplem13 12414 pythagtriplem14 12415 pythagtriplem16 12417 gausslemma2dlem1a 15174 |
Copyright terms: Public domain | W3C validator |