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

Theorem sbiedh 1775
Description: Conversion of implicit substitution to explicit substitution (deduction version of sbieh 1778). New proofs should use sbied 1776 instead. (Contributed by NM, 30-Jun-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
sbiedh.1  |-  ( ph  ->  A. x ph )
sbiedh.2  |-  ( ph  ->  ( ch  ->  A. x ch ) )
sbiedh.3  |-  ( ph  ->  ( x  =  y  ->  ( ps  <->  ch )
) )
Assertion
Ref Expression
sbiedh  |-  ( ph  ->  ( [ y  /  x ] ps  <->  ch )
)

Proof of Theorem sbiedh
StepHypRef Expression
1 sb1 1754 . . . 4  |-  ( [ y  /  x ] ps  ->  E. x ( x  =  y  /\  ps ) )
2 sbiedh.1 . . . . 5  |-  ( ph  ->  A. x ph )
3 sbiedh.3 . . . . . . 7  |-  ( ph  ->  ( x  =  y  ->  ( ps  <->  ch )
) )
4 biimp 117 . . . . . . 7  |-  ( ( ps  <->  ch )  ->  ( ps  ->  ch ) )
53, 4syl6 33 . . . . . 6  |-  ( ph  ->  ( x  =  y  ->  ( ps  ->  ch ) ) )
65impd 252 . . . . 5  |-  ( ph  ->  ( ( x  =  y  /\  ps )  ->  ch ) )
72, 6eximdh 1599 . . . 4  |-  ( ph  ->  ( E. x ( x  =  y  /\  ps )  ->  E. x ch ) )
81, 7syl5 32 . . 3  |-  ( ph  ->  ( [ y  /  x ] ps  ->  E. x ch ) )
9 sbiedh.2 . . . 4  |-  ( ph  ->  ( ch  ->  A. x ch ) )
102, 919.9hd 1650 . . 3  |-  ( ph  ->  ( E. x ch 
->  ch ) )
118, 10syld 45 . 2  |-  ( ph  ->  ( [ y  /  x ] ps  ->  ch ) )
12 biimpr 129 . . . . . . 7  |-  ( ( ps  <->  ch )  ->  ( ch  ->  ps ) )
133, 12syl6 33 . . . . . 6  |-  ( ph  ->  ( x  =  y  ->  ( ch  ->  ps ) ) )
1413com23 78 . . . . 5  |-  ( ph  ->  ( ch  ->  (
x  =  y  ->  ps ) ) )
152, 14alimdh 1455 . . . 4  |-  ( ph  ->  ( A. x ch 
->  A. x ( x  =  y  ->  ps ) ) )
16 sb2 1755 . . . 4  |-  ( A. x ( x  =  y  ->  ps )  ->  [ y  /  x ] ps )
1715, 16syl6 33 . . 3  |-  ( ph  ->  ( A. x ch 
->  [ y  /  x ] ps ) )
189, 17syld 45 . 2  |-  ( ph  ->  ( ch  ->  [ y  /  x ] ps ) )
1911, 18impbid 128 1  |-  ( ph  ->  ( [ y  /  x ] ps  <->  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   A.wal 1341   E.wex 1480   [wsb 1750
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 1435  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-4 1498  ax-i9 1518  ax-ial 1522
This theorem depends on definitions:  df-bi 116  df-sb 1751
This theorem is referenced by:  sbied  1776  sbieh  1778  sbcomxyyz  1960
  Copyright terms: Public domain W3C validator