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

Theorem fliftel 5862
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 4045 . . . 4  |-  ( C F D  <->  <. C ,  D >.  e.  F )
2 flift.1 . . . . 5  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
32eleq2i 2272 . . . 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 4272 . . . . . 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 2579 . . . 4  |-  ( ph  ->  A. x  e.  X  <. A ,  B >.  e. 
_V )
10 eqid 2205 . . . . 5  |-  ( x  e.  X  |->  <. A ,  B >. )  =  ( x  e.  X  |->  <. A ,  B >. )
1110elrnmptg 4930 . . . 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 4283 . . . 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 2503 . 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 1373    e. wcel 2176   A.wral 2484   E.wrex 2485   _Vcvv 2772   <.cop 3636   class class class wbr 4044    |-> cmpt 4105   ran crn 4676
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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-mpt 4107  df-cnv 4683  df-dm 4685  df-rn 4686
This theorem is referenced by:  fliftcnv  5864  fliftfun  5865  fliftf  5868  fliftval  5869  qliftel  6702
  Copyright terms: Public domain W3C validator