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

Theorem ltdfpr 7786
Description: More convenient form of df-iltp 7750. (Contributed by Jim Kingdon, 15-Dec-2019.)
Assertion
Ref Expression
ltdfpr  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  <P  B  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  A
)  /\  q  e.  ( 1st `  B ) ) ) )
Distinct variable groups:    A, q    B, q

Proof of Theorem ltdfpr
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 4094 . . 3  |-  ( A 
<P  B  <->  <. A ,  B >.  e.  <P  )
2 df-iltp 7750 . . . 4  |-  <P  =  { <. x ,  y
>.  |  ( (
x  e.  P.  /\  y  e.  P. )  /\  E. q  e.  Q.  ( q  e.  ( 2nd `  x )  /\  q  e.  ( 1st `  y ) ) ) }
32eleq2i 2298 . . 3  |-  ( <. A ,  B >.  e. 
<P 
<-> 
<. A ,  B >.  e. 
{ <. x ,  y
>.  |  ( (
x  e.  P.  /\  y  e.  P. )  /\  E. q  e.  Q.  ( q  e.  ( 2nd `  x )  /\  q  e.  ( 1st `  y ) ) ) } )
41, 3bitri 184 . 2  |-  ( A 
<P  B  <->  <. A ,  B >.  e.  { <. x ,  y >.  |  ( ( x  e.  P.  /\  y  e.  P. )  /\  E. q  e.  Q.  ( q  e.  ( 2nd `  x )  /\  q  e.  ( 1st `  y ) ) ) } )
5 simpl 109 . . . . . . 7  |-  ( ( x  =  A  /\  y  =  B )  ->  x  =  A )
65fveq2d 5652 . . . . . 6  |-  ( ( x  =  A  /\  y  =  B )  ->  ( 2nd `  x
)  =  ( 2nd `  A ) )
76eleq2d 2301 . . . . 5  |-  ( ( x  =  A  /\  y  =  B )  ->  ( q  e.  ( 2nd `  x )  <-> 
q  e.  ( 2nd `  A ) ) )
8 simpr 110 . . . . . . 7  |-  ( ( x  =  A  /\  y  =  B )  ->  y  =  B )
98fveq2d 5652 . . . . . 6  |-  ( ( x  =  A  /\  y  =  B )  ->  ( 1st `  y
)  =  ( 1st `  B ) )
109eleq2d 2301 . . . . 5  |-  ( ( x  =  A  /\  y  =  B )  ->  ( q  e.  ( 1st `  y )  <-> 
q  e.  ( 1st `  B ) ) )
117, 10anbi12d 473 . . . 4  |-  ( ( x  =  A  /\  y  =  B )  ->  ( ( q  e.  ( 2nd `  x
)  /\  q  e.  ( 1st `  y ) )  <->  ( q  e.  ( 2nd `  A
)  /\  q  e.  ( 1st `  B ) ) ) )
1211rexbidv 2534 . . 3  |-  ( ( x  =  A  /\  y  =  B )  ->  ( E. q  e. 
Q.  ( q  e.  ( 2nd `  x
)  /\  q  e.  ( 1st `  y ) )  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  A )  /\  q  e.  ( 1st `  B ) ) ) )
1312opelopab2a 4365 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( <. A ,  B >.  e.  { <. x ,  y >.  |  ( ( x  e.  P.  /\  y  e.  P. )  /\  E. q  e.  Q.  ( q  e.  ( 2nd `  x )  /\  q  e.  ( 1st `  y ) ) ) }  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  A
)  /\  q  e.  ( 1st `  B ) ) ) )
144, 13bitrid 192 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  <P  B  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  A
)  /\  q  e.  ( 1st `  B ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   E.wrex 2512   <.cop 3676   class class class wbr 4093   {copab 4154   ` cfv 5333   1stc1st 6310   2ndc2nd 6311   Q.cnq 7560   P.cnp 7571    <P cltp 7575
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-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-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-iota 5293  df-fv 5341  df-iltp 7750
This theorem is referenced by:  nqprl  7831  nqpru  7832  ltprordil  7869  ltnqpr  7873  ltnqpri  7874  ltpopr  7875  ltsopr  7876  ltaddpr  7877  ltexprlemm  7880  ltexprlemopu  7883  ltexprlemru  7892  aptiprleml  7919  aptiprlemu  7920  archpr  7923  cauappcvgprlem2  7940  caucvgprlem2  7960  caucvgprprlemopu  7979  caucvgprprlemexbt  7986  caucvgprprlem2  7990  suplocexprlemloc  8001  suplocexprlemub  8003  suplocexprlemlub  8004
  Copyright terms: Public domain W3C validator