| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addgt0sr | GIF version | ||
| Description: The sum of two positive signed reals is positive. (Contributed by NM, 14-May-1996.) |
| Ref | Expression |
|---|---|
| addgt0sr | ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → 0R <R (𝐴 +R 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 110 | . . . 4 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → 0R <R 𝐵) | |
| 2 | ltrelsr 8111 | . . . . . . 7 ⊢ <R ⊆ (R × R) | |
| 3 | 2 | brel 4829 | . . . . . 6 ⊢ (0R <R 𝐵 → (0R ∈ R ∧ 𝐵 ∈ R)) |
| 4 | 3 | simprd 114 | . . . . 5 ⊢ (0R <R 𝐵 → 𝐵 ∈ R) |
| 5 | 2 | brel 4829 | . . . . . 6 ⊢ (0R <R 𝐴 → (0R ∈ R ∧ 𝐴 ∈ R)) |
| 6 | 5 | simprd 114 | . . . . 5 ⊢ (0R <R 𝐴 → 𝐴 ∈ R) |
| 7 | 0r 8123 | . . . . . 6 ⊢ 0R ∈ R | |
| 8 | ltasrg 8143 | . . . . . 6 ⊢ ((0R ∈ R ∧ 𝐵 ∈ R ∧ 𝐴 ∈ R) → (0R <R 𝐵 ↔ (𝐴 +R 0R) <R (𝐴 +R 𝐵))) | |
| 9 | 7, 8 | mp3an1 1365 | . . . . 5 ⊢ ((𝐵 ∈ R ∧ 𝐴 ∈ R) → (0R <R 𝐵 ↔ (𝐴 +R 0R) <R (𝐴 +R 𝐵))) |
| 10 | 4, 6, 9 | syl2anr 290 | . . . 4 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → (0R <R 𝐵 ↔ (𝐴 +R 0R) <R (𝐴 +R 𝐵))) |
| 11 | 1, 10 | mpbid 147 | . . 3 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → (𝐴 +R 0R) <R (𝐴 +R 𝐵)) |
| 12 | 6 | adantr 276 | . . . 4 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → 𝐴 ∈ R) |
| 13 | 0idsr 8140 | . . . . 5 ⊢ (𝐴 ∈ R → (𝐴 +R 0R) = 𝐴) | |
| 14 | 13 | breq1d 4141 | . . . 4 ⊢ (𝐴 ∈ R → ((𝐴 +R 0R) <R (𝐴 +R 𝐵) ↔ 𝐴 <R (𝐴 +R 𝐵))) |
| 15 | 12, 14 | syl 14 | . . 3 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → ((𝐴 +R 0R) <R (𝐴 +R 𝐵) ↔ 𝐴 <R (𝐴 +R 𝐵))) |
| 16 | 11, 15 | mpbid 147 | . 2 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → 𝐴 <R (𝐴 +R 𝐵)) |
| 17 | ltsosr 8137 | . . 3 ⊢ <R Or R | |
| 18 | 17, 2 | sotri 5186 | . 2 ⊢ ((0R <R 𝐴 ∧ 𝐴 <R (𝐴 +R 𝐵)) → 0R <R (𝐴 +R 𝐵)) |
| 19 | 16, 18 | syldan 282 | 1 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → 0R <R (𝐴 +R 𝐵)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 class class class wbr 4131 (class class class)co 6088 Rcnr 7670 0Rc0r 7671 +R cplr 7674 <R cltr 7676 |
| This proof depends on 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-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 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-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-eprel 4436 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-1o 6691 df-2o 6692 df-oadd 6695 df-omul 6696 df-er 6811 df-ec 6813 df-qs 6817 df-ni 7677 df-pli 7678 df-mi 7679 df-lti 7680 df-plpq 7717 df-mpq 7718 df-enq 7720 df-nqqs 7721 df-plqqs 7722 df-mqqs 7723 df-1nqqs 7724 df-rq 7725 df-ltnqqs 7726 df-enq0 7797 df-nq0 7798 df-0nq0 7799 df-plq0 7800 df-mq0 7801 df-inp 7839 df-i1p 7840 df-iplp 7841 df-iltp 7843 df-enr 8099 df-nr 8100 df-plr 8101 df-ltr 8103 df-0r 8104 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |