Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mappsrpr | Structured version Visualization version GIF version |
Description: Mapping 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 |
---|---|
mappsrpr.2 | ⊢ 𝐶 ∈ R |
Ref | Expression |
---|---|
mappsrpr | ⊢ ((𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ) ↔ 𝐴 ∈ P) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-m1r 10472 | . . . 4 ⊢ -1R = [〈1P, (1P +P 1P)〉] ~R | |
2 | 1 | breq1i 5064 | . . 3 ⊢ (-1R <R [〈𝐴, 1P〉] ~R ↔ [〈1P, (1P +P 1P)〉] ~R <R [〈𝐴, 1P〉] ~R ) |
3 | ltsrpr 10487 | . . 3 ⊢ ([〈1P, (1P +P 1P)〉] ~R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) | |
4 | 2, 3 | bitri 276 | . 2 ⊢ (-1R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) |
5 | mappsrpr.2 | . . 3 ⊢ 𝐶 ∈ R | |
6 | ltasr 10510 | . . 3 ⊢ (𝐶 ∈ R → (-1R <R [〈𝐴, 1P〉] ~R ↔ (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ))) | |
7 | 5, 6 | ax-mp 5 | . 2 ⊢ (-1R <R [〈𝐴, 1P〉] ~R ↔ (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R )) |
8 | ltrelpr 10408 | . . . . 5 ⊢ <P ⊆ (P × P) | |
9 | 8 | brel 5610 | . . . 4 ⊢ ((1P +P 1P)<P ((1P +P 1P) +P 𝐴) → ((1P +P 1P) ∈ P ∧ ((1P +P 1P) +P 𝐴) ∈ P)) |
10 | dmplp 10422 | . . . . . 6 ⊢ dom +P = (P × P) | |
11 | 0npr 10402 | . . . . . 6 ⊢ ¬ ∅ ∈ P | |
12 | 10, 11 | ndmovrcl 7323 | . . . . 5 ⊢ (((1P +P 1P) +P 𝐴) ∈ P → ((1P +P 1P) ∈ P ∧ 𝐴 ∈ P)) |
13 | 12 | simprd 496 | . . . 4 ⊢ (((1P +P 1P) +P 𝐴) ∈ P → 𝐴 ∈ P) |
14 | 9, 13 | simpl2im 504 | . . 3 ⊢ ((1P +P 1P)<P ((1P +P 1P) +P 𝐴) → 𝐴 ∈ P) |
15 | 1pr 10425 | . . . . 5 ⊢ 1P ∈ P | |
16 | addclpr 10428 | . . . . 5 ⊢ ((1P ∈ P ∧ 1P ∈ P) → (1P +P 1P) ∈ P) | |
17 | 15, 15, 16 | mp2an 688 | . . . 4 ⊢ (1P +P 1P) ∈ P |
18 | ltaddpr 10444 | . . . 4 ⊢ (((1P +P 1P) ∈ P ∧ 𝐴 ∈ P) → (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) | |
19 | 17, 18 | mpan 686 | . . 3 ⊢ (𝐴 ∈ P → (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) |
20 | 14, 19 | impbii 210 | . 2 ⊢ ((1P +P 1P)<P ((1P +P 1P) +P 𝐴) ↔ 𝐴 ∈ P) |
21 | 4, 7, 20 | 3bitr3i 302 | 1 ⊢ ((𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ) ↔ 𝐴 ∈ P) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 207 ∈ wcel 2105 〈cop 4563 class class class wbr 5057 (class class class)co 7145 [cec 8276 Pcnp 10269 1Pc1p 10270 +P cpp 10271 <P cltp 10273 ~R cer 10274 Rcnr 10275 -1Rcm1r 10278 +R cplr 10279 <R cltr 10281 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-omul 8096 df-er 8278 df-ec 8280 df-qs 8284 df-ni 10282 df-pli 10283 df-mi 10284 df-lti 10285 df-plpq 10318 df-mpq 10319 df-ltpq 10320 df-enq 10321 df-nq 10322 df-erq 10323 df-plq 10324 df-mq 10325 df-1nq 10326 df-rq 10327 df-ltnq 10328 df-np 10391 df-1p 10392 df-plp 10393 df-ltp 10395 df-enr 10465 df-nr 10466 df-plr 10467 df-ltr 10469 df-m1r 10472 |
This theorem is referenced by: map2psrpr 10520 supsrlem 10521 |
Copyright terms: Public domain | W3C validator |