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

Theorem elrnmpt1 4989
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 2806 . . . 4  |-  x  e. 
_V
2 id 19 . . . . . . 7  |-  ( x  =  z  ->  x  =  z )
3 csbeq1a 3137 . . . . . . 7  |-  ( x  =  z  ->  A  =  [_ z  /  x ]_ A )
42, 3eleq12d 2302 . . . . . 6  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  [_ z  /  x ]_ A ) )
5 csbeq1a 3137 . . . . . . 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 1756 . . . 4  |-  ( z  =  x  ->  (
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B )  <-> 
x  e.  A ) )
91, 8spcev 2902 . . 3  |-  ( x  e.  A  ->  E. z
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B ) )
10 df-rex 2517 . . . . . 6  |-  ( E. x  e.  A  y  =  B  <->  E. x
( x  e.  A  /\  y  =  B
) )
11 nfv 1577 . . . . . . 7  |-  F/ z ( x  e.  A  /\  y  =  B
)
12 nfcsb1v 3161 . . . . . . . . 9  |-  F/_ x [_ z  /  x ]_ A
1312nfcri 2369 . . . . . . . 8  |-  F/ x  z  e.  [_ z  /  x ]_ A
14 nfcsb1v 3161 . . . . . . . . 9  |-  F/_ x [_ z  /  x ]_ B
1514nfeq2 2387 . . . . . . . 8  |-  F/ x  y  =  [_ z  /  x ]_ B
1613, 15nfan 1614 . . . . . . 7  |-  F/ x
( z  e.  [_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B )
175eqeq2d 2243 . . . . . . . 8  |-  ( x  =  z  ->  (
y  =  B  <->  y  =  [_ z  /  x ]_ B ) )
184, 17anbi12d 473 . . . . . . 7  |-  ( x  =  z  ->  (
( x  e.  A  /\  y  =  B
)  <->  ( z  e. 
[_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B ) ) )
1911, 16, 18cbvex 1804 . . . . . 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 2238 . . . . . . 7  |-  ( y  =  B  ->  (
y  =  [_ z  /  x ]_ B  <->  B  =  [_ z  /  x ]_ B ) )
2221anbi2d 464 . . . . . 6  |-  ( y  =  B  ->  (
( z  e.  [_ z  /  x ]_ A  /\  y  =  [_ z  /  x ]_ B )  <-> 
( z  e.  [_ z  /  x ]_ A  /\  B  =  [_ z  /  x ]_ B ) ) )
2322exbidv 1873 . . . . 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 4986 . . . 4  |-  ran  F  =  { y  |  E. x  e.  A  y  =  B }
2724, 26elab2g 2954 . . 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 1398   E.wex 1541    e. wcel 2202   E.wrex 2512   [_csb 3128    |-> cmpt 4155   ran crn 4732
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-mpt 4157  df-cnv 4739  df-dm 4741  df-rn 4742
This theorem is referenced by:  fliftel1  5945
  Copyright terms: Public domain W3C validator