MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ax10-16 Unicode version

Theorem ax10-16 2226
Description: This theorem shows that, given ax-16 2180, we can derive a version of ax-10 2176. However, it is weaker than ax-10 2176 because it has a distinct variable requirement. (Contributed by Andrew Salmon, 27-Jul-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
ax10-16  |-  ( A. x  x  =  z  ->  A. z  z  =  x )
Distinct variable group:    x, z

Proof of Theorem ax10-16
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 ax-16 2180 . . . 4  |-  ( A. x  x  =  z  ->  ( x  =  w  ->  A. x  x  =  w ) )
21alrimiv 1638 . . 3  |-  ( A. x  x  =  z  ->  A. w ( x  =  w  ->  A. x  x  =  w )
)
32a5i-o 2186 . 2  |-  ( A. x  x  =  z  ->  A. x A. w
( x  =  w  ->  A. x  x  =  w ) )
4 equequ1 1691 . . . . . 6  |-  ( x  =  z  ->  (
x  =  w  <->  z  =  w ) )
54cbvalv 2038 . . . . . . 7  |-  ( A. x  x  =  w  <->  A. z  z  =  w )
65a1i 11 . . . . . 6  |-  ( x  =  z  ->  ( A. x  x  =  w 
<-> 
A. z  z  =  w ) )
74, 6imbi12d 312 . . . . 5  |-  ( x  =  z  ->  (
( x  =  w  ->  A. x  x  =  w )  <->  ( z  =  w  ->  A. z 
z  =  w ) ) )
87albidv 1632 . . . 4  |-  ( x  =  z  ->  ( A. w ( x  =  w  ->  A. x  x  =  w )  <->  A. w ( z  =  w  ->  A. z 
z  =  w ) ) )
98cbvalv 2038 . . 3  |-  ( A. x A. w ( x  =  w  ->  A. x  x  =  w )  <->  A. z A. w ( z  =  w  ->  A. z  z  =  w ) )
109biimpi 187 . 2  |-  ( A. x A. w ( x  =  w  ->  A. x  x  =  w )  ->  A. z A. w
( z  =  w  ->  A. z  z  =  w ) )
11 nfa1-o 2202 . . . . . . 7  |-  F/ z A. z  z  =  w
121119.23 1809 . . . . . 6  |-  ( A. z ( z  =  w  ->  A. z 
z  =  w )  <-> 
( E. z  z  =  w  ->  A. z 
z  =  w ) )
1312albii 1572 . . . . 5  |-  ( A. w A. z ( z  =  w  ->  A. z 
z  =  w )  <->  A. w ( E. z 
z  =  w  ->  A. z  z  =  w ) )
14 a9ev 1663 . . . . . . . 8  |-  E. z 
z  =  w
15 pm2.27 37 . . . . . . . 8  |-  ( E. z  z  =  w  ->  ( ( E. z  z  =  w  ->  A. z  z  =  w )  ->  A. z 
z  =  w ) )
1614, 15ax-mp 8 . . . . . . 7  |-  ( ( E. z  z  =  w  ->  A. z 
z  =  w )  ->  A. z  z  =  w )
1716alimi 1565 . . . . . 6  |-  ( A. w ( E. z 
z  =  w  ->  A. z  z  =  w )  ->  A. w A. z  z  =  w )
18 equequ2 1693 . . . . . . . . 9  |-  ( w  =  x  ->  (
z  =  w  <->  z  =  x ) )
1918spv 1956 . . . . . . . 8  |-  ( A. w  z  =  w  ->  z  =  x )
2019sps-o 2195 . . . . . . 7  |-  ( A. z A. w  z  =  w  ->  z  =  x )
2120a7s 1742 . . . . . 6  |-  ( A. w A. z  z  =  w  ->  z  =  x )
2217, 21syl 16 . . . . 5  |-  ( A. w ( E. z 
z  =  w  ->  A. z  z  =  w )  ->  z  =  x )
2313, 22sylbi 188 . . . 4  |-  ( A. w A. z ( z  =  w  ->  A. z 
z  =  w )  ->  z  =  x )
2423a7s 1742 . . 3  |-  ( A. z A. w ( z  =  w  ->  A. z 
z  =  w )  ->  z  =  x )
2524a5i-o 2186 . 2  |-  ( A. z A. w ( z  =  w  ->  A. z 
z  =  w )  ->  A. z  z  =  x )
263, 10, 253syl 19 1  |-  ( A. x  x  =  z  ->  A. z  z  =  x )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177   A.wal 1546   E.wex 1547
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-4 2171  ax-5o 2172  ax-6o 2173  ax-16 2180
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551
  Copyright terms: Public domain W3C validator