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

Theorem hbe1w 1682
Description: Weak version of hbe1 1705. See comments for ax6w 1691. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 19-Apr-2017.)
Hypothesis
Ref Expression
hbn1w.1  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
hbe1w  |-  ( E. x ph  ->  A. x E. x ph )
Distinct variable groups:    ph, y    ps, x    x, y
Allowed substitution hints:    ph( x)    ps( y)

Proof of Theorem hbe1w
StepHypRef Expression
1 df-ex 1529 . 2  |-  ( E. x ph  <->  -.  A. x  -.  ph )
2 hbn1w.1 . . . 4  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
32notbid 285 . . 3  |-  ( x  =  y  ->  ( -.  ph  <->  -.  ps )
)
43hbn1w 1680 . 2  |-  ( -. 
A. x  -.  ph  ->  A. x  -.  A. x  -.  ph )
51, 4hbxfrbi 1555 1  |-  ( E. x ph  ->  A. x E. x ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176   A.wal 1527   E.wex 1528
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643
This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1529
  Copyright terms: Public domain W3C validator