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

Theorem neneor 3057
Description: If two classes are different, a third class must be different of at least one of them. (Contributed by Thierry Arnoux, 8-Aug-2020.)
Assertion
Ref Expression
neneor (𝐴 ≠ 𝐵 → (𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐶))

Proof of Theorem neneor
StepHypRef Expression
1 eqtr3 2782 . . 3 ((𝐴 = 𝐶 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐵)
21necon3ai 2980 . 2 (𝐴 ≠ 𝐵 → ¬ (𝐴 = 𝐶 ∧ 𝐵 = 𝐶))
3 neorian 3050 . 2 ((𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐶) ↔ ¬ (𝐴 = 𝐶 ∧ 𝐵 = 𝐶))
42, 3sylibr 237 1 (𝐴 ≠ 𝐵 → (𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1569   ≠ wne 2955
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-cleq 2752  df-ne 2956
This theorem is used by:  wemapso2lem  9553  trgcopyeulem  29321
  Copyright terms: Public domain W3C validator