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

Theorem srpospr 7615
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 7559 . . 3  |-  R.  =  ( ( P.  X.  P. ) /.  ~R  )
2 breq2 3941 . . . 4  |-  ( [
<. a ,  b >. ]  ~R  =  A  -> 
( 0R  <R  [ <. a ,  b >. ]  ~R  <->  0R 
<R  A ) )
3 eqeq2 2150 . . . . 5  |-  ( [
<. a ,  b >. ]  ~R  =  A  -> 
( [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  [ <. a ,  b
>. ]  ~R  <->  [ <. (
x  +P.  1P ) ,  1P >. ]  ~R  =  A ) )
43reubidv 2617 . . . 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 233 . . 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 7580 . . . . . . . 8  |-  ( 0R 
<R  [ <. a ,  b
>. ]  ~R  <->  b  <P  a )
76biimpi 119 . . . . . . 7  |-  ( 0R 
<R  [ <. a ,  b
>. ]  ~R  ->  b  <P  a )
87adantl 275 . . . . . 6  |-  ( ( ( a  e.  P.  /\  b  e.  P. )  /\  0R  <R  [ <. a ,  b >. ]  ~R  )  ->  b  <P  a
)
9 lteupri 7449 . . . . . 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 109 . . . . . . . . 9  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  x  e.  P. )
12 1pr 7386 . . . . . . . . . 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 7369 . . . . . . . . 9  |-  ( ( x  e.  P.  /\  1P  e.  P. )  -> 
( x  +P.  1P )  e.  P. )
1511, 13, 14syl2anc 409 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
x  +P.  1P )  e.  P. )
16 simplll 523 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  a  e.  P. )
17 simpllr 524 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  b  e.  P. )
18 enreceq 7568 . . . . . . . 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 1218 . . . . . . 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 7410 . . . . . . . . . . . 12  |-  ( ( x  e.  P.  /\  1P  e.  P. )  -> 
( x  +P.  1P )  =  ( 1P  +P.  x ) )
2111, 13, 20syl2anc 409 . . . . . . . . . . 11  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
x  +P.  1P )  =  ( 1P  +P.  x ) )
2221oveq1d 5797 . . . . . . . . . 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 7411 . . . . . . . . . . 11  |-  ( ( 1P  e.  P.  /\  x  e.  P.  /\  b  e.  P. )  ->  (
( 1P  +P.  x
)  +P.  b )  =  ( 1P  +P.  ( x  +P.  b ) ) )
2413, 11, 17, 23syl3anc 1217 . . . . . . . . . 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 2173 . . . . . . . . 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 2149 . . . . . . . 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 7369 . . . . . . . . . . 11  |-  ( ( x  e.  P.  /\  b  e.  P. )  ->  ( x  +P.  b
)  e.  P. )
2811, 17, 27syl2anc 409 . . . . . . . . . 10  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
x  +P.  b )  e.  P. )
29 addcanprg 7448 . . . . . . . . . 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 1217 . . . . . . . . 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 5790 . . . . . . . . 9  |-  ( ( x  +P.  b )  =  a  ->  ( 1P  +P.  ( x  +P.  b ) )  =  ( 1P  +P.  a
) )
3230, 31impbid1 141 . . . . . . . 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 187 . . . . . . 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 7410 . . . . . . . . 9  |-  ( ( x  e.  P.  /\  b  e.  P. )  ->  ( x  +P.  b
)  =  ( b  +P.  x ) )
3511, 17, 34syl2anc 409 . . . . . . . 8  |-  ( ( ( ( a  e. 
P.  /\  b  e.  P. )  /\  0R  <R  [
<. a ,  b >. ]  ~R  )  /\  x  e.  P. )  ->  (
x  +P.  b )  =  ( b  +P.  x ) )
3635eqeq1d 2149 . . . . . . 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 214 . . . . . 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 2616 . . . . 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 146 . . . 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 114 . . 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 6524 . 2  |-  ( A  e.  R.  ->  ( 0R  <R  A  ->  E! x  e.  P.  [ <. ( x  +P.  1P ) ,  1P >. ]  ~R  =  A ) )
4241imp 123 1  |-  ( ( A  e.  R.  /\  0R  <R  A )  ->  E! x  e.  P.  [
<. ( x  +P.  1P ) ,  1P >. ]  ~R  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1332    e. wcel 1481   E!wreu 2419   <.cop 3535   class class class wbr 3937  (class class class)co 5782   [cec 6435   P.cnp 7123   1Pc1p 7124    +P. cpp 7125    <P cltp 7127    ~R cer 7128   R.cnr 7129   0Rc0r 7130    <R cltr 7135
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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510
This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rmo 2425  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-eprel 4219  df-id 4223  df-po 4226  df-iso 4227  df-iord 4296  df-on 4298  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-irdg 6275  df-1o 6321  df-2o 6322  df-oadd 6325  df-omul 6326  df-er 6437  df-ec 6439  df-qs 6443  df-ni 7136  df-pli 7137  df-mi 7138  df-lti 7139  df-plpq 7176  df-mpq 7177  df-enq 7179  df-nqqs 7180  df-plqqs 7181  df-mqqs 7182  df-1nqqs 7183  df-rq 7184  df-ltnqqs 7185  df-enq0 7256  df-nq0 7257  df-0nq0 7258  df-plq0 7259  df-mq0 7260  df-inp 7298  df-i1p 7299  df-iplp 7300  df-iltp 7302  df-enr 7558  df-nr 7559  df-ltr 7562  df-0r 7563
This theorem is referenced by:  prsrriota  7620  caucvgsrlemcl  7621  caucvgsrlemgt1  7627
  Copyright terms: Public domain W3C validator