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

Theorem rabsn 3437
Description: Condition where a restricted class abstraction is a singleton. (Contributed by NM, 28-May-2006.)
Assertion
Ref Expression
rabsn  |-  ( B  e.  A  ->  { x  e.  A  |  x  =  B }  =  { B } )
Distinct variable groups:    x, A    x, B

Proof of Theorem rabsn
StepHypRef Expression
1 eleq1 2100 . . . . 5  |-  ( x  =  B  ->  (
x  e.  A  <->  B  e.  A ) )
21pm5.32ri 428 . . . 4  |-  ( ( x  e.  A  /\  x  =  B )  <->  ( B  e.  A  /\  x  =  B )
)
32baib 828 . . 3  |-  ( B  e.  A  ->  (
( x  e.  A  /\  x  =  B
)  <->  x  =  B
) )
43abbidv 2155 . 2  |-  ( B  e.  A  ->  { x  |  ( x  e.  A  /\  x  =  B ) }  =  { x  |  x  =  B } )
5 df-rab 2315 . 2  |-  { x  e.  A  |  x  =  B }  =  {
x  |  ( x  e.  A  /\  x  =  B ) }
6 df-sn 3381 . 2  |-  { B }  =  { x  |  x  =  B }
74, 5, 63eqtr4g 2097 1  |-  ( B  e.  A  ->  { x  e.  A  |  x  =  B }  =  { B } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    = wceq 1243    e. wcel 1393   {cab 2026   {crab 2310   {csn 3375
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-11 1397  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-rab 2315  df-sn 3381
This theorem is referenced by:  unisn3  4180
  Copyright terms: Public domain W3C validator