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

Theorem ax9from9o 2087
Description: Rederivation of axiom ax-9 1635 from ax-9o 2077 and other older axioms. See ax9o 1890 for the derivation of ax-9o 2077 from ax-9 1635. Lemma L18 in [Megill] p. 446 (p. 14 of the preprint). (Contributed by NM, 5-Aug-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
ax9from9o  |-  -.  A. x  -.  x  =  y

Proof of Theorem ax9from9o
StepHypRef Expression
1 ax-9o 2077 . 2  |-  ( A. x ( x  =  y  ->  A. x  -.  A. x  -.  x  =  y )  ->  -.  A. x  -.  x  =  y )
2 ax-6o 2076 . . 3  |-  ( -. 
A. x  -.  A. x  -.  x  =  y  ->  -.  x  =  y )
32con4i 122 . 2  |-  ( x  =  y  ->  A. x  -.  A. x  -.  x  =  y )
41, 3mpg 1535 1  |-  -.  A. x  -.  x  =  y
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4   A.wal 1527
This theorem is referenced by:  equidqe  2112
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-6o 2076  ax-9o 2077
  Copyright terms: Public domain W3C validator