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

Theorem prid1 3802
Description: An unordered pair contains its first member. Part of Theorem 7.6 of [Quine] p. 49. (Contributed by NM, 5-Aug-1993.)
Hypothesis
Ref Expression
prid1.1  |-  A  e. 
_V
Assertion
Ref Expression
prid1  |-  A  e. 
{ A ,  B }

Proof of Theorem prid1
StepHypRef Expression
1 prid1.1 . 2  |-  A  e. 
_V
2 prid1g 3800 . 2  |-  ( A  e.  _V  ->  A  e.  { A ,  B } )
31, 2ax-mp 5 1  |-  A  e. 
{ A ,  B }
Colors of variables: wff set class
Syntax hints:    e. wcel 2205   _Vcvv 2815   {cpr 3695
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 2216
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3218  df-sn 3700  df-pr 3701
This theorem is referenced by:  prid2  3803  prnz  3820  preqr1  3877  preq12b  3879  prel12  3880  opi1  4353  opeluu  4576  onsucelsucexmidlem1  4655  regexmidlem1  4660  reg2exmidlema  4661  opthreg  4683  ordtri2or2exmid  4698  ontri2orexmidim  4699  dmrnssfld  5025  funopg  5391  acexmidlemb  6050  0lt2o  6687  2dom  7059  unfiexmid  7191  djuss  7374  exmidomni  7446  pr2cv1  7505  exmidonfinlem  7509  exmidaclem  7528  reelprrecn  8278  pnfxr  8342  sup3exmid  9248  fun2dmnop0  11247  fnpr2ob  13604  lgsdir2lem3  16029  upgrex  16224  upgr1een  16245  eulerpathprum  16601  bdop  16771  2o01f  16894  iswomni0  16962
  Copyright terms: Public domain W3C validator