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

Theorem ssextss 3956
Description: An extensionality-like principle defining subclass in terms of subsets. (Contributed by NM, 30-Jun-2004.)
Assertion
Ref Expression
ssextss  |-  ( A 
C_  B  <->  A. x
( x  C_  A  ->  x  C_  B )
)
Distinct variable groups:    x, A    x, B

Proof of Theorem ssextss
StepHypRef Expression
1 sspwb 3952 . 2  |-  ( A 
C_  B  <->  ~P A  C_ 
~P B )
2 dfss2 2934 . 2  |-  ( ~P A  C_  ~P B  <->  A. x ( x  e. 
~P A  ->  x  e.  ~P B ) )
3 vex 2560 . . . . 5  |-  x  e. 
_V
43elpw 3365 . . . 4  |-  ( x  e.  ~P A  <->  x  C_  A
)
53elpw 3365 . . . 4  |-  ( x  e.  ~P B  <->  x  C_  B
)
64, 5imbi12i 228 . . 3  |-  ( ( x  e.  ~P A  ->  x  e.  ~P B
)  <->  ( x  C_  A  ->  x  C_  B
) )
76albii 1359 . 2  |-  ( A. x ( x  e. 
~P A  ->  x  e.  ~P B )  <->  A. x
( x  C_  A  ->  x  C_  B )
)
81, 2, 73bitri 195 1  |-  ( A 
C_  B  <->  A. x
( x  C_  A  ->  x  C_  B )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 98   A.wal 1241    e. wcel 1393    C_ wss 2917   ~Pcpw 3359
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381
This theorem is referenced by:  ssext  3957  nssssr  3958
  Copyright terms: Public domain W3C validator