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

Theorem elrnmpt1 5028
Description: Elementhood in an image set. (Contributed by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
rnmpt.1  |-  F  =  ( x  e.  A  |->  B )
Assertion
Ref Expression
elrnmpt1  |-  ( ( x  e.  A  /\  B  e.  V )  ->  B  e.  ran  F
)

Proof of Theorem elrnmpt1
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2824 . . . 4  |-  x  e. 
_V
2 id 19 . . . . . . 7  |-  ( x  =  z  ->  x  =  z )
3 csbeq1a 3156 . . . . . . 7  |-  ( x  =  z  ->  A  =  [_ z  /  x ]_ A )
42, 3eleq12d 2309 . . . . . 6  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  [_ z  /  x ]_ A ) )
5 csbeq1a 3156 . . . . . . 7  |-  ( x  =  z  ->  B  =  [_ z  /  x ]_ B )
65biantrud 304 . . . . . 6  |-  ( x  =  z  ->  (
z  e.  [_ z  /  x ]_ A  <->  ( z  e.  [_ z  /  x ]_ A  /\  B  = 
[_ z  /  x ]_ B ) ) )
74, 6bitr2d 189 . . . . 5  |-  ( x  =  z  ->  (
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B )  <-> 
x  e.  A ) )
87equcoms 1760 . . . 4  |-  ( z  =  x  ->  (
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B )  <-> 
x  e.  A ) )
91, 8spcev 2920 . . 3  |-  ( x  e.  A  ->  E. z
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B ) )
10 df-rex 2534 . . . . . 6  |-  ( E. x  e.  A  y  =  B  <->  E. x
( x  e.  A  /\  y  =  B
) )
11 nfv 1581 . . . . . . 7  |-  F/ z ( x  e.  A  /\  y  =  B
)
12 nfcsb1v 3180 . . . . . . . . 9  |-  F/_ x [_ z  /  x ]_ A
1312nfcri 2386 . . . . . . . 8  |-  F/ x  z  e.  [_ z  /  x ]_ A
14 nfcsb1v 3180 . . . . . . . . 9  |-  F/_ x [_ z  /  x ]_ B
1514nfeq2 2404 . . . . . . . 8  |-  F/ x  y  =  [_ z  /  x ]_ B
1613, 15nfan 1618 . . . . . . 7  |-  F/ x
( z  e.  [_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B )
175eqeq2d 2250 . . . . . . . 8  |-  ( x  =  z  ->  (
y  =  B  <->  y  =  [_ z  /  x ]_ B ) )
184, 17anbi12d 477 . . . . . . 7  |-  ( x  =  z  ->  (
( x  e.  A  /\  y  =  B
)  <->  ( z  e. 
[_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B ) ) )
1911, 16, 18cbvex 1809 . . . . . 6  |-  ( E. x ( x  e.  A  /\  y  =  B )  <->  E. z
( z  e.  [_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B ) )
2010, 19bitri 184 . . . . 5  |-  ( E. x  e.  A  y  =  B  <->  E. z
( z  e.  [_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B ) )
21 eqeq1 2245 . . . . . . 7  |-  ( y  =  B  ->  (
y  =  [_ z  /  x ]_ B  <->  B  =  [_ z  /  x ]_ B ) )
2221anbi2d 468 . . . . . 6  |-  ( y  =  B  ->  (
( z  e.  [_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B )  <-> 
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B ) ) )
2322exbidv 1878 . . . . 5  |-  ( y  =  B  ->  ( E. z ( z  e. 
[_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B )  <->  E. z
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B ) ) )
2420, 23bitrid 192 . . . 4  |-  ( y  =  B  ->  ( E. x  e.  A  y  =  B  <->  E. z
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B ) ) )
25 rnmpt.1 . . . . 5  |-  F  =  ( x  e.  A  |->  B )
2625rnmpt 5025 . . . 4  |-  ran  F  =  { y  |  E. x  e.  A  y  =  B }
2724, 26elab2g 2973 . . 3  |-  ( B  e.  V  ->  ( B  e.  ran  F  <->  E. z
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B ) ) )
289, 27imbitrrid 156 . 2  |-  ( B  e.  V  ->  (
x  e.  A  ->  B  e.  ran  F ) )
2928impcom 125 1  |-  ( ( x  e.  A  /\  B  e.  V )  ->  B  e.  ran  F
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   E.wex 1545    e. wcel 2209   E.wrex 2529   [_csb 3147    |-> cmpt 4187   ran crn 4770
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 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 4244  ax-pow 4306  ax-pr 4341
This theorem 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-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-mpt 4189  df-cnv 4777  df-dm 4779  df-rn 4780
This theorem is referenced by:  fliftel1  5990
  Copyright terms: Public domain W3C validator