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

Theorem dmfex 5465
Description: If a mapping is a set, its domain is a set. (Contributed by NM, 27-Aug-2006.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)
Assertion
Ref Expression
dmfex  |-  ( ( F  e.  C  /\  F : A --> B )  ->  A  e.  _V )

Proof of Theorem dmfex
StepHypRef Expression
1 fdm 5431 . . 3  |-  ( F : A --> B  ->  dom  F  =  A )
2 dmexg 4942 . . . 4  |-  ( F  e.  C  ->  dom  F  e.  _V )
3 eleq1 2268 . . . 4  |-  ( dom 
F  =  A  -> 
( dom  F  e.  _V 
<->  A  e.  _V )
)
42, 3imbitrid 154 . . 3  |-  ( dom 
F  =  A  -> 
( F  e.  C  ->  A  e.  _V )
)
51, 4syl 14 . 2  |-  ( F : A --> B  -> 
( F  e.  C  ->  A  e.  _V )
)
65impcom 125 1  |-  ( ( F  e.  C  /\  F : A --> B )  ->  A  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373    e. wcel 2176   _Vcvv 2772   dom cdm 4675   -->wf 5267
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-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-rex 2490  df-v 2774  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-br 4045  df-opab 4106  df-cnv 4683  df-dm 4685  df-rn 4686  df-fn 5274  df-f 5275
This theorem is referenced by:  fopwdom  6933
  Copyright terms: Public domain W3C validator