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

Theorem dfss1 3435
Description: A frequently-used variant of subclass definition df-ss 3233. (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 3233 . 2  |-  ( A 
C_  B  <->  ( A  i^i  B )  =  A )
2 incom 3421 . . 3  |-  ( A  i^i  B )  =  ( B  i^i  A
)
32eqeq1i 2246 . 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 1402    i^i cin 3219    C_ wss 3220
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-in 3226  df-ss 3233
This theorem is referenced by:  dfss5  3436  sseqin2  3450  onintexmid  4715  xpimasn  5231  fndmdif  5805  infiexmid  7171  ssfidc  7235  2omap  7308  isumss  12136  znnen  13267  pw1map  16939
  Copyright terms: Public domain W3C validator