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

Theorem recexprlempr 7716
Description:  B is a positive real. Lemma for recexpr 7722. (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 7708 . . 3  |-  ( A  e.  P.  ->  ( E. q  e.  Q.  q  e.  ( 1st `  B )  /\  E. r  e.  Q.  r  e.  ( 2nd `  B
) ) )
3 ltrelnq 7449 . . . . . . . . . . 11  |-  <Q  C_  ( Q.  X.  Q. )
43brel 4716 . . . . . . . . . 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 1612 . . . . . . 7  |-  ( E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  x  e.  Q. )
87abssi 3259 . . . . . 6  |-  { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) }  C_  Q.
9 nqex 7447 . . . . . . 7  |-  Q.  e.  _V
109elpw2 4191 . . . . . 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 4716 . . . . . . . . . 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 1612 . . . . . . 7  |-  ( E. y ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  x  e.  Q. )
1615abssi 3259 . . . . . 6  |-  { x  |  E. y ( y 
<Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) ) }  C_  Q.
179elpw2 4191 . . . . . 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 4696 . . . . 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 2269 . . 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 7713 . . 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 7714 . . 3  |-  ( A  e.  P.  ->  A. q  e.  Q.  -.  ( q  e.  ( 1st `  B
)  /\  q  e.  ( 2nd `  B ) ) )
251recexprlemloc 7715 . . 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 7560 . 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 1506    e. wcel 2167   {cab 2182   A.wral 2475   E.wrex 2476    C_ wss 3157   ~Pcpw 3606   <.cop 3626   class class class wbr 4034    X. cxp 4662   ` cfv 5259   1stc1st 6205   2ndc2nd 6206   Q.cnq 7364   *Qcrq 7368    <Q cltq 7369   P.cnp 7375
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 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625
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 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-eprel 4325  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-irdg 6437  df-1o 6483  df-oadd 6487  df-omul 6488  df-er 6601  df-ec 6603  df-qs 6607  df-ni 7388  df-pli 7389  df-mi 7390  df-lti 7391  df-plpq 7428  df-mpq 7429  df-enq 7431  df-nqqs 7432  df-plqqs 7433  df-mqqs 7434  df-1nqqs 7435  df-rq 7436  df-ltnqqs 7437  df-inp 7550
This theorem is referenced by:  recexprlem1ssl  7717  recexprlem1ssu  7718  recexprlemss1l  7719  recexprlemss1u  7720  recexprlemex  7721  recexpr  7722
  Copyright terms: Public domain W3C validator