| 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 7957 | . . . . . . 7 ⊢ <R ⊆ (R × R) | |
| 3 | 2 | brel 4778 | . . . . . 6 ⊢ (0R <R 𝐵 → (0R ∈ R ∧ 𝐵 ∈ R)) |
| 4 | 3 | simprd 114 | . . . . 5 ⊢ (0R <R 𝐵 → 𝐵 ∈ R) |
| 5 | 2 | brel 4778 | . . . . . 6 ⊢ (0R <R 𝐴 → (0R ∈ R ∧ 𝐴 ∈ R)) |
| 6 | 5 | simprd 114 | . . . . 5 ⊢ (0R <R 𝐴 → 𝐴 ∈ R) |
| 7 | 0r 7969 | . . . . . 6 ⊢ 0R ∈ R | |
| 8 | ltasrg 7989 | . . . . . 6 ⊢ ((0R ∈ R ∧ 𝐵 ∈ R ∧ 𝐴 ∈ R) → (0R <R 𝐵 ↔ (𝐴 +R 0R) <R (𝐴 +R 𝐵))) | |
| 9 | 7, 8 | mp3an1 1360 | . . . . 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 7986 | . . . . 5 ⊢ (𝐴 ∈ R → (𝐴 +R 0R) = 𝐴) | |
| 14 | 13 | breq1d 4098 | . . . 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 7983 | . . 3 ⊢ <R Or R | |
| 18 | 17, 2 | sotri 5132 | . 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 2202 class class class wbr 4088 (class class class)co 6017 Rcnr 7516 0Rc0r 7517 +R cplr 7520 <R cltr 7522 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-eprel 4386 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-irdg 6535 df-1o 6581 df-2o 6582 df-oadd 6585 df-omul 6586 df-er 6701 df-ec 6703 df-qs 6707 df-ni 7523 df-pli 7524 df-mi 7525 df-lti 7526 df-plpq 7563 df-mpq 7564 df-enq 7566 df-nqqs 7567 df-plqqs 7568 df-mqqs 7569 df-1nqqs 7570 df-rq 7571 df-ltnqqs 7572 df-enq0 7643 df-nq0 7644 df-0nq0 7645 df-plq0 7646 df-mq0 7647 df-inp 7685 df-i1p 7686 df-iplp 7687 df-iltp 7689 df-enr 7945 df-nr 7946 df-plr 7947 df-ltr 7949 df-0r 7950 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |