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

Theorem equs5a 1197
Description: A property related to substitution that unlike equs5 1221 doesn't require a distinctor antecedent.
Assertion
Ref Expression
equs5a |- (E.x(x = y /\ A.yph) -> A.x(x = y -> ph))

Proof of Theorem equs5a
StepHypRef Expression
1 hba1 1003 . 2 |- (A.x(x = y -> ph) -> A.xA.x(x = y -> ph))
2 ax-11 967 . . 3 |- (x = y -> (A.yph -> A.x(x = y -> ph)))
32imp 350 . 2 |- ((x = y /\ A.yph) -> A.x(x = y -> ph))
41, 319.23ai 1064 1 |- (E.x(x = y /\ A.yph) -> A.x(x = y -> ph))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223  A.wal 954   = wceq 956  E.wex 980
This theorem is referenced by:  sb4a 1199  equs45f 1200
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-11 967  ax-4 973  ax-5o 975  ax-6o 978
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981
Copyright terms: Public domain