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

Theorem prmuloc2 7634
Description: Positive reals are multiplicatively located. This is a variation of prmuloc 7633 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 7633 . 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 1542 . . 3  |-  F/ x
( <. L ,  U >.  e.  P.  /\  1Q  <Q  B )
3 nfre1 2540 . . 3  |-  F/ x E. x  e.  L  ( x  .Q  B
)  e.  U
4 simpr1 1005 . . . . . . . 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 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  .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 7456 . . . . . . . . . . 11  |-  ( y  e.  Q.  ->  (
y  .Q  1Q )  =  y )
8 breq1 4036 . . . . . . . . . . 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 1006 . . . . . . . . . 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 7552 . . . . . . . . . 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 2546 . . . . . . . 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 2614 . . . 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 2611 . 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 980    = wceq 1364    e. wcel 2167   E.wrex 2476   <.cop 3625   class class class wbr 4033  (class class class)co 5922   Q.cnq 7347   1Qc1q 7348    .Q cmq 7350    <Q cltq 7352   P.cnp 7358
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-eprel 4324  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-irdg 6428  df-1o 6474  df-2o 6475  df-oadd 6478  df-omul 6479  df-er 6592  df-ec 6594  df-qs 6598  df-ni 7371  df-pli 7372  df-mi 7373  df-lti 7374  df-plpq 7411  df-mpq 7412  df-enq 7414  df-nqqs 7415  df-plqqs 7416  df-mqqs 7417  df-1nqqs 7418  df-rq 7419  df-ltnqqs 7420  df-enq0 7491  df-nq0 7492  df-0nq0 7493  df-plq0 7494  df-mq0 7495  df-inp 7533
This theorem is referenced by:  recexprlem1ssl  7700  recexprlem1ssu  7701
  Copyright terms: Public domain W3C validator