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

Theorem recexprlempr 7692
Description:  B is a positive real. Lemma for recexpr 7698. (Contributed by Jim Kingdon, 27-Dec-2019.)
Hypothesis
Ref Expression
recexpr.1  |-  B  = 
<. { x  |  E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) ) } ,  {
x  |  E. y
( y  <Q  x  /\  ( *Q `  y
)  e.  ( 1st `  A ) ) }
>.
Assertion
Ref Expression
recexprlempr  |-  ( A  e.  P.  ->  B  e.  P. )
Distinct variable groups:    x, y, A   
x, B, y

Proof of Theorem recexprlempr
Dummy variables  r  q are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 recexpr.1 . . . 4  |-  B  = 
<. { x  |  E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) ) } ,  {
x  |  E. y
( y  <Q  x  /\  ( *Q `  y
)  e.  ( 1st `  A ) ) }
>.
21recexprlemm 7684 . . 3  |-  ( A  e.  P.  ->  ( E. q  e.  Q.  q  e.  ( 1st `  B )  /\  E. r  e.  Q.  r  e.  ( 2nd `  B
) ) )
3 ltrelnq 7425 . . . . . . . . . . 11  |-  <Q  C_  ( Q.  X.  Q. )
43brel 4711 . . . . . . . . . 10  |-  ( x 
<Q  y  ->  ( x  e.  Q.  /\  y  e.  Q. ) )
54simpld 112 . . . . . . . . 9  |-  ( x 
<Q  y  ->  x  e. 
Q. )
65adantr 276 . . . . . . . 8  |-  ( ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) )  ->  x  e.  Q. )
76exlimiv 1609 . . . . . . 7  |-  ( E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  x  e.  Q. )
87abssi 3254 . . . . . 6  |-  { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) }  C_  Q.
9 nqex 7423 . . . . . . 7  |-  Q.  e.  _V
109elpw2 4186 . . . . . 6  |-  ( { x  |  E. y
( x  <Q  y  /\  ( *Q `  y
)  e.  ( 2nd `  A ) ) }  e.  ~P Q.  <->  { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) }  C_  Q. )
118, 10mpbir 146 . . . . 5  |-  { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) }  e.  ~P Q.
123brel 4711 . . . . . . . . . 10  |-  ( y 
<Q  x  ->  ( y  e.  Q.  /\  x  e.  Q. ) )
1312simprd 114 . . . . . . . . 9  |-  ( y 
<Q  x  ->  x  e. 
Q. )
1413adantr 276 . . . . . . . 8  |-  ( ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) )  ->  x  e.  Q. )
1514exlimiv 1609 . . . . . . 7  |-  ( E. y ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  x  e.  Q. )
1615abssi 3254 . . . . . 6  |-  { x  |  E. y ( y 
<Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) ) }  C_  Q.
179elpw2 4186 . . . . . 6  |-  ( { x  |  E. y
( y  <Q  x  /\  ( *Q `  y
)  e.  ( 1st `  A ) ) }  e.  ~P Q.  <->  { x  |  E. y ( y 
<Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) ) }  C_  Q. )
1816, 17mpbir 146 . . . . 5  |-  { x  |  E. y ( y 
<Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) ) }  e.  ~P Q.
19 opelxpi 4691 . . . . 5  |-  ( ( { x  |  E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) ) }  e.  ~P Q.  /\  { x  |  E. y ( y 
<Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) ) }  e.  ~P Q. )  ->  <. { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) } ,  { x  |  E. y ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A ) ) } >.  e.  ( ~P Q.  X.  ~P Q. ) )
2011, 18, 19mp2an 426 . . . 4  |-  <. { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) } ,  { x  |  E. y ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A ) ) } >.  e.  ( ~P Q.  X.  ~P Q. )
211, 20eqeltri 2266 . . 3  |-  B  e.  ( ~P Q.  X.  ~P Q. )
222, 21jctil 312 . 2  |-  ( A  e.  P.  ->  ( B  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e. 
Q.  q  e.  ( 1st `  B )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  B ) ) ) )
231recexprlemrnd 7689 . . 3  |-  ( A  e.  P.  ->  ( A. q  e.  Q.  ( q  e.  ( 1st `  B )  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  B ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  B
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  B ) ) ) ) )
241recexprlemdisj 7690 . . 3  |-  ( A  e.  P.  ->  A. q  e.  Q.  -.  ( q  e.  ( 1st `  B
)  /\  q  e.  ( 2nd `  B ) ) )
251recexprlemloc 7691 . . 3  |-  ( A  e.  P.  ->  A. q  e.  Q.  A. r  e. 
Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  B
)  \/  r  e.  ( 2nd `  B
) ) ) )
2623, 24, 253jca 1179 . 2  |-  ( A  e.  P.  ->  (
( A. q  e. 
Q.  ( q  e.  ( 1st `  B
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  B ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  B
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  B ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  B )  /\  q  e.  ( 2nd `  B
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  B
)  \/  r  e.  ( 2nd `  B
) ) ) ) )
27 elnp1st2nd 7536 . 2  |-  ( B  e.  P.  <->  ( ( B  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e. 
Q.  q  e.  ( 1st `  B )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  B ) ) )  /\  (
( A. q  e. 
Q.  ( q  e.  ( 1st `  B
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  B ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  B
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  B ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  B )  /\  q  e.  ( 2nd `  B
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  B
)  \/  r  e.  ( 2nd `  B
) ) ) ) ) )
2822, 26, 27sylanbrc 417 1  |-  ( A  e.  P.  ->  B  e.  P. )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 709    /\ w3a 980    = wceq 1364   E.wex 1503    e. wcel 2164   {cab 2179   A.wral 2472   E.wrex 2473    C_ wss 3153   ~Pcpw 3601   <.cop 3621   class class class wbr 4029    X. cxp 4657   ` cfv 5254   1stc1st 6191   2ndc2nd 6192   Q.cnq 7340   *Qcrq 7344    <Q cltq 7345   P.cnp 7351
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620
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 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-eprel 4320  df-id 4324  df-po 4327  df-iso 4328  df-iord 4397  df-on 4399  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-irdg 6423  df-1o 6469  df-oadd 6473  df-omul 6474  df-er 6587  df-ec 6589  df-qs 6593  df-ni 7364  df-pli 7365  df-mi 7366  df-lti 7367  df-plpq 7404  df-mpq 7405  df-enq 7407  df-nqqs 7408  df-plqqs 7409  df-mqqs 7410  df-1nqqs 7411  df-rq 7412  df-ltnqqs 7413  df-inp 7526
This theorem is referenced by:  recexprlem1ssl  7693  recexprlem1ssu  7694  recexprlemss1l  7695  recexprlemss1u  7696  recexprlemex  7697  recexpr  7698
  Copyright terms: Public domain W3C validator