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

Theorem sbcrex 2983
Description: Interchange class substitution and restricted existential quantifier. (Contributed by NM, 15-Nov-2005.) (Revised by NM, 18-Aug-2018.)
Assertion
Ref Expression
sbcrex  |-  ( [. A  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph )
Distinct variable groups:    y, A    x, B    x, y
Allowed substitution hints:    ph( x, y)    A( x)    B( y)

Proof of Theorem sbcrex
StepHypRef Expression
1 nfcv 2279 . 2  |-  F/_ y A
2 sbcrext 2981 . 2  |-  ( F/_ y A  ->  ( [. A  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph ) )
31, 2ax-mp 5 1  |-  ( [. A  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 104   F/_wnfc 2266   E.wrex 2415   [.wsbc 2904
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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905
This theorem is referenced by:  ac6sfi  6785  rexfiuz  10754
  Copyright terms: Public domain W3C validator