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

Theorem rspsbc 3113
Description: Restricted quantifier version of Axiom 4 of [Mendelson] p. 69. This provides an axiom for a predicate calculus for a restricted domain. This theorem generalizes the unrestricted stdpc4 1821 and spsbc 3041. See also rspsbca 3114 and rspcsbela . (Contributed by NM, 17-Nov-2006.) (Proof shortened by Mario Carneiro, 13-Oct-2016.)
Assertion
Ref Expression
rspsbc  |-  ( A  e.  B  ->  ( A. x  e.  B  ph 
->  [. A  /  x ]. ph ) )
Distinct variable group:    x, B
Allowed substitution hints:    ph( x)    A( x)

Proof of Theorem rspsbc
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 cbvralsv 2781 . 2  |-  ( A. x  e.  B  ph  <->  A. y  e.  B  [ y  /  x ] ph )
2 dfsbcq2 3032 . . 3  |-  ( y  =  A  ->  ( [ y  /  x ] ph  <->  [. A  /  x ]. ph ) )
32rspcv 2904 . 2  |-  ( A  e.  B  ->  ( A. y  e.  B  [ y  /  x ] ph  ->  [. A  /  x ]. ph ) )
41, 3biimtrid 152 1  |-  ( A  e.  B  ->  ( A. x  e.  B  ph 
->  [. A  /  x ]. ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4   [wsb 1808    e. wcel 2200   A.wral 2508   [.wsbc 3029
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-v 2802  df-sbc 3030
This theorem is referenced by:  rspsbca  3114  sbcth2  3118  rspcsbela  3185  riota5f  5993  riotass2  5995  fzrevral  10330  fprodcllemf  12164  ctiunctlemf  13049
  Copyright terms: Public domain W3C validator