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

Theorem elmapex 6937
Description: Eliminate antecedent for mapping theorems: domain can be taken to be a set. (Contributed by Stefan O'Rear, 8-Oct-2014.)
Assertion
Ref Expression
elmapex  |-  ( A  e.  ( B  ^m  C )  ->  ( B  e.  _V  /\  C  e.  _V ) )

Proof of Theorem elmapex
Dummy variables  x  f  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-map 6918 . 2  |-  ^m  =  ( x  e.  _V ,  y  e.  _V  |->  { f  |  f : y --> x }
)
21elmpocl 6278 1  |-  ( A  e.  ( B  ^m  C )  ->  ( B  e.  _V  /\  C  e.  _V ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2209   {cab 2224   _Vcvv 2821   -->wf 5371  (class class class)co 6079    ^m cmap 6916
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 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 4247  ax-pow 4309  ax-pr 4344
This theorem 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-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-iota 5335  df-fun 5377  df-fv 5383  df-ov 6082  df-oprab 6083  df-mpo 6084  df-map 6918
This theorem is referenced by:  elmapi  6938  elmapssres  6948  mapsspm  6957  mapss  6967
  Copyright terms: Public domain W3C validator