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

Theorem recexprlempr 7622
Description:  B is a positive real. Lemma for recexpr 7628. (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 7614 . . 3  |-  ( A  e.  P.  ->  ( E. q  e.  Q.  q  e.  ( 1st `  B )  /\  E. r  e.  Q.  r  e.  ( 2nd `  B
) ) )
3 ltrelnq 7355 . . . . . . . . . . 11  |-  <Q  C_  ( Q.  X.  Q. )
43brel 4675 . . . . . . . . . 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 1598 . . . . . . 7  |-  ( E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  x  e.  Q. )
87abssi 3230 . . . . . 6  |-  { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) }  C_  Q.
9 nqex 7353 . . . . . . 7  |-  Q.  e.  _V
109elpw2 4154 . . . . . 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 4675 . . . . . . . . . 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 1598 . . . . . . 7  |-  ( E. y ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  x  e.  Q. )
1615abssi 3230 . . . . . 6  |-  { x  |  E. y ( y 
<Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) ) }  C_  Q.
179elpw2 4154 . . . . . 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 4655 . . . . 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 2250 . . 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 7619 . . 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 7620 . . 3  |-  ( A  e.  P.  ->  A. q  e.  Q.  -.  ( q  e.  ( 1st `  B
)  /\  q  e.  ( 2nd `  B ) ) )
251recexprlemloc 7621 . . 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 1177 . 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 7466 . 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 708    /\ w3a 978    = wceq 1353   E.wex 1492    e. wcel 2148   {cab 2163   A.wral 2455   E.wrex 2456    C_ wss 3129   ~Pcpw 3574   <.cop 3594   class class class wbr 4000    X. cxp 4621   ` cfv 5212   1stc1st 6133   2ndc2nd 6134   Q.cnq 7270   *Qcrq 7274    <Q cltq 7275   P.cnp 7281
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-eprel 4286  df-id 4290  df-po 4293  df-iso 4294  df-iord 4363  df-on 4365  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-irdg 6365  df-1o 6411  df-oadd 6415  df-omul 6416  df-er 6529  df-ec 6531  df-qs 6535  df-ni 7294  df-pli 7295  df-mi 7296  df-lti 7297  df-plpq 7334  df-mpq 7335  df-enq 7337  df-nqqs 7338  df-plqqs 7339  df-mqqs 7340  df-1nqqs 7341  df-rq 7342  df-ltnqqs 7343  df-inp 7456
This theorem is referenced by:  recexprlem1ssl  7623  recexprlem1ssu  7624  recexprlemss1l  7625  recexprlemss1u  7626  recexprlemex  7627  recexpr  7628
  Copyright terms: Public domain W3C validator