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

Theorem unisn3 4366
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 3590 . . 3  |-  ( A  e.  B  ->  { x  e.  B  |  x  =  A }  =  { A } )
21unieqd 3747 . 2  |-  ( A  e.  B  ->  U. {
x  e.  B  |  x  =  A }  =  U. { A }
)
3 unisng 3753 . 2  |-  ( A  e.  B  ->  U. { A }  =  A
)
42, 3eqtrd 2172 1  |-  ( A  e.  B  ->  U. {
x  e.  B  |  x  =  A }  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1331    e. wcel 1480   {crab 2420   {csn 3527   U.cuni 3736
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-rex 2422  df-rab 2425  df-v 2688  df-un 3075  df-sn 3533  df-pr 3534  df-uni 3737
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator