ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eujust Unicode version

Theorem eujust 1950
Description: A soundness justification theorem for df-eu 1951, showing that the definition is equivalent to itself with its dummy variable renamed. Note that  y and  z needn't be distinct variables. (Contributed by NM, 11-Mar-2010.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
eujust  |-  ( E. y A. x (
ph 
<->  x  =  y )  <->  E. z A. x (
ph 
<->  x  =  z ) )
Distinct variable groups:    x, y    x, z    ph, y    ph, z
Allowed substitution hint:    ph( x)

Proof of Theorem eujust
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 equequ2 1646 . . . . 5  |-  ( y  =  w  ->  (
x  =  y  <->  x  =  w ) )
21bibi2d 230 . . . 4  |-  ( y  =  w  ->  (
( ph  <->  x  =  y
)  <->  ( ph  <->  x  =  w ) ) )
32albidv 1752 . . 3  |-  ( y  =  w  ->  ( A. x ( ph  <->  x  =  y )  <->  A. x
( ph  <->  x  =  w
) ) )
43cbvexv 1843 . 2  |-  ( E. y A. x (
ph 
<->  x  =  y )  <->  E. w A. x (
ph 
<->  x  =  w ) )
5 equequ2 1646 . . . . 5  |-  ( w  =  z  ->  (
x  =  w  <->  x  =  z ) )
65bibi2d 230 . . . 4  |-  ( w  =  z  ->  (
( ph  <->  x  =  w
)  <->  ( ph  <->  x  =  z ) ) )
76albidv 1752 . . 3  |-  ( w  =  z  ->  ( A. x ( ph  <->  x  =  w )  <->  A. x
( ph  <->  x  =  z
) ) )
87cbvexv 1843 . 2  |-  ( E. w A. x (
ph 
<->  x  =  w )  <->  E. z A. x (
ph 
<->  x  =  z ) )
94, 8bitri 182 1  |-  ( E. y A. x (
ph 
<->  x  =  y )  <->  E. z A. x (
ph 
<->  x  =  z ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 103   A.wal 1287    = wceq 1289   E.wex 1426
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472
This theorem depends on definitions:  df-bi 115
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator