| 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 7709 | . . . . 5 ⊢ 1P ∈ P | |
| 2 | addclpr 7692 | . . . . 5 ⊢ ((1P ∈ P ∧ 1P ∈ P) → (1P +P 1P) ∈ P) | |
| 3 | 1, 1, 2 | mp2an 426 | . . . 4 ⊢ (1P +P 1P) ∈ P |
| 4 | ltaddpr 7752 | . . . 4 ⊢ (((1P +P 1P) ∈ P ∧ 𝐴 ∈ P) → (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) | |
| 5 | 3, 4 | mpan 424 | . . 3 ⊢ (𝐴 ∈ P → (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) |
| 6 | 5 | adantr 276 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (1P +P 1P)<P ((1P +P 1P) +P 𝐴)) |
| 7 | df-m1r 7888 | . . . . . 6 ⊢ -1R = [〈1P, (1P +P 1P)〉] ~R | |
| 8 | 7 | breq1i 4069 | . . . . 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 7902 | . . . . . 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 1253 | . . . . 5 ⊢ (𝐴 ∈ P → ([〈1P, (1P +P 1P)〉] ~R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴))) |
| 14 | 8, 13 | bitrid 192 | . . . 4 ⊢ (𝐴 ∈ P → (-1R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴))) |
| 15 | 14 | adantr 276 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (-1R <R [〈𝐴, 1P〉] ~R ↔ (1P +P 1P)<P ((1P +P 1P) +P 𝐴))) |
| 16 | m1r 7907 | . . . 4 ⊢ -1R ∈ R | |
| 17 | opelxpi 4728 | . . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 1P ∈ P) → 〈𝐴, 1P〉 ∈ (P × P)) | |
| 18 | enrex 7892 | . . . . . . . 8 ⊢ ~R ∈ V | |
| 19 | 18 | ecelqsi 6706 | . . . . . . 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 425 | . . . . 5 ⊢ (𝐴 ∈ P → [〈𝐴, 1P〉] ~R ∈ ((P × P) / ~R )) |
| 22 | df-nr 7882 | . . . . 5 ⊢ R = ((P × P) / ~R ) | |
| 23 | 21, 22 | eleqtrrdi 2303 | . . . 4 ⊢ (𝐴 ∈ P → [〈𝐴, 1P〉] ~R ∈ R) |
| 24 | simpr 110 | . . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → 𝐶 ∈ R) | |
| 25 | ltasrg 7925 | . . . 4 ⊢ ((-1R ∈ R ∧ [〈𝐴, 1P〉] ~R ∈ R ∧ 𝐶 ∈ R) → (-1R <R [〈𝐴, 1P〉] ~R ↔ (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ))) | |
| 26 | 16, 23, 24, 25 | mp3an2ani 1359 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (-1R <R [〈𝐴, 1P〉] ~R ↔ (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ))) |
| 27 | 15, 26 | bitr3d 190 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → ((1P +P 1P)<P ((1P +P 1P) +P 𝐴) ↔ (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R ))) |
| 28 | 6, 27 | mpbid 147 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ R) → (𝐶 +R -1R) <R (𝐶 +R [〈𝐴, 1P〉] ~R )) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2180 〈cop 3649 class class class wbr 4062 × cxp 4694 (class class class)co 5974 [cec 6648 / cqs 6649 Pcnp 7446 1Pc1p 7447 +P cpp 7448 <P cltp 7450 ~R cer 7451 Rcnr 7452 -1Rcm1r 7455 +R cplr 7456 <R cltr 7458 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-coll 4178 ax-sep 4181 ax-nul 4189 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-iinf 4657 |
| This theorem depends on definitions: df-bi 117 df-dc 839 df-3or 984 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-ral 2493 df-rex 2494 df-reu 2495 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-nul 3472 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-tr 4162 df-eprel 4357 df-id 4361 df-po 4364 df-iso 4365 df-iord 4434 df-on 4436 df-suc 4439 df-iom 4660 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-f1 5299 df-fo 5300 df-f1o 5301 df-fv 5302 df-ov 5977 df-oprab 5978 df-mpo 5979 df-1st 6256 df-2nd 6257 df-recs 6421 df-irdg 6486 df-1o 6532 df-2o 6533 df-oadd 6536 df-omul 6537 df-er 6650 df-ec 6652 df-qs 6656 df-ni 7459 df-pli 7460 df-mi 7461 df-lti 7462 df-plpq 7499 df-mpq 7500 df-enq 7502 df-nqqs 7503 df-plqqs 7504 df-mqqs 7505 df-1nqqs 7506 df-rq 7507 df-ltnqqs 7508 df-enq0 7579 df-nq0 7580 df-0nq0 7581 df-plq0 7582 df-mq0 7583 df-inp 7621 df-i1p 7622 df-iplp 7623 df-iltp 7625 df-enr 7881 df-nr 7882 df-plr 7883 df-ltr 7885 df-m1r 7888 |
| This theorem is referenced by: map2psrprg 7960 suplocsrlemb 7961 suplocsrlem 7963 |
| Copyright terms: Public domain | W3C validator |