| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltpsrpr | Structured version Visualization version GIF version | ||
| Description: Mapping of order from positive signed reals to positive reals. (Contributed by NM, 17-May-1996.) (Revised by Mario Carneiro, 15-Jun-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ltpsrpr.3 | ⊢ 𝐶 ∈ R |
| Ref | Expression |
|---|---|
| ltpsrpr | ⊢ ((𝐶 +R [〈𝐴, 1P〉] ~R ) <R (𝐶 +R [〈𝐵, 1P〉] ~R ) ↔ 𝐴<P 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltpsrpr.3 | . . 3 ⊢ 𝐶 ∈ R | |
| 2 | ltasr 11025 | . . 3 ⊢ (𝐶 ∈ R → ([〈𝐴, 1P〉] ~R <R [〈𝐵, 1P〉] ~R ↔ (𝐶 +R [〈𝐴, 1P〉] ~R ) <R (𝐶 +R [〈𝐵, 1P〉] ~R ))) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ([〈𝐴, 1P〉] ~R <R [〈𝐵, 1P〉] ~R ↔ (𝐶 +R [〈𝐴, 1P〉] ~R ) <R (𝐶 +R [〈𝐵, 1P〉] ~R )) |
| 4 | addcompr 10946 | . . . 4 ⊢ (𝐴 +P 1P) = (1P +P 𝐴) | |
| 5 | 4 | breq1i 5107 | . . 3 ⊢ ((𝐴 +P 1P)<P (1P +P 𝐵) ↔ (1P +P 𝐴)<P (1P +P 𝐵)) |
| 6 | ltsrpr 11002 | . . 3 ⊢ ([〈𝐴, 1P〉] ~R <R [〈𝐵, 1P〉] ~R ↔ (𝐴 +P 1P)<P (1P +P 𝐵)) | |
| 7 | 1pr 10940 | . . . 4 ⊢ 1P ∈ P | |
| 8 | ltapr 10970 | . . . 4 ⊢ (1P ∈ P → (𝐴<P 𝐵 ↔ (1P +P 𝐴)<P (1P +P 𝐵))) | |
| 9 | 7, 8 | ax-mp 5 | . . 3 ⊢ (𝐴<P 𝐵 ↔ (1P +P 𝐴)<P (1P +P 𝐵)) |
| 10 | 5, 6, 9 | 3bitr4i 303 | . 2 ⊢ ([〈𝐴, 1P〉] ~R <R [〈𝐵, 1P〉] ~R ↔ 𝐴<P 𝐵) |
| 11 | 3, 10 | bitr3i 277 | 1 ⊢ ((𝐶 +R [〈𝐴, 1P〉] ~R ) <R (𝐶 +R [〈𝐵, 1P〉] ~R ) ↔ 𝐴<P 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2114 〈cop 4588 class class class wbr 5100 (class class class)co 7370 [cec 8645 Pcnp 10784 1Pc1p 10785 +P cpp 10786 <P cltp 10788 ~R cer 10789 Rcnr 10790 +R cplr 10794 <R cltr 10796 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-inf2 9564 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-oadd 8413 df-omul 8414 df-er 8647 df-ec 8649 df-qs 8653 df-ni 10797 df-pli 10798 df-mi 10799 df-lti 10800 df-plpq 10833 df-mpq 10834 df-ltpq 10835 df-enq 10836 df-nq 10837 df-erq 10838 df-plq 10839 df-mq 10840 df-1nq 10841 df-rq 10842 df-ltnq 10843 df-np 10906 df-1p 10907 df-plp 10908 df-ltp 10910 df-enr 10980 df-nr 10981 df-plr 10982 df-ltr 10984 |
| This theorem is referenced by: supsrlem 11036 |
| Copyright terms: Public domain | W3C validator |