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

Theorem pr1nebg 4815
Description: A (proper) pair is not equal to another (maybe improper) pair containing one element of the first pair if and only if the other element of the first pair is not contained in the second pair. (Contributed by Alexander van der Vekens, 26-Jan-2018.)
Assertion
Ref Expression
pr1nebg (((𝐴𝑈𝐵𝑉𝐶𝑋) ∧ 𝐴𝐵) → (𝐴𝐶 ↔ {𝐴, 𝐵} ≠ {𝐵, 𝐶}))

Proof of Theorem pr1nebg
StepHypRef Expression
1 pr1eqbg 4814 . 2 (((𝐴𝑈𝐵𝑉𝐶𝑋) ∧ 𝐴𝐵) → (𝐴 = 𝐶 ↔ {𝐴, 𝐵} = {𝐵, 𝐶}))
21necon3bid 2988 1 (((𝐴𝑈𝐵𝑉𝐶𝑋) ∧ 𝐴𝐵) → (𝐴𝐶 ↔ {𝐴, 𝐵} ≠ {𝐵, 𝐶}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087  wcel 2106  wne 2943  {cpr 4588
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2707
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2714  df-cleq 2728  df-clel 2814  df-ne 2944  df-v 3447  df-un 3915  df-sn 4587  df-pr 4589
This theorem is referenced by:  usgr2pthlem  28709
  Copyright terms: Public domain W3C validator