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

Theorem ltdfpr 7654
Description: More convenient form of df-iltp 7618. (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 4060 . . 3  |-  ( A 
<P  B  <->  <. A ,  B >.  e.  <P  )
2 df-iltp 7618 . . . 4  |-  <P  =  { <. x ,  y
>.  |  ( (
x  e.  P.  /\  y  e.  P. )  /\  E. q  e.  Q.  ( q  e.  ( 2nd `  x )  /\  q  e.  ( 1st `  y ) ) ) }
32eleq2i 2274 . . 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 5603 . . . . . 6  |-  ( ( x  =  A  /\  y  =  B )  ->  ( 2nd `  x
)  =  ( 2nd `  A ) )
76eleq2d 2277 . . . . 5  |-  ( ( x  =  A  /\  y  =  B )  ->  ( q  e.  ( 2nd `  x )  <-> 
q  e.  ( 2nd `  A ) ) )
8 simpr 110 . . . . . . 7  |-  ( ( x  =  A  /\  y  =  B )  ->  y  =  B )
98fveq2d 5603 . . . . . 6  |-  ( ( x  =  A  /\  y  =  B )  ->  ( 1st `  y
)  =  ( 1st `  B ) )
109eleq2d 2277 . . . . 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 2509 . . 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 4329 . 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 1373    e. wcel 2178   E.wrex 2487   <.cop 3646   class class class wbr 4059   {copab 4120   ` cfv 5290   1stc1st 6247   2ndc2nd 6248   Q.cnq 7428   P.cnp 7439    <P cltp 7443
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-rex 2492  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-iota 5251  df-fv 5298  df-iltp 7618
This theorem is referenced by:  nqprl  7699  nqpru  7700  ltprordil  7737  ltnqpr  7741  ltnqpri  7742  ltpopr  7743  ltsopr  7744  ltaddpr  7745  ltexprlemm  7748  ltexprlemopu  7751  ltexprlemru  7760  aptiprleml  7787  aptiprlemu  7788  archpr  7791  cauappcvgprlem2  7808  caucvgprlem2  7828  caucvgprprlemopu  7847  caucvgprprlemexbt  7854  caucvgprprlem2  7858  suplocexprlemloc  7869  suplocexprlemub  7871  suplocexprlemlub  7872
  Copyright terms: Public domain W3C validator