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

Theorem prneimg 4857
Description: Two pairs are not equal if at least one element of the first pair is not contained in the second pair. (Contributed by Alexander van der Vekens, 13-Aug-2017.)
Assertion
Ref Expression
prneimg (((𝐴𝑈𝐵𝑉) ∧ (𝐶𝑋𝐷𝑌)) → (((𝐴𝐶𝐴𝐷) ∨ (𝐵𝐶𝐵𝐷)) → {𝐴, 𝐵} ≠ {𝐶, 𝐷}))

Proof of Theorem prneimg
StepHypRef Expression
1 preq12bg 4856 . . . . 5 (((𝐴𝑈𝐵𝑉) ∧ (𝐶𝑋𝐷𝑌)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶))))
2 orddi 1007 . . . . . 6 (((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶)) ↔ (((𝐴 = 𝐶𝐴 = 𝐷) ∧ (𝐴 = 𝐶𝐵 = 𝐶)) ∧ ((𝐵 = 𝐷𝐴 = 𝐷) ∧ (𝐵 = 𝐷𝐵 = 𝐶))))
3 simpll 765 . . . . . . 7 ((((𝐴 = 𝐶𝐴 = 𝐷) ∧ (𝐴 = 𝐶𝐵 = 𝐶)) ∧ ((𝐵 = 𝐷𝐴 = 𝐷) ∧ (𝐵 = 𝐷𝐵 = 𝐶))) → (𝐴 = 𝐶𝐴 = 𝐷))
4 pm1.4 867 . . . . . . . 8 ((𝐵 = 𝐷𝐵 = 𝐶) → (𝐵 = 𝐶𝐵 = 𝐷))
54ad2antll 727 . . . . . . 7 ((((𝐴 = 𝐶𝐴 = 𝐷) ∧ (𝐴 = 𝐶𝐵 = 𝐶)) ∧ ((𝐵 = 𝐷𝐴 = 𝐷) ∧ (𝐵 = 𝐷𝐵 = 𝐶))) → (𝐵 = 𝐶𝐵 = 𝐷))
63, 5jca 510 . . . . . 6 ((((𝐴 = 𝐶𝐴 = 𝐷) ∧ (𝐴 = 𝐶𝐵 = 𝐶)) ∧ ((𝐵 = 𝐷𝐴 = 𝐷) ∧ (𝐵 = 𝐷𝐵 = 𝐶))) → ((𝐴 = 𝐶𝐴 = 𝐷) ∧ (𝐵 = 𝐶𝐵 = 𝐷)))
72, 6sylbi 216 . . . . 5 (((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶)) → ((𝐴 = 𝐶𝐴 = 𝐷) ∧ (𝐵 = 𝐶𝐵 = 𝐷)))
81, 7biimtrdi 252 . . . 4 (((𝐴𝑈𝐵𝑉) ∧ (𝐶𝑋𝐷𝑌)) → ({𝐴, 𝐵} = {𝐶, 𝐷} → ((𝐴 = 𝐶𝐴 = 𝐷) ∧ (𝐵 = 𝐶𝐵 = 𝐷))))
9 ianor 979 . . . . . 6 (¬ (𝐴𝐶𝐴𝐷) ↔ (¬ 𝐴𝐶 ∨ ¬ 𝐴𝐷))
10 nne 2933 . . . . . . 7 𝐴𝐶𝐴 = 𝐶)
11 nne 2933 . . . . . . 7 𝐴𝐷𝐴 = 𝐷)
1210, 11orbi12i 912 . . . . . 6 ((¬ 𝐴𝐶 ∨ ¬ 𝐴𝐷) ↔ (𝐴 = 𝐶𝐴 = 𝐷))
139, 12bitr2i 275 . . . . 5 ((𝐴 = 𝐶𝐴 = 𝐷) ↔ ¬ (𝐴𝐶𝐴𝐷))
14 ianor 979 . . . . . 6 (¬ (𝐵𝐶𝐵𝐷) ↔ (¬ 𝐵𝐶 ∨ ¬ 𝐵𝐷))
15 nne 2933 . . . . . . 7 𝐵𝐶𝐵 = 𝐶)
16 nne 2933 . . . . . . 7 𝐵𝐷𝐵 = 𝐷)
1715, 16orbi12i 912 . . . . . 6 ((¬ 𝐵𝐶 ∨ ¬ 𝐵𝐷) ↔ (𝐵 = 𝐶𝐵 = 𝐷))
1814, 17bitr2i 275 . . . . 5 ((𝐵 = 𝐶𝐵 = 𝐷) ↔ ¬ (𝐵𝐶𝐵𝐷))
1913, 18anbi12i 626 . . . 4 (((𝐴 = 𝐶𝐴 = 𝐷) ∧ (𝐵 = 𝐶𝐵 = 𝐷)) ↔ (¬ (𝐴𝐶𝐴𝐷) ∧ ¬ (𝐵𝐶𝐵𝐷)))
208, 19imbitrdi 250 . . 3 (((𝐴𝑈𝐵𝑉) ∧ (𝐶𝑋𝐷𝑌)) → ({𝐴, 𝐵} = {𝐶, 𝐷} → (¬ (𝐴𝐶𝐴𝐷) ∧ ¬ (𝐵𝐶𝐵𝐷))))
21 pm4.56 986 . . 3 ((¬ (𝐴𝐶𝐴𝐷) ∧ ¬ (𝐵𝐶𝐵𝐷)) ↔ ¬ ((𝐴𝐶𝐴𝐷) ∨ (𝐵𝐶𝐵𝐷)))
2220, 21imbitrdi 250 . 2 (((𝐴𝑈𝐵𝑉) ∧ (𝐶𝑋𝐷𝑌)) → ({𝐴, 𝐵} = {𝐶, 𝐷} → ¬ ((𝐴𝐶𝐴𝐷) ∨ (𝐵𝐶𝐵𝐷))))
2322necon2ad 2944 1 (((𝐴𝑈𝐵𝑉) ∧ (𝐶𝑋𝐷𝑌)) → (((𝐴𝐶𝐴𝐷) ∨ (𝐵𝐶𝐵𝐷)) → {𝐴, 𝐵} ≠ {𝐶, 𝐷}))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 394  wo 845   = wceq 1533  wcel 2098  wne 2929  {cpr 4632
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 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ne 2930  df-v 3463  df-un 3949  df-sn 4631  df-pr 4633
This theorem is referenced by:  prnebg  4858  opthhausdorff  5519  symg2bas  19359  m2detleib  22577  umgrvad2edg  29098  usgrexmpldifpr  29143  zlmodzxzldeplem  47752  line2x  48013  inlinecirc02plem  48045
  Copyright terms: Public domain W3C validator