| 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 11084 | . . 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 11005 | . . . 4 ⊢ (𝐴 +P 1P) = (1P +P 𝐴) | |
| 5 | 4 | breq1i 5115 | . . 3 ⊢ ((𝐴 +P 1P)<P (1P +P 𝐵) ↔ (1P +P 𝐴)<P (1P +P 𝐵)) |
| 6 | ltsrpr 11061 | . . 3 ⊢ ([〈𝐴, 1P〉] ~R <R [〈𝐵, 1P〉] ~R ↔ (𝐴 +P 1P)<P (1P +P 𝐵)) | |
| 7 | 1pr 10999 | . . . 4 ⊢ 1P ∈ P | |
| 8 | ltapr 11029 | . . . 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 306 | . 2 ⊢ ([〈𝐴, 1P〉] ~R <R [〈𝐵, 1P〉] ~R ↔ 𝐴<P 𝐵) |
| 11 | 3, 10 | bitr3i 280 | 1 ⊢ ((𝐶 +R [〈𝐴, 1P〉] ~R ) <R (𝐶 +R [〈𝐵, 1P〉] ~R ) ↔ 𝐴<P 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∈ wcel 2141 〈cop 4594 class class class wbr 5108 (class class class)co 7410 [cec 8691 Pcnp 10843 1Pc1p 10844 +P cpp 10845 <P cltp 10847 ~R cer 10848 Rcnr 10849 +R cplr 10853 <R cltr 10855 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9609 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-oadd 8456 df-omul 8457 df-er 8693 df-ec 8695 df-qs 8699 df-ni 10856 df-pli 10857 df-mi 10858 df-lti 10859 df-plpq 10892 df-mpq 10893 df-ltpq 10894 df-enq 10895 df-nq 10896 df-erq 10897 df-plq 10898 df-mq 10899 df-1nq 10900 df-rq 10901 df-ltnq 10902 df-np 10965 df-1p 10966 df-plp 10967 df-ltp 10969 df-enr 11039 df-nr 11040 df-plr 11041 df-ltr 11043 |
| This theorem is referenced by: supsrlem 11095 |
| Copyright terms: Public domain | W3C validator |