ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  srpospr Unicode version

Theorem srpospr 8150
Description: Mapping from a signed real greater than zero to a positive real. (Contributed by Jim Kingdon, 25-Jun-2021.)
Assertion
Ref Expression
srpospr  |-  ( ( A  e.  R.  /\  0R  <R  A )  ->  E! x  e.  P.  [
<. ( x  +P.  1P ) ,  1P >. ]  ~R  =  A )
Distinct variable group:    x, A

Proof of Theorem srpospr
Dummy variables  a  b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nr 8094 . . 3  |-  R.  =  ( ( P.  X.  P. ) /.  ~R  )
2 breq2 4134 . . . 4  |-  ( [
<. a ,  b >. ]  ~R  =  A  -> 
( 0R  <R  [ <. a ,  b >. ]  ~R  <->  0R 
<R  A ) )
3 eqeq2 2248 . . . . 5  |-  ( [
<. a ,  b >. ]  ~R  =  A  -> 
( [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  <->  [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  A ) )
43reubidv 2737 . . . 4  |-  ( [
<. a ,  b >. ]  ~R  =  A  -> 
( E! x  e. 
P.  [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  <->  E! x  e.  P.  [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  A ) )
52, 4imbi12d 234 . . 3  |-  ( [
<. a ,  b >. ]  ~R  =  A  -> 
( ( 0R  <R  [
<. a ,  b >. ]  ~R  ->  E! x  e.  P.  [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  )  <->  ( 0R  <R  A  ->  E! x  e.  P.  [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  A ) ) )
6 gt0srpr 8115 . . . . . . . 8  |-  ( 0R 
<R  [ <. a ,  b
>. ]  ~R  <->  b  <P  a )
76biimpi 120 . . . . . . 7  |-  ( 0R 
<R  [ <. a ,  b
>. ]  ~R  ->  b  <P  a )
87adantl 277 . . . . . 6  |-  ( ( ( a  e.  P.  /\  b  e.  P. )  /\  0R  <R  [ <. a ,  b >. ]  ~R  )  ->  b  <P  a
)
9 lteupri 7984 . . . . . 6  |-  ( b 
<P  a  ->  E! x  e.  P.  ( b  +P.  x )  =  a )
108, 9syl 14 . . . . 5  |-  ( ( ( a  e.  P.  /\  b  e.  P. )  /\  0R  <R  [ <. a ,  b >. ]  ~R  )  ->  E! x  e. 
P.  ( b  +P.  x )  =  a )
11 simpr 110 . . . . . . . . 9  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  x  e.  P. )
12 1pr 7921 . . . . . . . . . 10  |-  1P  e.  P.
1312a1i 9 . . . . . . . . 9  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  1P  e.  P. )
14 addclpr 7904 . . . . . . . . 9  |-  ( ( x  e.  P.  /\  1P  e.  P. )  -> 
( x  +P.  1P )  e.  P. )
1511, 13, 14syl2anc 415 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
x  +P.  1P )  e.  P. )
16 simplll 539 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  a  e.  P. )
17 simpllr 540 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  b  e.  P. )
18 enreceq 8103 . . . . . . . 8  |-  ( ( ( ( x  +P.  1P )  e.  P.  /\  1P  e.  P. )  /\  ( a  e.  P.  /\  b  e.  P. )
)  ->  ( [ <. ( x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  <->  ( (
x  +P.  1P )  +P.  b )  =  ( 1P  +P.  a ) ) )
1915, 13, 16, 17, 18syl22anc 1279 . . . . . . 7  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  ( [ <. ( x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b >. ]  ~R  <->  ( ( x  +P.  1P )  +P.  b )  =  ( 1P  +P.  a
) ) )
20 addcomprg 7945 . . . . . . . . . . . 12  |-  ( ( x  e.  P.  /\  1P  e.  P. )  -> 
( x  +P.  1P )  =  ( 1P  +P.  x ) )
2111, 13, 20syl2anc 415 . . . . . . . . . . 11  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
x  +P.  1P )  =  ( 1P  +P.  x ) )
2221oveq1d 6100 . . . . . . . . . 10  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( x  +P.  1P )  +P.  b )  =  ( ( 1P  +P.  x )  +P.  b
) )
23 addassprg 7946 . . . . . . . . . . 11  |-  ( ( 1P  e.  P.  /\  x  e.  P.  /\  b  e.  P. )  ->  (
( 1P  +P.  x
)  +P.  b )  =  ( 1P  +P.  ( x  +P.  b ) ) )
2413, 11, 17, 23syl3anc 1278 . . . . . . . . . 10  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( 1P  +P.  x
)  +P.  b )  =  ( 1P  +P.  ( x  +P.  b ) ) )
2522, 24eqtrd 2271 . . . . . . . . 9  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( x  +P.  1P )  +P.  b )  =  ( 1P  +P.  (
x  +P.  b )
) )
2625eqeq1d 2247 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( ( x  +P.  1P )  +P.  b )  =  ( 1P  +P.  a )  <->  ( 1P  +P.  ( x  +P.  b
) )  =  ( 1P  +P.  a ) ) )
27 addclpr 7904 . . . . . . . . . . 11  |-  ( ( x  e.  P.  /\  b  e.  P. )  ->  ( x  +P.  b
)  e.  P. )
2811, 17, 27syl2anc 415 . . . . . . . . . 10  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
x  +P.  b )  e.  P. )
29 addcanprg 7983 . . . . . . . . . 10  |-  ( ( 1P  e.  P.  /\  ( x  +P.  b )  e.  P.  /\  a  e.  P. )  ->  (
( 1P  +P.  (
x  +P.  b )
)  =  ( 1P 
+P.  a )  -> 
( x  +P.  b
)  =  a ) )
3013, 28, 16, 29syl3anc 1278 . . . . . . . . 9  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( 1P  +P.  (
x  +P.  b )
)  =  ( 1P 
+P.  a )  -> 
( x  +P.  b
)  =  a ) )
31 oveq2 6093 . . . . . . . . 9  |-  ( ( x  +P.  b )  =  a  ->  ( 1P  +P.  ( x  +P.  b ) )  =  ( 1P  +P.  a
) )
3230, 31impbid1 142 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( 1P  +P.  (
x  +P.  b )
)  =  ( 1P 
+P.  a )  <->  ( x  +P.  b )  =  a ) )
3326, 32bitrd 188 . . . . . . 7  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( ( x  +P.  1P )  +P.  b )  =  ( 1P  +P.  a )  <->  ( x  +P.  b )  =  a ) )
34 addcomprg 7945 . . . . . . . . 9  |-  ( ( x  e.  P.  /\  b  e.  P. )  ->  ( x  +P.  b
)  =  ( b  +P.  x ) )
3511, 17, 34syl2anc 415 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
x  +P.  b )  =  ( b  +P.  x ) )
3635eqeq1d 2247 . . . . . . 7  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( x  +P.  b
)  =  a  <->  ( b  +P.  x )  =  a ) )
3719, 33, 363bitrrd 215 . . . . . 6  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
( b  +P.  x
)  =  a  <->  [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  ) )
3837reubidva 2736 . . . . 5  |-  ( ( ( a  e.  P.  /\  b  e.  P. )  /\  0R  <R  [ <. a ,  b >. ]  ~R  )  ->  ( E! x  e.  P.  ( b  +P.  x )  =  a  <-> 
E! x  e.  P.  [
<. ( x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  ) )
3910, 38mpbid 147 . . . 4  |-  ( ( ( a  e.  P.  /\  b  e.  P. )  /\  0R  <R  [ <. a ,  b >. ]  ~R  )  ->  E! x  e. 
P.  [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  )
4039ex 115 . . 3  |-  ( ( a  e.  P.  /\  b  e.  P. )  ->  ( 0R  <R  [ <. a ,  b >. ]  ~R  ->  E! x  e.  P.  [
<. ( x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  ) )
411, 5, 40ecoptocl 6896 . 2  |-  ( A  e.  R.  ->  ( 0R  <R  A  ->  E! x  e.  P.  [ <. ( x  +P.  1P ) ,  1P >. ]  ~R  =  A ) )
4241imp 124 1  |-  ( ( A  e.  R.  /\  0R  <R  A )  ->  E! x  e.  P.  [
<. ( x  +P.  1P ) ,  1P >. ]  ~R  =  A )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   E!wreu 2530   <.cop 3712   class class class wbr 4130  (class class class)co 6085   [cec 6805   P.cnp 7658   1Pc1p 7659    +P. cpp 7660    <P cltp 7662    ~R cer 7663   R.cnr 7664   0Rc0r 7665    <R cltr 7670
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-enq0 7791  df-nq0 7792  df-0nq0 7793  df-plq0 7794  df-mq0 7795  df-inp 7833  df-i1p 7834  df-iplp 7835  df-iltp 7837  df-enr 8093  df-nr 8094  df-ltr 8097  df-0r 8098
This theorem is used by:  prsrriota  8155  caucvgsrlemcl  8156  caucvgsrlemgt1  8162
  Copyright terms: Public domain W3C validator