HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ax9 807
Description: This is a variant of ax-9 799. Axiom scheme C10' in [Megill] p. 448 (p. 16 of the preprint).
Assertion
Ref Expression
ax9 |- (A.x(x = y -> A.xph) -> ph)

Proof of Theorem ax9
StepHypRef Expression
1 ax-9 799 . . . 4 |- -. A.x -. x = y
2 df-ex 679 . . . 4 |- (E.x x = y <-> -. A.x -. x = y)
31, 2mpbir 165 . . 3 |- E.x x = y
4 19.22 722 . . 3 |- (A.x(x = y -> A.xph) -> (E.x x = y -> E.xA.xph))
53, 4mpi 44 . 2 |- (A.x(x = y -> A.xph) -> E.xA.xph)
6 a6e 688 . 2 |- (E.xA.xph -> ph)
75, 6syl 12 1 |- (A.x(x = y -> A.xph) -> ph)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2  A.wal 672  E.wex 678   = weq 797
This theorem is referenced by:  ax9a 808  eqid 810  eqs1 828  eqsal 833  a4a 842  cbv1 845
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-gen 677  ax-9 799
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679
metamath.org