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

Theorem prneli 4617
Description: If an element doesn't match the items in an unordered pair, it is not in the unordered pair, using ∉. (Contributed by David A. Wheeler, 10-May-2015.)
Hypotheses
Ref Expression
prneli.1 𝐴 ≠ 𝐵
prneli.2 𝐴 ≠ 𝐶
Assertion
Ref Expression
prneli 𝐴 ∉ {𝐵, 𝐶}

Proof of Theorem prneli
StepHypRef Expression
1 prneli.1 . . 3 𝐴 ≠ 𝐵
2 prneli.2 . . 3 𝐴 ≠ 𝐶
31, 2nelpri 4616 . 2 ¬ 𝐴 ∈ {𝐵, 𝐶}
43nelir 3071 1 𝐴 ∉ {𝐵, 𝐶}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ≠ wne 2962   ∉ wnel 3068  {cpr 4589
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1575  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-nel 3069  df-v 3455  df-un 4153  df-sn 4588  df-pr 4590
This theorem is used by:  vdegp1ai  30176
  Copyright terms: Public domain W3C validator