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

Theorem prmuloc2 7680
Description: Positive reals are multiplicatively located. This is a variation of prmuloc 7679 which only constructs one (named) point and is therefore often easier to work with. It states that given a ratio  B, there are elements of the lower and upper cut which have exactly that ratio between them. (Contributed by Jim Kingdon, 28-Dec-2019.)
Assertion
Ref Expression
prmuloc2  |-  ( (
<. L ,  U >.  e. 
P.  /\  1Q  <Q  B )  ->  E. x  e.  L  ( x  .Q  B )  e.  U
)
Distinct variable groups:    x, B    x, L    x, U

Proof of Theorem prmuloc2
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 prmuloc 7679 . 2  |-  ( (
<. L ,  U >.  e. 
P.  /\  1Q  <Q  B )  ->  E. x  e.  Q.  E. y  e. 
Q.  ( x  e.  L  /\  y  e.  U  /\  ( y  .Q  1Q )  <Q 
( x  .Q  B
) ) )
2 nfv 1551 . . 3  |-  F/ x
( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )
3 nfre1 2549 . . 3  |-  F/ x E. x  e.  L  ( x  .Q  B
)  e.  U
4 simpr1 1006 . . . . . . . 8  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  ->  x  e.  L )
5 simpr3 1008 . . . . . . . . . 10  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  -> 
( y  .Q  1Q )  <Q  ( x  .Q  B ) )
6 simplrr 536 . . . . . . . . . . 11  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  -> 
y  e.  Q. )
7 mulidnq 7502 . . . . . . . . . . 11  |-  ( y  e.  Q.  ->  (
y  .Q  1Q )  =  y )
8 breq1 4047 . . . . . . . . . . 11  |-  ( ( y  .Q  1Q )  =  y  ->  (
( y  .Q  1Q )  <Q  ( x  .Q  B )  <->  y  <Q  ( x  .Q  B ) ) )
96, 7, 83syl 17 . . . . . . . . . 10  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  -> 
( ( y  .Q  1Q )  <Q  (
x  .Q  B )  <-> 
y  <Q  ( x  .Q  B ) ) )
105, 9mpbid 147 . . . . . . . . 9  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  -> 
y  <Q  ( x  .Q  B ) )
11 simplll 533 . . . . . . . . . 10  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  ->  <. L ,  U >.  e. 
P. )
12 simpr2 1007 . . . . . . . . . 10  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  -> 
y  e.  U )
13 prcunqu 7598 . . . . . . . . . 10  |-  ( (
<. L ,  U >.  e. 
P.  /\  y  e.  U )  ->  (
y  <Q  ( x  .Q  B )  ->  (
x  .Q  B )  e.  U ) )
1411, 12, 13syl2anc 411 . . . . . . . . 9  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  -> 
( y  <Q  (
x  .Q  B )  ->  ( x  .Q  B )  e.  U
) )
1510, 14mpd 13 . . . . . . . 8  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  -> 
( x  .Q  B
)  e.  U )
16 rspe 2555 . . . . . . . 8  |-  ( ( x  e.  L  /\  ( x  .Q  B
)  e.  U )  ->  E. x  e.  L  ( x  .Q  B
)  e.  U )
174, 15, 16syl2anc 411 . . . . . . 7  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  ( x  e.  Q.  /\  y  e.  Q. )
)  /\  ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) ) )  ->  E. x  e.  L  ( x  .Q  B
)  e.  U )
1817ex 115 . . . . . 6  |-  ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  (
x  e.  Q.  /\  y  e.  Q. )
)  ->  ( (
x  e.  L  /\  y  e.  U  /\  ( y  .Q  1Q )  <Q  ( x  .Q  B ) )  ->  E. x  e.  L  ( x  .Q  B
)  e.  U ) )
1918anassrs 400 . . . . 5  |-  ( ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  x  e.  Q. )  /\  y  e.  Q. )  ->  ( ( x  e.  L  /\  y  e.  U  /\  (
y  .Q  1Q ) 
<Q  ( x  .Q  B
) )  ->  E. x  e.  L  ( x  .Q  B )  e.  U
) )
2019rexlimdva 2623 . . . 4  |-  ( ( ( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )  /\  x  e.  Q. )  ->  ( E. y  e.  Q.  ( x  e.  L  /\  y  e.  U  /\  ( y  .Q  1Q )  <Q  ( x  .Q  B ) )  ->  E. x  e.  L  ( x  .Q  B
)  e.  U ) )
2120ex 115 . . 3  |-  ( (
<. L ,  U >.  e. 
P.  /\  1Q  <Q  B )  ->  ( x  e.  Q.  ->  ( E. y  e.  Q.  (
x  e.  L  /\  y  e.  U  /\  ( y  .Q  1Q )  <Q  ( x  .Q  B ) )  ->  E. x  e.  L  ( x  .Q  B
)  e.  U ) ) )
222, 3, 21rexlimd 2620 . 2  |-  ( (
<. L ,  U >.  e. 
P.  /\  1Q  <Q  B )  ->  ( E. x  e.  Q.  E. y  e.  Q.  ( x  e.  L  /\  y  e.  U  /\  ( y  .Q  1Q )  <Q 
( x  .Q  B
) )  ->  E. x  e.  L  ( x  .Q  B )  e.  U
) )
231, 22mpd 13 1  |-  ( (
<. L ,  U >.  e. 
P.  /\  1Q  <Q  B )  ->  E. x  e.  L  ( x  .Q  B )  e.  U
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 981    = wceq 1373    e. wcel 2176   E.wrex 2485   <.cop 3636   class class class wbr 4044  (class class class)co 5944   Q.cnq 7393   1Qc1q 7394    .Q cmq 7396    <Q cltq 7398   P.cnp 7404
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-eprel 4336  df-id 4340  df-po 4343  df-iso 4344  df-iord 4413  df-on 4415  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-irdg 6456  df-1o 6502  df-2o 6503  df-oadd 6506  df-omul 6507  df-er 6620  df-ec 6622  df-qs 6626  df-ni 7417  df-pli 7418  df-mi 7419  df-lti 7420  df-plpq 7457  df-mpq 7458  df-enq 7460  df-nqqs 7461  df-plqqs 7462  df-mqqs 7463  df-1nqqs 7464  df-rq 7465  df-ltnqqs 7466  df-enq0 7537  df-nq0 7538  df-0nq0 7539  df-plq0 7540  df-mq0 7541  df-inp 7579
This theorem is referenced by:  recexprlem1ssl  7746  recexprlem1ssu  7747
  Copyright terms: Public domain W3C validator