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 10679 | . . 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 10600 | . . . 4 ⊢ (𝐴 +P 1P) = (1P +P 𝐴) | |
5 | 4 | breq1i 5046 | . . 3 ⊢ ((𝐴 +P 1P)<P (1P +P 𝐵) ↔ (1P +P 𝐴)<P (1P +P 𝐵)) |
6 | ltsrpr 10656 | . . 3 ⊢ ([〈𝐴, 1P〉] ~R <R [〈𝐵, 1P〉] ~R ↔ (𝐴 +P 1P)<P (1P +P 𝐵)) | |
7 | 1pr 10594 | . . . 4 ⊢ 1P ∈ P | |
8 | ltapr 10624 | . . . 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 2112 〈cop 4533 class class class wbr 5039 (class class class)co 7191 [cec 8367 Pcnp 10438 1Pc1p 10439 +P cpp 10440 <P cltp 10442 ~R cer 10443 Rcnr 10444 +R cplr 10448 <R cltr 10450 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 ax-inf2 9234 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-ral 3056 df-rex 3057 df-reu 3058 df-rmo 3059 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-tp 4532 df-op 4534 df-uni 4806 df-int 4846 df-iun 4892 df-br 5040 df-opab 5102 df-mpt 5121 df-tr 5147 df-id 5440 df-eprel 5445 df-po 5453 df-so 5454 df-fr 5494 df-we 5496 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6140 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7194 df-oprab 7195 df-mpo 7196 df-om 7623 df-1st 7739 df-2nd 7740 df-wrecs 8025 df-recs 8086 df-rdg 8124 df-1o 8180 df-oadd 8184 df-omul 8185 df-er 8369 df-ec 8371 df-qs 8375 df-ni 10451 df-pli 10452 df-mi 10453 df-lti 10454 df-plpq 10487 df-mpq 10488 df-ltpq 10489 df-enq 10490 df-nq 10491 df-erq 10492 df-plq 10493 df-mq 10494 df-1nq 10495 df-rq 10496 df-ltnq 10497 df-np 10560 df-1p 10561 df-plp 10562 df-ltp 10564 df-enr 10634 df-nr 10635 df-plr 10636 df-ltr 10638 |
This theorem is referenced by: supsrlem 10690 |
Copyright terms: Public domain | W3C validator |