Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mappsrprg | GIF version |
Description: Mapping from positive signed reals to positive reals. (Contributed by NM, 17-May-1996.) (Revised by Mario Carneiro, 15-Jun-2013.) |
Ref | Expression |
---|---|
mappsrprg | ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1pr 7362 | . . . . 5 ⊢ 1P ∈ P | |
2 | addclpr 7345 | . . . . 5 ⊢ ((1P ∈ P ∧ 1P ∈ P) → (1P +P 1P) ∈ P) | |
3 | 1, 1, 2 | mp2an 422 | . . . 4 ⊢ (1P +P 1P) ∈ P |
4 | ltaddpr 7405 | . . . 4 ⊢ (((1P +P 1P) ∈ P ∧ 𝐴 ∈ P) → (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) | |
5 | 3, 4 | mpan 420 | . . 3 ⊢ (𝐴 ∈ P → (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) |
6 | 5 | adantr 274 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) |
7 | df-m1r 7541 | . . . . . 6 ⊢ -1R = [〈1P, (1P +P 1P)〉] ~R | |
8 | 7 | breq1i 3936 | . . . . 5 ⊢ (-1R <R [〈𝐴, 1P〉] ~R ↔ [〈1P, (1P +P 1P)〉] ~R <R [〈𝐴, 1P〉] ~R ) |
9 | 1 | a1i 9 | . . . . . 6 ⊢ (𝐴 ∈ P → 1P ∈ P) |
10 | 3 | a1i 9 | . . . . . 6 ⊢ (𝐴 ∈ P → (1P +P 1P) ∈ P) |
11 | id 19 | . . . . . 6 ⊢ (𝐴 ∈ P → 𝐴 ∈ P) | |
12 | ltsrprg 7555 | . . . . . 6 ⊢ (((1P ∈ P ∧ (1P +P 1P) ∈ P) ∧ (𝐴 ∈ P ∧ 1P ∈ P)) → ([〈1P, (1P +P 1P)〉] ~R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴))) | |
13 | 9, 10, 11, 9, 12 | syl22anc 1217 | . . . . 5 ⊢ (𝐴 ∈ P → ([〈1P, (1P +P 1P)〉] ~R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴))) |
14 | 8, 13 | syl5bb 191 | . . . 4 ⊢ (𝐴 ∈ P → (-1R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴))) |
15 | 14 | adantr 274 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (-1R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴))) |
16 | m1r 7560 | . . . 4 ⊢ -1R ∈ R | |
17 | opelxpi 4571 | . . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 1P ∈ P) → 〈𝐴, 1P〉 ∈ (P × P)) | |
18 | enrex 7545 | . . . . . . . 8 ⊢ ~R ∈ V | |
19 | 18 | ecelqsi 6483 | . . . . . . 7 ⊢ (〈𝐴, 1P〉 ∈ (P × P) → [〈𝐴, 1P〉] ~R ∈ ((P × P) / ~R )) |
20 | 17, 19 | syl 14 | . . . . . 6 ⊢ ((𝐴 ∈ P ∧ 1P ∈ P) → [〈𝐴, 1P〉] ~R ∈ ((P × P) / ~R )) |
21 | 1, 20 | mpan2 421 | . . . . 5 ⊢ (𝐴 ∈ P → [〈𝐴, 1P〉] ~R ∈ ((P × P) / ~R )) |
22 | df-nr 7535 | . . . . 5 ⊢ R = ((P × P) / ~R ) | |
23 | 21, 22 | eleqtrrdi 2233 | . . . 4 ⊢ (𝐴 ∈ P → [〈𝐴, 1P〉] ~R ∈ R) |
24 | simpr 109 | . . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → 𝐶 ∈ R) | |
25 | ltasrg 7578 | . . . 4 ⊢ ((-1R ∈ R ∧ [〈𝐴, 1P〉] ~R ∈ R ∧ 𝐶 ∈ R) → (-1R <R [〈𝐴, 1P〉] ~R ↔ (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ))) | |
26 | 16, 23, 24, 25 | mp3an2ani 1322 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (-1R <R [〈𝐴, 1P〉] ~R ↔ (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ))) |
27 | 15, 26 | bitr3d 189 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → ((1P +P 1P)<P ((1P +P 1P) +P 𝐴) ↔ (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ))) |
28 | 6, 27 | mpbid 146 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R )) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 1480 〈cop 3530 class class class wbr 3929 × cxp 4537 (class class class)co 5774 [cec 6427 / cqs 6428 Pcnp 7099 1Pc1p 7100 +P cpp 7101 <P cltp 7103 ~R cer 7104 Rcnr 7105 -1Rcm1r 7108 +R cplr 7109 <R cltr 7111 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-eprel 4211 df-id 4215 df-po 4218 df-iso 4219 df-iord 4288 df-on 4290 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-irdg 6267 df-1o 6313 df-2o 6314 df-oadd 6317 df-omul 6318 df-er 6429 df-ec 6431 df-qs 6435 df-ni 7112 df-pli 7113 df-mi 7114 df-lti 7115 df-plpq 7152 df-mpq 7153 df-enq 7155 df-nqqs 7156 df-plqqs 7157 df-mqqs 7158 df-1nqqs 7159 df-rq 7160 df-ltnqqs 7161 df-enq0 7232 df-nq0 7233 df-0nq0 7234 df-plq0 7235 df-mq0 7236 df-inp 7274 df-i1p 7275 df-iplp 7276 df-iltp 7278 df-enr 7534 df-nr 7535 df-plr 7536 df-ltr 7538 df-m1r 7541 |
This theorem is referenced by: map2psrprg 7613 suplocsrlemb 7614 suplocsrlem 7616 |
Copyright terms: Public domain | W3C validator |