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

Theorem elmapssres 6497
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 6494 . . 3  |-  ( A  e.  ( B  ^m  C )  ->  A : C --> B )
2 fssres 5234 . . 3  |-  ( ( A : C --> B  /\  D  C_  C )  -> 
( A  |`  D ) : D --> B )
31, 2sylan 279 . 2  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  -> 
( A  |`  D ) : D --> B )
4 elmapex 6493 . . . . 5  |-  ( A  e.  ( B  ^m  C )  ->  ( B  e.  _V  /\  C  e.  _V ) )
54simpld 111 . . . 4  |-  ( A  e.  ( B  ^m  C )  ->  B  e.  _V )
65adantr 272 . . 3  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  ->  B  e.  _V )
74simprd 113 . . . 4  |-  ( A  e.  ( B  ^m  C )  ->  C  e.  _V )
8 ssexg 4007 . . . . 5  |-  ( ( D  C_  C  /\  C  e.  _V )  ->  D  e.  _V )
98ancoms 266 . . . 4  |-  ( ( C  e.  _V  /\  D  C_  C )  ->  D  e.  _V )
107, 9sylan 279 . . 3  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  ->  D  e.  _V )
116, 10elmapd 6486 . 2  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  -> 
( ( A  |`  D )  e.  ( B  ^m  D )  <-> 
( A  |`  D ) : D --> B ) )
123, 11mpbird 166 1  |-  ( ( A  e.  ( B  ^m  C )  /\  D  C_  C )  -> 
( A  |`  D )  e.  ( B  ^m  D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    e. wcel 1448   _Vcvv 2641    C_ wss 3021    |` cres 4479   -->wf 5055  (class class class)co 5706    ^m cmap 6472
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 584  ax-in2 585  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-sep 3986  ax-pow 4038  ax-pr 4069  ax-un 4293  ax-setind 4390
This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-fal 1305  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ne 2268  df-ral 2380  df-rex 2381  df-v 2643  df-sbc 2863  df-dif 3023  df-un 3025  df-in 3027  df-ss 3034  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-br 3876  df-opab 3930  df-id 4153  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-res 4489  df-iota 5024  df-fun 5061  df-fn 5062  df-f 5063  df-fv 5067  df-ov 5709  df-oprab 5710  df-mpo 5711  df-map 6474
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator