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

Theorem genpmu 7319
Description: The upper cut produced by addition or multiplication on positive reals is inhabited. (Contributed by Jim Kingdon, 5-Dec-2019.)
Hypotheses
Ref Expression
genpelvl.1  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y G z ) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y G z ) ) } >. )
genpelvl.2  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
Assertion
Ref Expression
genpmu  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. q  e.  Q.  q  e.  ( 2nd `  ( A F B ) ) )
Distinct variable groups:    x, y, z, w, v, q, A   
x, B, y, z, w, v, q    x, G, y, z, w, v, q    F, q
Allowed substitution hints:    F( x, y, z, w, v)

Proof of Theorem genpmu
Dummy variables  f  g are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7276 . . . 4  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
2 prmu 7279 . . . 4  |-  ( <.
( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  ->  E. f  e.  Q.  f  e.  ( 2nd `  A ) )
3 rexex 2477 . . . 4  |-  ( E. f  e.  Q.  f  e.  ( 2nd `  A
)  ->  E. f 
f  e.  ( 2nd `  A ) )
41, 2, 33syl 17 . . 3  |-  ( A  e.  P.  ->  E. f 
f  e.  ( 2nd `  A ) )
54adantr 274 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. f  f  e.  ( 2nd `  A
) )
6 prop 7276 . . . . 5  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
7 prmu 7279 . . . . 5  |-  ( <.
( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  ->  E. g  e.  Q.  g  e.  ( 2nd `  B ) )
8 rexex 2477 . . . . 5  |-  ( E. g  e.  Q.  g  e.  ( 2nd `  B
)  ->  E. g 
g  e.  ( 2nd `  B ) )
96, 7, 83syl 17 . . . 4  |-  ( B  e.  P.  ->  E. g 
g  e.  ( 2nd `  B ) )
109ad2antlr 480 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  f  e.  ( 2nd `  A ) )  ->  E. g  g  e.  ( 2nd `  B
) )
11 genpelvl.1 . . . . . . 7  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y G z ) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y G z ) ) } >. )
12 genpelvl.2 . . . . . . 7  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
1311, 12genppreclu 7316 . . . . . 6  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( f  e.  ( 2nd `  A
)  /\  g  e.  ( 2nd `  B ) )  ->  ( f G g )  e.  ( 2nd `  ( A F B ) ) ) )
1413imp 123 . . . . 5  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B ) ) )  ->  (
f G g )  e.  ( 2nd `  ( A F B ) ) )
15 elprnqu 7283 . . . . . . . . . 10  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  f  e.  ( 2nd `  A ) )  -> 
f  e.  Q. )
161, 15sylan 281 . . . . . . . . 9  |-  ( ( A  e.  P.  /\  f  e.  ( 2nd `  A ) )  -> 
f  e.  Q. )
17 elprnqu 7283 . . . . . . . . . 10  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  g  e.  ( 2nd `  B ) )  -> 
g  e.  Q. )
186, 17sylan 281 . . . . . . . . 9  |-  ( ( B  e.  P.  /\  g  e.  ( 2nd `  B ) )  -> 
g  e.  Q. )
1916, 18anim12i 336 . . . . . . . 8  |-  ( ( ( A  e.  P.  /\  f  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  g  e.  ( 2nd `  B ) ) )  ->  ( f  e. 
Q.  /\  g  e.  Q. ) )
2019an4s 577 . . . . . . 7  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B ) ) )  ->  (
f  e.  Q.  /\  g  e.  Q. )
)
2112caovcl 5918 . . . . . . 7  |-  ( ( f  e.  Q.  /\  g  e.  Q. )  ->  ( f G g )  e.  Q. )
2220, 21syl 14 . . . . . 6  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B ) ) )  ->  (
f G g )  e.  Q. )
23 simpr 109 . . . . . . 7  |-  ( ( ( ( A  e. 
P.  /\  B  e.  P. )  /\  (
f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B
) ) )  /\  q  =  ( f G g ) )  ->  q  =  ( f G g ) )
2423eleq1d 2206 . . . . . 6  |-  ( ( ( ( A  e. 
P.  /\  B  e.  P. )  /\  (
f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B
) ) )  /\  q  =  ( f G g ) )  ->  ( q  e.  ( 2nd `  ( A F B ) )  <-> 
( f G g )  e.  ( 2nd `  ( A F B ) ) ) )
2522, 24rspcedv 2788 . . . . 5  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B ) ) )  ->  (
( f G g )  e.  ( 2nd `  ( A F B ) )  ->  E. q  e.  Q.  q  e.  ( 2nd `  ( A F B ) ) ) )
2614, 25mpd 13 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B ) ) )  ->  E. q  e.  Q.  q  e.  ( 2nd `  ( A F B ) ) )
2726anassrs 397 . . 3  |-  ( ( ( ( A  e. 
P.  /\  B  e.  P. )  /\  f  e.  ( 2nd `  A
) )  /\  g  e.  ( 2nd `  B
) )  ->  E. q  e.  Q.  q  e.  ( 2nd `  ( A F B ) ) )
2810, 27exlimddv 1870 . 2  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  f  e.  ( 2nd `  A ) )  ->  E. q  e.  Q.  q  e.  ( 2nd `  ( A F B ) ) )
295, 28exlimddv 1870 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. q  e.  Q.  q  e.  ( 2nd `  ( A F B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 962    = wceq 1331   E.wex 1468    e. wcel 1480   E.wrex 2415   {crab 2418   <.cop 3525   ` cfv 5118  (class class class)co 5767    e. cmpo 5769   1stc1st 6029   2ndc2nd 6030   Q.cnq 7081   P.cnp 7092
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-qs 6428  df-ni 7105  df-nqqs 7149  df-inp 7267
This theorem is referenced by:  addclpr  7338  mulclpr  7373
  Copyright terms: Public domain W3C validator