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

Theorem unisn3 4557
Description: Union of a singleton in the form of a restricted class abstraction. (Contributed by NM, 3-Jul-2008.)
Assertion
Ref Expression
unisn3  |-  ( A  e.  B  ->  U. {
x  e.  B  |  x  =  A }  =  A )
Distinct variable groups:    x, A    x, B

Proof of Theorem unisn3
StepHypRef Expression
1 rabsn 3749 . . 3  |-  ( A  e.  B  ->  { x  e.  B  |  x  =  A }  =  { A } )
21unieqd 3918 . 2  |-  ( A  e.  B  ->  U. {
x  e.  B  |  x  =  A }  =  U. { A }
)
3 unisng 3924 . 2  |-  ( A  e.  B  ->  U. { A }  =  A
)
42, 3eqtrd 2265 1  |-  ( A  e.  B  ->  U. {
x  e.  B  |  x  =  A }  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2203   {crab 2524   {csn 3682   U.cuni 3907
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 2214
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rex 2526  df-rab 2529  df-v 2814  df-un 3214  df-sn 3688  df-pr 3689  df-uni 3908
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator