MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elrnmpt2 Unicode version

Theorem elrnmpt2 6115
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 )
elrnmpt2.1  |-  C  e. 
_V
Assertion
Ref Expression
elrnmpt2  |-  ( 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 elrnmpt2
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 rngop.1 . . . 4  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
21rnmpt2 6112 . . 3  |-  ran  F  =  { z  |  E. x  e.  A  E. y  e.  B  z  =  C }
32eleq2i 2444 . 2  |-  ( D  e.  ran  F  <->  D  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  C } )
4 elrnmpt2.1 . . . . . 6  |-  C  e. 
_V
5 eleq1 2440 . . . . . 6  |-  ( D  =  C  ->  ( D  e.  _V  <->  C  e.  _V ) )
64, 5mpbiri 225 . . . . 5  |-  ( D  =  C  ->  D  e.  _V )
76rexlimivw 2762 . . . 4  |-  ( E. y  e.  B  D  =  C  ->  D  e. 
_V )
87rexlimivw 2762 . . 3  |-  ( E. x  e.  A  E. y  e.  B  D  =  C  ->  D  e. 
_V )
9 eqeq1 2386 . . . 4  |-  ( z  =  D  ->  (
z  =  C  <->  D  =  C ) )
1092rexbidv 2685 . . 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 3025 . 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 241 1  |-  ( D  e.  ran  F  <->  E. x  e.  A  E. y  e.  B  D  =  C )
Colors of variables: wff set class
Syntax hints:    <-> wb 177    = wceq 1649    e. wcel 1717   {cab 2366   E.wrex 2643   _Vcvv 2892   ran crn 4812    e. cmpt2 6015
This theorem is referenced by:  qexALT  10514  lsmelvalx  15194  efgtlen  15278  frgpnabllem1  15404  fmucndlem  18235  mbfimaopnlem  19407  tpr2rico  24107  mbfmco2  24402  br2base  24406  dya2icobrsiga  24413  dya2iocnrect  24418  dya2iocucvr  24421  sxbrsigalem2  24423  cntotbnd  26189  eldiophb  26499
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361  ax-sep 4264  ax-nul 4272  ax-pr 4337
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2235  df-mo 2236  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-ne 2545  df-ral 2647  df-rex 2648  df-rab 2651  df-v 2894  df-dif 3259  df-un 3261  df-in 3263  df-ss 3270  df-nul 3565  df-if 3676  df-sn 3756  df-pr 3757  df-op 3759  df-br 4147  df-opab 4201  df-cnv 4819  df-dm 4821  df-rn 4822  df-oprab 6017  df-mpt2 6018
  Copyright terms: Public domain W3C validator