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

Theorem fex2 5084
Description: A function with bounded domain and range is a set. This version is proven without the Axiom of Replacement. (Contributed by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
fex2  |-  ( ( F : A --> B  /\  A  e.  V  /\  B  e.  W )  ->  F  e.  _V )

Proof of Theorem fex2
StepHypRef Expression
1 xpexg 4474 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A  X.  B
)  e.  _V )
213adant1 957 . 2  |-  ( ( F : A --> B  /\  A  e.  V  /\  B  e.  W )  ->  ( A  X.  B
)  e.  _V )
3 fssxp 5083 . . 3  |-  ( F : A --> B  ->  F  C_  ( A  X.  B ) )
433ad2ant1 960 . 2  |-  ( ( F : A --> B  /\  A  e.  V  /\  B  e.  W )  ->  F  C_  ( A  X.  B ) )
52, 4ssexd 3920 1  |-  ( ( F : A --> B  /\  A  e.  V  /\  B  e.  W )  ->  F  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 920    e. wcel 1434   _Vcvv 2602    C_ wss 2974    X. cxp 4363   -->wf 4922
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 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3898  ax-pow 3950  ax-pr 3966  ax-un 4190
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ral 2354  df-rex 2355  df-v 2604  df-un 2978  df-in 2980  df-ss 2987  df-pw 3386  df-sn 3406  df-pr 3407  df-op 3409  df-uni 3604  df-br 3788  df-opab 3842  df-xp 4371  df-rel 4372  df-cnv 4373  df-dm 4375  df-rn 4376  df-fun 4928  df-fn 4929  df-f 4930
This theorem is referenced by:  f1oen2g  6294  f1dom2g  6295  dom3d  6313  climrecvg1n  10312
  Copyright terms: Public domain W3C validator