Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mapco2g Unicode version

Theorem mapco2g 26790
Description: Renaming indexes in a tuple, with sethood as antecedents. (Contributed by Stefan O'Rear, 9-Oct-2014.) (Revised by Mario Carneiro, 5-May-2015.)
Assertion
Ref Expression
mapco2g  |-  ( ( E  e.  _V  /\  A  e.  ( B  ^m  C )  /\  D : E --> C )  -> 
( A  o.  D
)  e.  ( B  ^m  E ) )

Proof of Theorem mapco2g
StepHypRef Expression
1 elmapi 6792 . . . 4  |-  ( A  e.  ( B  ^m  C )  ->  A : C --> B )
2 fco 5398 . . . 4  |-  ( ( A : C --> B  /\  D : E --> C )  ->  ( A  o.  D ) : E --> B )
31, 2sylan 457 . . 3  |-  ( ( A  e.  ( B  ^m  C )  /\  D : E --> C )  ->  ( A  o.  D ) : E --> B )
433adant1 973 . 2  |-  ( ( E  e.  _V  /\  A  e.  ( B  ^m  C )  /\  D : E --> C )  -> 
( A  o.  D
) : E --> B )
5 n0i 3460 . . . . 5  |-  ( A  e.  ( B  ^m  C )  ->  -.  ( B  ^m  C )  =  (/) )
6 reldmmap 6781 . . . . . 6  |-  Rel  dom  ^m
76ovprc1 5886 . . . . 5  |-  ( -.  B  e.  _V  ->  ( B  ^m  C )  =  (/) )
85, 7nsyl2 119 . . . 4  |-  ( A  e.  ( B  ^m  C )  ->  B  e.  _V )
983ad2ant2 977 . . 3  |-  ( ( E  e.  _V  /\  A  e.  ( B  ^m  C )  /\  D : E --> C )  ->  B  e.  _V )
10 simp1 955 . . 3  |-  ( ( E  e.  _V  /\  A  e.  ( B  ^m  C )  /\  D : E --> C )  ->  E  e.  _V )
11 elmapg 6785 . . 3  |-  ( ( B  e.  _V  /\  E  e.  _V )  ->  ( ( A  o.  D )  e.  ( B  ^m  E )  <-> 
( A  o.  D
) : E --> B ) )
129, 10, 11syl2anc 642 . 2  |-  ( ( E  e.  _V  /\  A  e.  ( B  ^m  C )  /\  D : E --> C )  -> 
( ( A  o.  D )  e.  ( B  ^m  E )  <-> 
( A  o.  D
) : E --> B ) )
134, 12mpbird 223 1  |-  ( ( E  e.  _V  /\  A  e.  ( B  ^m  C )  /\  D : E --> C )  -> 
( A  o.  D
)  e.  ( B  ^m  E ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ w3a 934    = wceq 1623    e. wcel 1684   _Vcvv 2788   (/)c0 3455    o. ccom 4693   -->wf 5251  (class class class)co 5858    ^m cmap 6772
This theorem is referenced by:  mapco2  26791  eldioph2  26841
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-map 6774
  Copyright terms: Public domain W3C validator