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

Theorem prid2g 3780
Description: An unordered pair contains its second member. Part of Theorem 7.6 of [Quine] p. 49. (Contributed by Stefan Allan, 8-Nov-2008.)
Assertion
Ref Expression
prid2g  |-  ( B  e.  V  ->  B  e.  { A ,  B } )

Proof of Theorem prid2g
StepHypRef Expression
1 prid1g 3779 . 2  |-  ( B  e.  V  ->  B  e.  { B ,  A } )
2 prcom 3751 . 2  |-  { B ,  A }  =  { A ,  B }
31, 2eleqtrdi 2324 1  |-  ( B  e.  V  ->  B  e.  { A ,  B } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 2202   {cpr 3674
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 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680
This theorem is referenced by:  en2lp  4658  pw2f1odclem  7063  en2eqpr  7142  maxleim  11828  maxabslemval  11831  xrmaxleim  11867  xrmaxiflemval  11873  xrmaxaddlem  11883  2stropg  13267  2strop1g  13270  coseq0negpitopi  15630  umgredgprv  16039  umgrpredgv  16071  uhgr2edg  16130  umgrvad2edg  16135  usgr2v1e2w  16170
  Copyright terms: Public domain W3C validator