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

Theorem elmapssres 6954
Description: A restricted mapping is a mapping. (Contributed by Stefan O'Rear, 9-Oct-2014.) (Revised by Mario Carneiro, 5-May-2015.)
Assertion
Ref Expression
elmapssres  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  -> 
( A  |`  D )  e.  ( B  ^m  D ) )

Proof of Theorem elmapssres
StepHypRef Expression
1 elmapi 6944 . . 3  |-  ( A  e.  ( B  ^m  C )  ->  A : C --> B )
2 fssres 5565 . . 3  |-  ( ( A : C --> B  /\  D  C_  C )  -> 
( A  |`  D ) : D --> B )
31, 2sylan 283 . 2  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  -> 
( A  |`  D ) : D --> B )
4 elmapex 6943 . . . . 5  |-  ( A  e.  ( B  ^m  C )  ->  ( B  e.  _V  /\  C  e.  _V ) )
54simpld 112 . . . 4  |-  ( A  e.  ( B  ^m  C )  ->  B  e.  _V )
65adantr 276 . . 3  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  ->  B  e.  _V )
74simprd 114 . . . 4  |-  ( A  e.  ( B  ^m  C )  ->  C  e.  _V )
8 ssexg 4272 . . . . 5  |-  ( ( D  C_  C  /\  C  e.  _V )  ->  D  e.  _V )
98ancoms 268 . . . 4  |-  ( ( C  e.  _V  /\  D  C_  C )  ->  D  e.  _V )
107, 9sylan 283 . . 3  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  ->  D  e.  _V )
116, 10elmapd 6936 . 2  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  -> 
( ( A  |`  D )  e.  ( B  ^m  D )  <-> 
( A  |`  D ) : D --> B ) )
123, 11mpbird 167 1  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  -> 
( A  |`  D )  e.  ( B  ^m  D ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    e. wcel 2209   _Vcvv 2821    C_ wss 3220    |` cres 4776   -->wf 5373  (class class class)co 6085    ^m cmap 6922
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-map 6924
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator