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

Theorem dmfex 5582
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 5539 . . 3  |-  ( F : A --> B  ->  dom  F  =  A )
2 dmexg 5046 . . . 4  |-  ( F  e.  C  ->  dom  F  e.  _V )
3 eleq1 2301 . . . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   dom cdm 4774   -->wf 5373
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-cnv 4782  df-dm 4784  df-rn 4785  df-fn 5380  df-f 5381
This theorem is used by:  mapfset  6945  mapfoss  6947  fopwdom  7136
  Copyright terms: Public domain W3C validator