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

Theorem nelprd 4589
 Description: If an element doesn't match the items in an unordered pair, it is not in the unordered pair, deduction version. (Contributed by Alexander van der Vekens, 25-Jan-2018.)
Hypotheses
Ref Expression
nelprd.1 (𝜑𝐴𝐵)
nelprd.2 (𝜑𝐴𝐶)
Assertion
Ref Expression
nelprd (𝜑 → ¬ 𝐴 ∈ {𝐵, 𝐶})

Proof of Theorem nelprd
StepHypRef Expression
1 nelprd.1 . 2 (𝜑𝐴𝐵)
2 nelprd.2 . 2 (𝜑𝐴𝐶)
3 neanior 3109 . . 3 ((𝐴𝐵𝐴𝐶) ↔ ¬ (𝐴 = 𝐵𝐴 = 𝐶))
4 elpri 4582 . . . 4 (𝐴 ∈ {𝐵, 𝐶} → (𝐴 = 𝐵𝐴 = 𝐶))
54con3i 157 . . 3 (¬ (𝐴 = 𝐵𝐴 = 𝐶) → ¬ 𝐴 ∈ {𝐵, 𝐶})
63, 5sylbi 219 . 2 ((𝐴𝐵𝐴𝐶) → ¬ 𝐴 ∈ {𝐵, 𝐶})
71, 2, 6syl2anc 586 1 (𝜑 → ¬ 𝐴 ∈ {𝐵, 𝐶})
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   ∨ wo 843   = wceq 1533   ∈ wcel 2110   ≠ wne 3016  {cpr 4562 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-v 3496  df-un 3940  df-sn 4561  df-pr 4563 This theorem is referenced by:  renfdisj  10695  sumtp  15098  pmtrprfv3  18576  logbgcd1irr  25366  perfectlem2  25800  nbupgrres  27140  usgr2pthlem  27538  eupth2lem3lem6  28006  cycpmco2  30770  cyc2fvx  30771  mnuprdlem1  40601  mnuprdlem2  40602  perfectALTVlem2  43881
 Copyright terms: Public domain W3C validator