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

Theorem elmapex 6881
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 6862 . 2  |-  ^m  =  ( x  e.  _V ,  y  e.  _V  |->  { f  |  f : y --> x }
)
21elmpocl 6227 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 2202   {cab 2217   _Vcvv 2803   -->wf 5329  (class class class)co 6028    ^m cmap 6860
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-map 6862
This theorem is referenced by:  elmapi  6882  elmapssres  6885  mapsspm  6894  mapss  6903
  Copyright terms: Public domain W3C validator