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

Theorem dmfex 5526
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 5488 . . 3  |-  ( F : A --> B  ->  dom  F  =  A )
2 dmexg 4996 . . . 4  |-  ( F  e.  C  ->  dom  F  e.  _V )
3 eleq1 2294 . . . 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 1397    e. wcel 2202   _Vcvv 2802   dom cdm 4725   -->wf 5322
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-cnv 4733  df-dm 4735  df-rn 4736  df-fn 5329  df-f 5330
This theorem is referenced by:  fopwdom  7021
  Copyright terms: Public domain W3C validator