Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  nelpri Structured version   Visualization version   GIF version

Theorem nelpri 4586
 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 3107 . . 3 ((𝐴𝐵𝐴𝐶) ↔ ¬ (𝐴 = 𝐵𝐴 = 𝐶))
4 elpri 4581 . . . 4 (𝐴 ∈ {𝐵, 𝐶} → (𝐴 = 𝐵𝐴 = 𝐶))
54con3i 157 . . 3 (¬ (𝐴 = 𝐵𝐴 = 𝐶) → ¬ 𝐴 ∈ {𝐵, 𝐶})
63, 5sylbi 219 . 2 ((𝐴𝐵𝐴𝐶) → ¬ 𝐴 ∈ {𝐵, 𝐶})
71, 2, 6mp2an 690 1 ¬ 𝐴 ∈ {𝐵, 𝐶}
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ∧ wa 398   ∨ wo 843   = wceq 1530   ∈ wcel 2107   ≠ wne 3014  {cpr 4561 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-v 3495  df-un 3939  df-sn 4560  df-pr 4562 This theorem is referenced by:  prneli  4587  ex-dif  28194  ex-in  28196  ex-pss  28199  ex-res  28212  ex-hash  28224
 Copyright terms: Public domain W3C validator