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

Theorem intunsn 3971
Description: Theorem joining a singleton to an intersection. (Contributed by NM, 29-Sep-2002.)
Hypothesis
Ref Expression
intunsn.1  |-  B  e. 
_V
Assertion
Ref Expression
intunsn  |-  |^| ( A  u.  { B } )  =  (
|^| A  i^i  B
)

Proof of Theorem intunsn
StepHypRef Expression
1 intun 3964 . 2  |-  |^| ( A  u.  { B } )  =  (
|^| A  i^i  |^| { B } )
2 intunsn.1 . . . 4  |-  B  e. 
_V
32intsn 3968 . . 3  |-  |^| { B }  =  B
43ineq2i 3407 . 2  |-  ( |^| A  i^i  |^| { B }
)  =  ( |^| A  i^i  B )
51, 4eqtri 2252 1  |-  |^| ( A  u.  { B } )  =  (
|^| A  i^i  B
)
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2202   _Vcvv 2803    u. cun 3199    i^i cin 3200   {csn 3673   |^|cint 3933
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-v 2805  df-un 3205  df-in 3207  df-sn 3679  df-pr 3680  df-int 3934
This theorem is referenced by:  fiintim  7166
  Copyright terms: Public domain W3C validator