Theorem elmapex 6806

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.

Step	Hyp	Ref	Expression
1		df-map 6787	. 2 |- ^m = ( x e. _V , y e. _V |-> { f | f : y --> x } )
2	1	elmpocl 6191	1 |- ( A e. ( B ^m C ) -> ( B e. _V /\ C e. _V ) )

Syntax hints:   -> wi 4   /\ wa 104   e. wcel 2200   {cab 2215   _Vcvv 2799   -->wf 5310  (class class class)co 5994   ^m cmap 6785

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-id 4381  df-xp 4722  df-rel 4723  df-cnv 4724  df-co 4725  df-dm 4726  df-iota 5274  df-fun 5316  df-fv 5322  df-ov 5997  df-oprab 5998  df-mpo 5999  df-map 6787

This theorem is referenced by:  elmapi  6807  elmapssres  6810  mapsspm  6819  mapss  6828