MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  intsn Unicode version

Theorem intsn 4000
Description: The intersection of a singleton is its member. Theorem 70 of [Suppes] p. 41. (Contributed by NM, 29-Sep-2002.)
Hypothesis
Ref Expression
intsn.1  |-  A  e. 
_V
Assertion
Ref Expression
intsn  |-  |^| { A }  =  A

Proof of Theorem intsn
StepHypRef Expression
1 intsn.1 . 2  |-  A  e. 
_V
2 intsng 3999 . 2  |-  ( A  e.  _V  ->  |^| { A }  =  A )
31, 2ax-mp 8 1  |-  |^| { A }  =  A
Colors of variables: wff set class
Syntax hints:    = wceq 1647    e. wcel 1715   _Vcvv 2873   {csn 3729   |^|cint 3964
This theorem is referenced by:  uniintsn  4001  intunsn  4003  op1stb  4672  op2ndb  5259  ssfii  7319  cf0  8024  cflecard  8026  uffix  17829  iotain  27208
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1551  ax-5 1562  ax-17 1621  ax-9 1659  ax-8 1680  ax-6 1734  ax-7 1739  ax-11 1751  ax-12 1937  ax-ext 2347
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1324  df-ex 1547  df-nf 1550  df-sb 1654  df-clab 2353  df-cleq 2359  df-clel 2362  df-nfc 2491  df-ral 2633  df-v 2875  df-un 3243  df-in 3245  df-sn 3735  df-pr 3736  df-int 3965
  Copyright terms: Public domain W3C validator