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

Theorem fliftel 5761
Description: Elementhood in the relation  F. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
flift.1  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
flift.2  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
flift.3  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
Assertion
Ref Expression
fliftel  |-  ( ph  ->  ( C F D  <->  E. x  e.  X  ( C  =  A  /\  D  =  B
) ) )
Distinct variable groups:    x, C    x, R    x, D    ph, x    x, X    x, S
Allowed substitution hints:    A( x)    B( x)    F( x)

Proof of Theorem fliftel
StepHypRef Expression
1 df-br 3983 . . . 4  |-  ( C F D  <->  <. C ,  D >.  e.  F )
2 flift.1 . . . . 5  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
32eleq2i 2233 . . . 4  |-  ( <. C ,  D >.  e.  F  <->  <. C ,  D >.  e.  ran  ( x  e.  X  |->  <. A ,  B >. ) )
41, 3bitri 183 . . 3  |-  ( C F D  <->  <. C ,  D >.  e.  ran  (
x  e.  X  |->  <. A ,  B >. ) )
5 flift.2 . . . . . 6  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
6 flift.3 . . . . . 6  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
7 opexg 4206 . . . . . 6  |-  ( ( A  e.  R  /\  B  e.  S )  -> 
<. A ,  B >.  e. 
_V )
85, 6, 7syl2anc 409 . . . . 5  |-  ( (
ph  /\  x  e.  X )  ->  <. A ,  B >.  e.  _V )
98ralrimiva 2539 . . . 4  |-  ( ph  ->  A. x  e.  X  <. A ,  B >.  e. 
_V )
10 eqid 2165 . . . . 5  |-  ( x  e.  X  |->  <. A ,  B >. )  =  ( x  e.  X  |->  <. A ,  B >. )
1110elrnmptg 4856 . . . 4  |-  ( A. x  e.  X  <. A ,  B >.  e.  _V  ->  ( <. C ,  D >.  e.  ran  ( x  e.  X  |->  <. A ,  B >. )  <->  E. x  e.  X  <. C ,  D >.  =  <. A ,  B >. ) )
129, 11syl 14 . . 3  |-  ( ph  ->  ( <. C ,  D >.  e.  ran  ( x  e.  X  |->  <. A ,  B >. )  <->  E. x  e.  X  <. C ,  D >.  =  <. A ,  B >. ) )
134, 12syl5bb 191 . 2  |-  ( ph  ->  ( C F D  <->  E. x  e.  X  <. C ,  D >.  = 
<. A ,  B >. ) )
14 opthg2 4217 . . . 4  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( <. C ,  D >.  =  <. A ,  B >.  <-> 
( C  =  A  /\  D  =  B ) ) )
155, 6, 14syl2anc 409 . . 3  |-  ( (
ph  /\  x  e.  X )  ->  ( <. C ,  D >.  = 
<. A ,  B >.  <->  ( C  =  A  /\  D  =  B )
) )
1615rexbidva 2463 . 2  |-  ( ph  ->  ( E. x  e.  X  <. C ,  D >.  =  <. A ,  B >.  <->  E. x  e.  X  ( C  =  A  /\  D  =  B
) ) )
1713, 16bitrd 187 1  |-  ( ph  ->  ( C F D  <->  E. x  e.  X  ( C  =  A  /\  D  =  B
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   A.wral 2444   E.wrex 2445   _Vcvv 2726   <.cop 3579   class class class wbr 3982    |-> cmpt 4043   ran crn 4605
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-mpt 4045  df-cnv 4612  df-dm 4614  df-rn 4615
This theorem is referenced by:  fliftcnv  5763  fliftfun  5764  fliftf  5767  fliftval  5768  qliftel  6581
  Copyright terms: Public domain W3C validator