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

Theorem ovelrn 5669
Description: A member of an operation's range is a value of the operation. (Contributed by NM, 7-Feb-2007.) (Revised by Mario Carneiro, 30-Jan-2014.)
Assertion
Ref Expression
ovelrn  |-  ( F  Fn  ( A  X.  B )  ->  ( C  e.  ran  F  <->  E. x  e.  A  E. y  e.  B  C  =  ( x F y ) ) )
Distinct variable groups:    x, y, A   
x, B, y    x, C, y    x, F, y

Proof of Theorem ovelrn
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 fnrnov 5666 . . 3  |-  ( F  Fn  ( A  X.  B )  ->  ran  F  =  { z  |  E. x  e.  A  E. y  e.  B  z  =  ( x F y ) } )
21eleq2d 2148 . 2  |-  ( F  Fn  ( A  X.  B )  ->  ( C  e.  ran  F  <->  C  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  ( x F y ) } ) )
3 elex 2610 . . . 4  |-  ( C  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  ( x F y ) }  ->  C  e.  _V )
43a1i 9 . . 3  |-  ( F  Fn  ( A  X.  B )  ->  ( C  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  ( x F y ) }  ->  C  e.  _V ) )
5 fnovex 5558 . . . . . 6  |-  ( ( F  Fn  ( A  X.  B )  /\  x  e.  A  /\  y  e.  B )  ->  ( x F y )  e.  _V )
6 eleq1 2141 . . . . . 6  |-  ( C  =  ( x F y )  ->  ( C  e.  _V  <->  ( x F y )  e. 
_V ) )
75, 6syl5ibrcom 155 . . . . 5  |-  ( ( F  Fn  ( A  X.  B )  /\  x  e.  A  /\  y  e.  B )  ->  ( C  =  ( x F y )  ->  C  e.  _V ) )
873expb 1139 . . . 4  |-  ( ( F  Fn  ( A  X.  B )  /\  ( x  e.  A  /\  y  e.  B
) )  ->  ( C  =  ( x F y )  ->  C  e.  _V )
)
98rexlimdvva 2484 . . 3  |-  ( F  Fn  ( A  X.  B )  ->  ( E. x  e.  A  E. y  e.  B  C  =  ( x F y )  ->  C  e.  _V )
)
10 eqeq1 2087 . . . . . 6  |-  ( z  =  C  ->  (
z  =  ( x F y )  <->  C  =  ( x F y ) ) )
11102rexbidv 2391 . . . . 5  |-  ( z  =  C  ->  ( E. x  e.  A  E. y  e.  B  z  =  ( x F y )  <->  E. x  e.  A  E. y  e.  B  C  =  ( x F y ) ) )
1211elabg 2739 . . . 4  |-  ( C  e.  _V  ->  ( C  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  ( x F y ) }  <->  E. x  e.  A  E. y  e.  B  C  =  ( x F y ) ) )
1312a1i 9 . . 3  |-  ( F  Fn  ( A  X.  B )  ->  ( C  e.  _V  ->  ( C  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  ( x F y ) }  <->  E. x  e.  A  E. y  e.  B  C  =  ( x F y ) ) ) )
144, 9, 13pm5.21ndd 653 . 2  |-  ( F  Fn  ( A  X.  B )  ->  ( C  e.  { z  |  E. x  e.  A  E. y  e.  B  z  =  ( x F y ) }  <->  E. x  e.  A  E. y  e.  B  C  =  ( x F y ) ) )
152, 14bitrd 186 1  |-  ( F  Fn  ( A  X.  B )  ->  ( C  e.  ran  F  <->  E. x  e.  A  E. y  e.  B  C  =  ( x F y ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103    /\ w3a 919    = wceq 1284    e. wcel 1433   {cab 2067   E.wrex 2349   _Vcvv 2601    X. cxp 4361   ran crn 4364    Fn wfn 4917  (class class class)co 5532
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-iota 4887  df-fun 4924  df-fn 4925  df-fv 4930  df-ov 5535
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator