New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  nelpri Unicode version

Theorem nelpri 3754
 Description: If an element doesn't match the items in an unordered pair, it is not in the unordered pair. (Contributed by David A. Wheeler, 10-May-2015.)
Hypotheses
Ref Expression
nelpri.1
nelpri.2
Assertion
Ref Expression
nelpri

Proof of Theorem nelpri
StepHypRef Expression
1 nelpri.1 . 2
2 nelpri.2 . 2
3 neanior 2601 . . 3
4 elpri 3753 . . . 4
54con3i 127 . . 3
63, 5sylbi 187 . 2
71, 2, 6mp2an 653 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wo 357   wa 358   wceq 1642   wcel 1710   wne 2516  cpr 3738 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-v 2861  df-nin 3211  df-compl 3212  df-un 3214  df-sn 3741  df-pr 3742 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator