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

Theorem cbvmptf 4076
Description: Rule to change the bound variable in a maps-to function, using implicit substitution. This version has bound-variable hypotheses in place of distinct variable conditions. (Contributed by Thierry Arnoux, 9-Mar-2017.)
Hypotheses
Ref Expression
cbvmptf.1  |-  F/_ x A
cbvmptf.2  |-  F/_ y A
cbvmptf.3  |-  F/_ y B
cbvmptf.4  |-  F/_ x C
cbvmptf.5  |-  ( x  =  y  ->  B  =  C )
Assertion
Ref Expression
cbvmptf  |-  ( x  e.  A  |->  B )  =  ( y  e.  A  |->  C )
Distinct variable group:    x, y
Allowed substitution hints:    A( x, y)    B( x, y)    C( x, y)

Proof of Theorem cbvmptf
Dummy variables  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1516 . . . 4  |-  F/ w
( x  e.  A  /\  z  =  B
)
2 cbvmptf.1 . . . . . 6  |-  F/_ x A
32nfcri 2302 . . . . 5  |-  F/ x  w  e.  A
4 nfs1v 1927 . . . . 5  |-  F/ x [ w  /  x ] z  =  B
53, 4nfan 1553 . . . 4  |-  F/ x
( w  e.  A  /\  [ w  /  x ] z  =  B )
6 eleq1w 2227 . . . . 5  |-  ( x  =  w  ->  (
x  e.  A  <->  w  e.  A ) )
7 sbequ12 1759 . . . . 5  |-  ( x  =  w  ->  (
z  =  B  <->  [ w  /  x ] z  =  B ) )
86, 7anbi12d 465 . . . 4  |-  ( x  =  w  ->  (
( x  e.  A  /\  z  =  B
)  <->  ( w  e.  A  /\  [ w  /  x ] z  =  B ) ) )
91, 5, 8cbvopab1 4055 . . 3  |-  { <. x ,  z >.  |  ( x  e.  A  /\  z  =  B ) }  =  { <. w ,  z >.  |  ( w  e.  A  /\  [ w  /  x ]
z  =  B ) }
10 cbvmptf.2 . . . . . 6  |-  F/_ y A
1110nfcri 2302 . . . . 5  |-  F/ y  w  e.  A
12 cbvmptf.3 . . . . . . 7  |-  F/_ y B
1312nfeq2 2320 . . . . . 6  |-  F/ y  z  =  B
1413nfsb 1934 . . . . 5  |-  F/ y [ w  /  x ] z  =  B
1511, 14nfan 1553 . . . 4  |-  F/ y ( w  e.  A  /\  [ w  /  x ] z  =  B )
16 nfv 1516 . . . 4  |-  F/ w
( y  e.  A  /\  z  =  C
)
17 eleq1w 2227 . . . . 5  |-  ( w  =  y  ->  (
w  e.  A  <->  y  e.  A ) )
18 cbvmptf.4 . . . . . . 7  |-  F/_ x C
1918nfeq2 2320 . . . . . 6  |-  F/ x  z  =  C
20 cbvmptf.5 . . . . . . 7  |-  ( x  =  y  ->  B  =  C )
2120eqeq2d 2177 . . . . . 6  |-  ( x  =  y  ->  (
z  =  B  <->  z  =  C ) )
2219, 21sbhypf 2775 . . . . 5  |-  ( w  =  y  ->  ( [ w  /  x ] z  =  B  <-> 
z  =  C ) )
2317, 22anbi12d 465 . . . 4  |-  ( w  =  y  ->  (
( w  e.  A  /\  [ w  /  x ] z  =  B )  <->  ( y  e.  A  /\  z  =  C ) ) )
2415, 16, 23cbvopab1 4055 . . 3  |-  { <. w ,  z >.  |  ( w  e.  A  /\  [ w  /  x ]
z  =  B ) }  =  { <. y ,  z >.  |  ( y  e.  A  /\  z  =  C ) }
259, 24eqtri 2186 . 2  |-  { <. x ,  z >.  |  ( x  e.  A  /\  z  =  B ) }  =  { <. y ,  z >.  |  ( y  e.  A  /\  z  =  C ) }
26 df-mpt 4045 . 2  |-  ( x  e.  A  |->  B )  =  { <. x ,  z >.  |  ( x  e.  A  /\  z  =  B ) }
27 df-mpt 4045 . 2  |-  ( y  e.  A  |->  C )  =  { <. y ,  z >.  |  ( y  e.  A  /\  z  =  C ) }
2825, 26, 273eqtr4i 2196 1  |-  ( x  e.  A  |->  B )  =  ( y  e.  A  |->  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1343   [wsb 1750    e. wcel 2136   F/_wnfc 2295   {copab 4042    |-> cmpt 4043
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-un 3120  df-sn 3582  df-pr 3583  df-op 3585  df-opab 4044  df-mpt 4045
This theorem is referenced by:  resmptf  4934
  Copyright terms: Public domain W3C validator