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

Theorem dmfex 5515
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 5479 . . 3  |-  ( F : A --> B  ->  dom  F  =  A )
2 dmexg 4988 . . . 4  |-  ( F  e.  C  ->  dom  F  e.  _V )
3 eleq1 2292 . . . 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 1395    e. wcel 2200   _Vcvv 2799   dom cdm 4719   -->wf 5314
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-cnv 4727  df-dm 4729  df-rn 4730  df-fn 5321  df-f 5322
This theorem is referenced by:  fopwdom  6997
  Copyright terms: Public domain W3C validator