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

Theorem abrexexg 6203
Description: Existence of a class abstraction of existentially restricted sets.  x is normally a free-variable parameter in  B. The antecedent assures us that  A is a set. (Contributed by NM, 3-Nov-2003.)
Assertion
Ref Expression
abrexexg  |-  ( A  e.  V  ->  { y  |  E. x  e.  A  y  =  B }  e.  _V )
Distinct variable groups:    x, y, A   
y, B
Allowed substitution hints:    B( x)    V( x, y)

Proof of Theorem abrexexg
StepHypRef Expression
1 eqid 2205 . . 3  |-  ( x  e.  A  |->  B )  =  ( x  e.  A  |->  B )
21rnmpt 4926 . 2  |-  ran  (
x  e.  A  |->  B )  =  { y  |  E. x  e.  A  y  =  B }
3 mptexg 5809 . . 3  |-  ( A  e.  V  ->  (
x  e.  A  |->  B )  e.  _V )
4 rnexg 4943 . . 3  |-  ( ( x  e.  A  |->  B )  e.  _V  ->  ran  ( x  e.  A  |->  B )  e.  _V )
53, 4syl 14 . 2  |-  ( A  e.  V  ->  ran  ( x  e.  A  |->  B )  e.  _V )
62, 5eqeltrrid 2293 1  |-  ( A  e.  V  ->  { y  |  E. x  e.  A  y  =  B }  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1373    e. wcel 2176   {cab 2191   E.wrex 2485   _Vcvv 2772    |-> cmpt 4105   ran crn 4676
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279
This theorem is referenced by:  iunexg  6204  qsexg  6678  shftfvalg  11129  plyval  15204
  Copyright terms: Public domain W3C validator