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

Theorem elrnmpo 6202
Description: Membership in the range of an operation class abstraction. (Contributed by NM, 1-Aug-2004.) (Revised by Mario Carneiro, 31-Aug-2015.)
Hypotheses
Ref Expression
rngop.1  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
elrnmpo.1  |-  C  e. 
_V
Assertion
Ref Expression
elrnmpo  |-  ( D  e.  ran  F  <->  E. x  e.  A  E. y  e.  B  D  =  C )
Distinct variable groups:    y, A    x, y, D
Allowed substitution hints:    A( x)    B( x,  y)    C( x,  y)    F( x,  y)

Proof of Theorem elrnmpo
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 rngop.1 . . . 4  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
21rnmpo 6199 . . 3  |-  ran  F  =  { z  |  E. x  e.  A  E. y  e.  B  z  =  C }
32eleq2i 2305 . 2  |-  ( D  e.  ran  F  <->  D  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  C } )
4 elrnmpo.1 . . . . . 6  |-  C  e. 
_V
5 eleq1 2301 . . . . . 6  |-  ( D  =  C  ->  ( D  e.  _V  <->  C  e.  _V ) )
64, 5mpbiri 168 . . . . 5  |-  ( D  =  C  ->  D  e.  _V )
76rexlimivw 2664 . . . 4  |-  ( E. y  e.  B  D  =  C  ->  D  e. 
_V )
87rexlimivw 2664 . . 3  |-  ( E. x  e.  A  E. y  e.  B  D  =  C  ->  D  e. 
_V )
9 eqeq1 2245 . . . 4  |-  ( z  =  D  ->  (
z  =  C  <->  D  =  C ) )
1092rexbidv 2575 . . 3  |-  ( z  =  D  ->  ( E. x  e.  A  E. y  e.  B  z  =  C  <->  E. x  e.  A  E. y  e.  B  D  =  C ) )
118, 10elab3 2978 . 2  |-  ( D  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  C }  <->  E. x  e.  A  E. y  e.  B  D  =  C )
123, 11bitri 184 1  |-  ( D  e.  ran  F  <->  E. x  e.  A  E. y  e.  B  D  =  C )
Colors of variables:    wff set class
This proof depends on syntax axioms:    <-> wb 105    = wceq 1402    e. wcel 2209   {cab 2224   E.wrex 2529   _Vcvv 2821   ran crn 4775    e. cmpo 6087
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-cnv 4782  df-dm 4784  df-rn 4785  df-oprab 6089  df-mpo 6090
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator