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

Theorem ssabral 3298
Description: The relation for a subclass of a class abstraction is equivalent to restricted quantification. (Contributed by NM, 6-Sep-2006.)
Assertion
Ref Expression
ssabral  |-  ( A 
C_  { x  | 
ph }  <->  A. x  e.  A  ph )
Distinct variable group:    x, A
Allowed substitution hint:    ph( x)

Proof of Theorem ssabral
StepHypRef Expression
1 ssab 3297 . 2  |-  ( A 
C_  { x  | 
ph }  <->  A. x
( x  e.  A  ->  ph ) )
2 df-ral 2515 . 2  |-  ( A. x  e.  A  ph  <->  A. x
( x  e.  A  ->  ph ) )
31, 2bitr4i 187 1  |-  ( A 
C_  { x  | 
ph }  <->  A. x  e.  A  ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   A.wal 1395    e. wcel 2202   {cab 2217   A.wral 2510    C_ wss 3200
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-in 3206  df-ss 3213
This theorem is referenced by:  txdis1cn  15001  bj-bdfindis  16542
  Copyright terms: Public domain W3C validator