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

Theorem fliftel 5972
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 4115 . . . 4  |-  ( C F D  <->  <. C ,  D >.  e.  F )
2 flift.1 . . . . 5  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
32eleq2i 2301 . . . 4  |-  ( <. C ,  D >.  e.  F  <->  <. C ,  D >.  e.  ran  ( x  e.  X  |->  <. A ,  B >. ) )
41, 3bitri 184 . . 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 4349 . . . . . 6  |-  ( ( A  e.  R  /\  B  e.  S )  -> 
<. A ,  B >.  e. 
_V )
85, 6, 7syl2anc 411 . . . . 5  |-  ( (
ph  /\  x  e.  X )  ->  <. A ,  B >.  e.  _V )
98ralrimiva 2617 . . . 4  |-  ( ph  ->  A. x  e.  X  <. A ,  B >.  e. 
_V )
10 eqid 2234 . . . . 5  |-  ( x  e.  X  |->  <. A ,  B >. )  =  ( x  e.  X  |->  <. A ,  B >. )
1110elrnmptg 5014 . . . 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, 12bitrid 192 . 2  |-  ( ph  ->  ( C F D  <->  E. x  e.  X  <. C ,  D >.  = 
<. A ,  B >. ) )
14 opthg2 4360 . . . 4  |-  ( ( A  e.  R  /\  B  e.  S )  ->  ( <. C ,  D >.  =  <. A ,  B >.  <-> 
( C  =  A  /\  D  =  B ) ) )
155, 6, 14syl2anc 411 . . 3  |-  ( (
ph  /\  x  e.  X )  ->  ( <. C ,  D >.  = 
<. A ,  B >.  <->  ( C  =  A  /\  D  =  B )
) )
1615rexbidva 2541 . 2  |-  ( ph  ->  ( E. x  e.  X  <. C ,  D >.  =  <. A ,  B >.  <->  E. x  e.  X  ( C  =  A  /\  D  =  B
) ) )
1713, 16bitrd 188 1  |-  ( ph  ->  ( C F D  <->  E. x  e.  X  ( C  =  A  /\  D  =  B
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   A.wral 2522   E.wrex 2523   _Vcvv 2815   <.cop 3697   class class class wbr 4114    |-> cmpt 4176   ran crn 4755
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 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-mpt 4178  df-cnv 4762  df-dm 4764  df-rn 4765
This theorem is referenced by:  fliftcnv  5974  fliftfun  5975  fliftf  5978  fliftval  5979  qliftel  6862
  Copyright terms: Public domain W3C validator