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

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

Proof of Theorem prid1g
StepHypRef Expression
1 eqid 2238 . . 3  |-  A  =  A
21orci 743 . 2  |-  ( A  =  A  \/  A  =  B )
3 elprg 3729 . 2  |-  ( A  e.  V  ->  ( A  e.  { A ,  B }  <->  ( A  =  A  \/  A  =  B ) ) )
42, 3mpbiri 168 1  |-  ( A  e.  V  ->  A  e.  { A ,  B } )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    \/ wo 720    = wceq 1402    e. wcel 2209   {cpr 3710
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716
This theorem is used by:  prid2g  3816  prid1  3817  ifprdc  3819  preqr1g  3891  opth1  4376  en2lp  4701  acexmidlemcase  6080  pw2f1odclem  7134  en2eqpr  7214  m1expcl2  10998  maxabslemval  11974  xrmaxiflemval  12016  xrmaxaddlem  12026  2strbasg  13474  2strbas1g  13477  coseq0negpitopi  15937  structvtxval  16280  umgrnloopv  16355  umgredgprv  16356  umgrpredgv  16388  uhgr2edg  16447  umgrvad2edg  16452  usgr2v1e2w  16487  1hegrvtxdg1fi  16550  vdegp1bid  16556
  Copyright terms: Public domain W3C validator