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

Theorem dfss1 3363
Description: A frequently-used variant of subclass definition df-ss 3166. (Contributed by NM, 10-Jan-2015.)
Assertion
Ref Expression
dfss1  |-  ( A 
C_  B  <->  ( B  i^i  A )  =  A )

Proof of Theorem dfss1
StepHypRef Expression
1 df-ss 3166 . 2  |-  ( A 
C_  B  <->  ( A  i^i  B )  =  A )
2 incom 3351 . . 3  |-  ( A  i^i  B )  =  ( B  i^i  A
)
32eqeq1i 2201 . 2  |-  ( ( A  i^i  B )  =  A  <->  ( B  i^i  A )  =  A )
41, 3bitri 184 1  |-  ( A 
C_  B  <->  ( B  i^i  A )  =  A )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    = wceq 1364    i^i cin 3152    C_ wss 3153
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-in 3159  df-ss 3166
This theorem is referenced by:  dfss5  3364  sseqin2  3378  onintexmid  4605  xpimasn  5114  fndmdif  5663  infiexmid  6933  ssfidc  6991  isumss  11534  znnen  12555
  Copyright terms: Public domain W3C validator