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

Theorem ax8 1996
Description: Proof of ax-8 1992 from ax8v1 1994 and ax8v2 1995, proving sufficiency of the conjunction of the latter two weakened versions of ax8v 1993, which is itself a weakened version of ax-8 1992. (Contributed by BJ, 7-Dec-2020.) (Proof shortened by Wolf Lammen, 11-Apr-2021.)
Assertion
Ref Expression
ax8  |-  ( x  =  y  ->  (
x  e.  z  -> 
y  e.  z ) )

Proof of Theorem ax8
Dummy variable  t is distinct from all other variables.
StepHypRef Expression
1 equvinv 1959 . 2  |-  ( x  =  y  <->  E. t
( t  =  x  /\  t  =  y ) )
2 ax8v2 1995 . . . . 5  |-  ( x  =  t  ->  (
x  e.  z  -> 
t  e.  z ) )
32equcoms 1947 . . . 4  |-  ( t  =  x  ->  (
x  e.  z  -> 
t  e.  z ) )
4 ax8v1 1994 . . . 4  |-  ( t  =  y  ->  (
t  e.  z  -> 
y  e.  z ) )
53, 4sylan9 689 . . 3  |-  ( ( t  =  x  /\  t  =  y )  ->  ( x  e.  z  ->  y  e.  z ) )
65exlimiv 1858 . 2  |-  ( E. t ( t  =  x  /\  t  =  y )  ->  (
x  e.  z  -> 
y  e.  z ) )
71, 6sylbi 207 1  |-  ( x  =  y  ->  (
x  e.  z  -> 
y  e.  z ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384   E.wex 1704
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705
This theorem is referenced by:  elequ1  1997  el  4847  axextdfeq  31703  ax8dfeq  31704  exnel  31708  bj-ax89  32667  bj-el  32796
  Copyright terms: Public domain W3C validator