MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mpt2eq123 Structured version   Unicode version

Theorem mpt2eq123 6249
Description: An equality theorem for the maps to notation. (Contributed by Mario Carneiro, 16-Dec-2013.) (Revised by Mario Carneiro, 19-Mar-2015.)
Assertion
Ref Expression
mpt2eq123  |-  ( ( A  =  D  /\  A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F ) )  -> 
( x  e.  A ,  y  e.  B  |->  C )  =  ( x  e.  D , 
y  e.  E  |->  F ) )
Distinct variable groups:    x, y, A    y, B    x, D, y    y, E
Allowed substitution hints:    B( x)    C( x, y)    E( x)    F( x, y)

Proof of Theorem mpt2eq123
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 nfv 1674 . . . 4  |-  F/ x  A  =  D
2 nfra1 2807 . . . 4  |-  F/ x A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F )
31, 2nfan 1865 . . 3  |-  F/ x
( A  =  D  /\  A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F ) )
4 nfv 1674 . . . 4  |-  F/ y  A  =  D
5 nfcv 2614 . . . . 5  |-  F/_ y A
6 nfv 1674 . . . . . 6  |-  F/ y  B  =  E
7 nfra1 2807 . . . . . 6  |-  F/ y A. y  e.  B  C  =  F
86, 7nfan 1865 . . . . 5  |-  F/ y ( B  =  E  /\  A. y  e.  B  C  =  F )
95, 8nfral 2882 . . . 4  |-  F/ y A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F )
104, 9nfan 1865 . . 3  |-  F/ y ( A  =  D  /\  A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F ) )
11 nfv 1674 . . 3  |-  F/ z ( A  =  D  /\  A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F ) )
12 rsp 2888 . . . . . . 7  |-  ( A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F )  ->  (
x  e.  A  -> 
( B  =  E  /\  A. y  e.  B  C  =  F ) ) )
13 rsp 2888 . . . . . . . . . 10  |-  ( A. y  e.  B  C  =  F  ->  ( y  e.  B  ->  C  =  F ) )
14 eqeq2 2467 . . . . . . . . . 10  |-  ( C  =  F  ->  (
z  =  C  <->  z  =  F ) )
1513, 14syl6 33 . . . . . . . . 9  |-  ( A. y  e.  B  C  =  F  ->  ( y  e.  B  ->  (
z  =  C  <->  z  =  F ) ) )
1615pm5.32d 639 . . . . . . . 8  |-  ( A. y  e.  B  C  =  F  ->  ( ( y  e.  B  /\  z  =  C )  <->  ( y  e.  B  /\  z  =  F )
) )
17 eleq2 2525 . . . . . . . . 9  |-  ( B  =  E  ->  (
y  e.  B  <->  y  e.  E ) )
1817anbi1d 704 . . . . . . . 8  |-  ( B  =  E  ->  (
( y  e.  B  /\  z  =  F
)  <->  ( y  e.  E  /\  z  =  F ) ) )
1916, 18sylan9bbr 700 . . . . . . 7  |-  ( ( B  =  E  /\  A. y  e.  B  C  =  F )  ->  (
( y  e.  B  /\  z  =  C
)  <->  ( y  e.  E  /\  z  =  F ) ) )
2012, 19syl6 33 . . . . . 6  |-  ( A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F )  ->  (
x  e.  A  -> 
( ( y  e.  B  /\  z  =  C )  <->  ( y  e.  E  /\  z  =  F ) ) ) )
2120pm5.32d 639 . . . . 5  |-  ( A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F )  ->  (
( x  e.  A  /\  ( y  e.  B  /\  z  =  C
) )  <->  ( x  e.  A  /\  (
y  e.  E  /\  z  =  F )
) ) )
22 eleq2 2525 . . . . . 6  |-  ( A  =  D  ->  (
x  e.  A  <->  x  e.  D ) )
2322anbi1d 704 . . . . 5  |-  ( A  =  D  ->  (
( x  e.  A  /\  ( y  e.  E  /\  z  =  F
) )  <->  ( x  e.  D  /\  (
y  e.  E  /\  z  =  F )
) ) )
2421, 23sylan9bbr 700 . . . 4  |-  ( ( A  =  D  /\  A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F ) )  -> 
( ( x  e.  A  /\  ( y  e.  B  /\  z  =  C ) )  <->  ( x  e.  D  /\  (
y  e.  E  /\  z  =  F )
) ) )
25 anass 649 . . . 4  |-  ( ( ( x  e.  A  /\  y  e.  B
)  /\  z  =  C )  <->  ( x  e.  A  /\  (
y  e.  B  /\  z  =  C )
) )
26 anass 649 . . . 4  |-  ( ( ( x  e.  D  /\  y  e.  E
)  /\  z  =  F )  <->  ( x  e.  D  /\  (
y  e.  E  /\  z  =  F )
) )
2724, 25, 263bitr4g 288 . . 3  |-  ( ( A  =  D  /\  A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F ) )  -> 
( ( ( x  e.  A  /\  y  e.  B )  /\  z  =  C )  <->  ( (
x  e.  D  /\  y  e.  E )  /\  z  =  F
) ) )
283, 10, 11, 27oprabbid 6243 . 2  |-  ( ( A  =  D  /\  A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F ) )  ->  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  A  /\  y  e.  B )  /\  z  =  C ) }  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  D  /\  y  e.  E )  /\  z  =  F ) } )
29 df-mpt2 6200 . 2  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  A  /\  y  e.  B )  /\  z  =  C
) }
30 df-mpt2 6200 . 2  |-  ( x  e.  D ,  y  e.  E  |->  F )  =  { <. <. x ,  y >. ,  z
>.  |  ( (
x  e.  D  /\  y  e.  E )  /\  z  =  F
) }
3128, 29, 303eqtr4g 2518 1  |-  ( ( A  =  D  /\  A. x  e.  A  ( B  =  E  /\  A. y  e.  B  C  =  F ) )  -> 
( x  e.  A ,  y  e.  B  |->  C )  =  ( x  e.  D , 
y  e.  E  |->  F ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1370    e. wcel 1758   A.wral 2796   {coprab 6196    |-> cmpt2 6197
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1954  ax-ext 2431
This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-clab 2438  df-cleq 2444  df-clel 2447  df-nfc 2602  df-ral 2801  df-oprab 6199  df-mpt2 6200
This theorem is referenced by:  mpt2eq12  6250  mapxpen  7582  xkoptsub  19354  xkocnv  19514  pmatcollpw2lem  31246
  Copyright terms: Public domain W3C validator