| 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 7936 | . . . . . . 7 ⊢ <R ⊆ (R × R) | |
| 3 | 2 | brel 4771 | . . . . . 6 ⊢ (0R <R 𝐵 → (0R ∈ R ∧ 𝐵 ∈ R)) |
| 4 | 3 | simprd 114 | . . . . 5 ⊢ (0R <R 𝐵 → 𝐵 ∈ R) |
| 5 | 2 | brel 4771 | . . . . . 6 ⊢ (0R <R 𝐴 → (0R ∈ R ∧ 𝐴 ∈ R)) |
| 6 | 5 | simprd 114 | . . . . 5 ⊢ (0R <R 𝐴 → 𝐴 ∈ R) |
| 7 | 0r 7948 | . . . . . 6 ⊢ 0R ∈ R | |
| 8 | ltasrg 7968 | . . . . . 6 ⊢ ((0R ∈ R ∧ 𝐵 ∈ R ∧ 𝐴 ∈ R) → (0R <R 𝐵 ↔ (𝐴 +R 0R) <R (𝐴 +R 𝐵))) | |
| 9 | 7, 8 | mp3an1 1358 | . . . . 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 7965 | . . . . 5 ⊢ (𝐴 ∈ R → (𝐴 +R 0R) = 𝐴) | |
| 14 | 13 | breq1d 4093 | . . . 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 7962 | . . 3 ⊢ <R Or R | |
| 18 | 17, 2 | sotri 5124 | . 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 2200 class class class wbr 4083 (class class class)co 6007 Rcnr 7495 0Rc0r 7496 +R cplr 7499 <R cltr 7501 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-eprel 4380 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-irdg 6522 df-1o 6568 df-2o 6569 df-oadd 6572 df-omul 6573 df-er 6688 df-ec 6690 df-qs 6694 df-ni 7502 df-pli 7503 df-mi 7504 df-lti 7505 df-plpq 7542 df-mpq 7543 df-enq 7545 df-nqqs 7546 df-plqqs 7547 df-mqqs 7548 df-1nqqs 7549 df-rq 7550 df-ltnqqs 7551 df-enq0 7622 df-nq0 7623 df-0nq0 7624 df-plq0 7625 df-mq0 7626 df-inp 7664 df-i1p 7665 df-iplp 7666 df-iltp 7668 df-enr 7924 df-nr 7925 df-plr 7926 df-ltr 7928 df-0r 7929 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |