| 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 8069 | . . . . . . 7 ⊢ <R ⊆ (R × R) | |
| 3 | 2 | brel 4807 | . . . . . 6 ⊢ (0R <R 𝐵 → (0R ∈ R ∧ 𝐵 ∈ R)) |
| 4 | 3 | simprd 114 | . . . . 5 ⊢ (0R <R 𝐵 → 𝐵 ∈ R) |
| 5 | 2 | brel 4807 | . . . . . 6 ⊢ (0R <R 𝐴 → (0R ∈ R ∧ 𝐴 ∈ R)) |
| 6 | 5 | simprd 114 | . . . . 5 ⊢ (0R <R 𝐴 → 𝐴 ∈ R) |
| 7 | 0r 8081 | . . . . . 6 ⊢ 0R ∈ R | |
| 8 | ltasrg 8101 | . . . . . 6 ⊢ ((0R ∈ R ∧ 𝐵 ∈ R ∧ 𝐴 ∈ R) → (0R <R 𝐵 ↔ (𝐴 +R 0R) <R (𝐴 +R 𝐵))) | |
| 9 | 7, 8 | mp3an1 1361 | . . . . 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 8098 | . . . . 5 ⊢ (𝐴 ∈ R → (𝐴 +R 0R) = 𝐴) | |
| 14 | 13 | breq1d 4124 | . . . 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 8095 | . . 3 ⊢ <R Or R | |
| 18 | 17, 2 | sotri 5163 | . 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 |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2205 class class class wbr 4114 (class class class)co 6058 Rcnr 7628 0Rc0r 7629 +R cplr 7632 <R cltr 7634 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-eprel 4415 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-irdg 6614 df-1o 6660 df-2o 6661 df-oadd 6664 df-omul 6665 df-er 6780 df-ec 6782 df-qs 6786 df-ni 7635 df-pli 7636 df-mi 7637 df-lti 7638 df-plpq 7675 df-mpq 7676 df-enq 7678 df-nqqs 7679 df-plqqs 7680 df-mqqs 7681 df-1nqqs 7682 df-rq 7683 df-ltnqqs 7684 df-enq0 7755 df-nq0 7756 df-0nq0 7757 df-plq0 7758 df-mq0 7759 df-inp 7797 df-i1p 7798 df-iplp 7799 df-iltp 7801 df-enr 8057 df-nr 8058 df-plr 8059 df-ltr 8061 df-0r 8062 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |