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

Theorem prid2g 3776
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 3775 . 2  |-  ( B  e.  V  ->  B  e.  { B ,  A } )
2 prcom 3747 . 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 3670
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676
This theorem is referenced by:  en2lp  4652  pw2f1odclem  7020  en2eqpr  7099  maxleim  11783  maxabslemval  11786  xrmaxleim  11822  xrmaxiflemval  11828  xrmaxaddlem  11838  2stropg  13222  2strop1g  13225  coseq0negpitopi  15579  umgredgprv  15985  umgrpredgv  16017  uhgr2edg  16076  umgrvad2edg  16081  usgr2v1e2w  16116
  Copyright terms: Public domain W3C validator