![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > addgt0sr | Structured version Visualization version GIF version |
Description: The sum of two positive signed reals is positive. (Contributed by NM, 14-May-1996.) (New usage is discouraged.) |
Ref | Expression |
---|---|
addgt0sr | ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → 0R <R (𝐴 +R 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltrelsr 11062 | . . . . 5 ⊢ <R ⊆ (R × R) | |
2 | 1 | brel 5741 | . . . 4 ⊢ (0R <R 𝐴 → (0R ∈ R ∧ 𝐴 ∈ R)) |
3 | ltasr 11094 | . . . . 5 ⊢ (𝐴 ∈ R → (0R <R 𝐵 ↔ (𝐴 +R 0R) <R (𝐴 +R 𝐵))) | |
4 | 0idsr 11091 | . . . . . 6 ⊢ (𝐴 ∈ R → (𝐴 +R 0R) = 𝐴) | |
5 | 4 | breq1d 5158 | . . . . 5 ⊢ (𝐴 ∈ R → ((𝐴 +R 0R) <R (𝐴 +R 𝐵) ↔ 𝐴 <R (𝐴 +R 𝐵))) |
6 | 3, 5 | bitrd 278 | . . . 4 ⊢ (𝐴 ∈ R → (0R <R 𝐵 ↔ 𝐴 <R (𝐴 +R 𝐵))) |
7 | 2, 6 | simpl2im 504 | . . 3 ⊢ (0R <R 𝐴 → (0R <R 𝐵 ↔ 𝐴 <R (𝐴 +R 𝐵))) |
8 | 7 | biimpa 477 | . 2 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → 𝐴 <R (𝐴 +R 𝐵)) |
9 | ltsosr 11088 | . . 3 ⊢ <R Or R | |
10 | 9, 1 | sotri 6128 | . 2 ⊢ ((0R <R 𝐴 ∧ 𝐴 <R (𝐴 +R 𝐵)) → 0R <R (𝐴 +R 𝐵)) |
11 | 8, 10 | syldan 591 | 1 ⊢ ((0R <R 𝐴 ∧ 0R <R 𝐵) → 0R <R (𝐴 +R 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∈ wcel 2106 class class class wbr 5148 (class class class)co 7408 Rcnr 10859 0Rc0r 10860 +R cplr 10863 <R cltr 10865 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-inf2 9635 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-1o 8465 df-oadd 8469 df-omul 8470 df-er 8702 df-ec 8704 df-qs 8708 df-ni 10866 df-pli 10867 df-mi 10868 df-lti 10869 df-plpq 10902 df-mpq 10903 df-ltpq 10904 df-enq 10905 df-nq 10906 df-erq 10907 df-plq 10908 df-mq 10909 df-1nq 10910 df-rq 10911 df-ltnq 10912 df-np 10975 df-1p 10976 df-plp 10977 df-ltp 10979 df-enr 11049 df-nr 11050 df-plr 11051 df-ltr 11053 df-0r 11054 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |