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

Theorem genpmu 7835
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 7792 . . . 4  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
2 prmu 7795 . . . 4  |-  ( <.
( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  ->  E. f  e.  Q.  f  e.  ( 2nd `  A ) )
3 rexex 2590 . . . 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 276 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  E. f  f  e.  ( 2nd `  A
) )
6 prop 7792 . . . . 5  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
7 prmu 7795 . . . . 5  |-  ( <.
( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  ->  E. g  e.  Q.  g  e.  ( 2nd `  B ) )
8 rexex 2590 . . . . 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 489 . . 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 7832 . . . . . 6  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( f  e.  ( 2nd `  A
)  /\  g  e.  ( 2nd `  B ) )  ->  ( f G g )  e.  ( 2nd `  ( A F B ) ) ) )
1413imp 124 . . . . 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 7799 . . . . . . . . . 10  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  f  e.  ( 2nd `  A ) )  -> 
f  e.  Q. )
161, 15sylan 283 . . . . . . . . 9  |-  ( ( A  e.  P.  /\  f  e.  ( 2nd `  A ) )  -> 
f  e.  Q. )
17 elprnqu 7799 . . . . . . . . . 10  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  g  e.  ( 2nd `  B ) )  -> 
g  e.  Q. )
186, 17sylan 283 . . . . . . . . 9  |-  ( ( B  e.  P.  /\  g  e.  ( 2nd `  B ) )  -> 
g  e.  Q. )
1916, 18anim12i 338 . . . . . . . 8  |-  ( ( ( A  e.  P.  /\  f  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  g  e.  ( 2nd `  B ) ) )  ->  ( f  e. 
Q.  /\  g  e.  Q. ) )
2019an4s 592 . . . . . . 7  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B ) ) )  ->  (
f  e.  Q.  /\  g  e.  Q. )
)
2112caovcl 6211 . . . . . . 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 110 . . . . . . 7  |-  ( ( ( ( A  e. 
P.  /\  B  e.  P. )  /\  (
f  e.  ( 2nd `  A )  /\  g  e.  ( 2nd `  B
) ) )  /\  q  =  ( f G g ) )  ->  q  =  ( f G g ) )
2423eleq1d 2303 . . . . . 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 2927 . . . . 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 400 . . 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 1950 . 2  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  f  e.  ( 2nd `  A ) )  ->  E. q  e.  Q.  q  e.  ( 2nd `  ( A F B ) ) )
295, 28exlimddv 1950 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 104    /\ w3a 1005    = wceq 1398   E.wex 1541    e. wcel 2205   E.wrex 2523   {crab 2526   <.cop 3694   ` cfv 5354  (class class class)co 6052    e. cmpo 6054   1stc1st 6334   2ndc2nd 6335   Q.cnq 7597   P.cnp 7608
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-qs 6775  df-ni 7621  df-nqqs 7665  df-inp 7783
This theorem is referenced by:  addclpr  7854  mulclpr  7889
  Copyright terms: Public domain W3C validator