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

Theorem elmapex 6556
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 6537 . 2  |-  ^m  =  ( x  e.  _V ,  y  e.  _V  |->  { f  |  f : y --> x }
)
21elmpocl 5961 1  |-  ( A  e.  ( B  ^m  C )  ->  ( B  e.  _V  /\  C  e.  _V ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    e. wcel 1480   {cab 2123   _Vcvv 2681   -->wf 5114  (class class class)co 5767    ^m cmap 6535
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-iota 5083  df-fun 5120  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-map 6537
This theorem is referenced by:  elmapi  6557  elmapssres  6560  mapsspm  6569  mapss  6578
  Copyright terms: Public domain W3C validator