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

Theorem cbvaldva 1880
Description: Rule used to change the bound variable in a universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)
Hypothesis
Ref Expression
cbvaldva.1  |-  ( (
ph  /\  x  =  y )  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
cbvaldva  |-  ( ph  ->  ( A. x ps  <->  A. y ch ) )
Distinct variable groups:    ps, y    ch, x    ph, x    ph, y
Allowed substitution hints:    ps( x)    ch( y)

Proof of Theorem cbvaldva
StepHypRef Expression
1 nfv 1493 . 2  |-  F/ y
ph
2 nfvd 1494 . 2  |-  ( ph  ->  F/ y ps )
3 cbvaldva.1 . . 3  |-  ( (
ph  /\  x  =  y )  ->  ( ps 
<->  ch ) )
43ex 114 . 2  |-  ( ph  ->  ( x  =  y  ->  ( ps  <->  ch )
) )
51, 2, 4cbvald 1877 1  |-  ( ph  ->  ( A. x ps  <->  A. y ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   A.wal 1314
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500
This theorem depends on definitions:  df-bi 116  df-nf 1422
This theorem is referenced by:  cbvraldva2  2635
  Copyright terms: Public domain W3C validator