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

Theorem prneimg2 4815
Description: Two pairs are not equal if their counterparts are not equal. (Contributed by AV, 5-Sep-2025.)
Assertion
Ref Expression
prneimg2 (((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌)) → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} ↔ ((𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷) ∧ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐶))))

Proof of Theorem prneimg2
StepHypRef Expression
1 preq12bg 4813 . . 3 (((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
21necon3abid 2992 . 2 (((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌)) → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} ↔ ¬ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
3 ioran 999 . . 3 (¬ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) ↔ (¬ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ ¬ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)))
4 ianor 997 . . . . 5 (¬ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ (¬ 𝐴 = 𝐶 ∨ ¬ 𝐵 = 𝐷))
5 df-ne 2957 . . . . . 6 (𝐴 ≠ 𝐶 ↔ ¬ 𝐴 = 𝐶)
6 df-ne 2957 . . . . . 6 (𝐵 ≠ 𝐷 ↔ ¬ 𝐵 = 𝐷)
75, 6orbi12i 928 . . . . 5 ((𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷) ↔ (¬ 𝐴 = 𝐶 ∨ ¬ 𝐵 = 𝐷))
84, 7bitr4i 281 . . . 4 (¬ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ (𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷))
9 ianor 997 . . . . 5 (¬ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶) ↔ (¬ 𝐴 = 𝐷 ∨ ¬ 𝐵 = 𝐶))
10 df-ne 2957 . . . . . 6 (𝐴 ≠ 𝐷 ↔ ¬ 𝐴 = 𝐷)
11 df-ne 2957 . . . . . 6 (𝐵 ≠ 𝐶 ↔ ¬ 𝐵 = 𝐶)
1210, 11orbi12i 928 . . . . 5 ((𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐶) ↔ (¬ 𝐴 = 𝐷 ∨ ¬ 𝐵 = 𝐶))
139, 12bitr4i 281 . . . 4 (¬ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶) ↔ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐶))
148, 13anbi12i 640 . . 3 ((¬ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ ¬ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) ↔ ((𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷) ∧ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐶)))
153, 14bitri 278 . 2 (¬ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) ↔ ((𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷) ∧ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐶)))
162, 15bitrdi 290 1 (((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌)) → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} ↔ ((𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷) ∧ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐶))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  {cpr 4586
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-v 3453  df-un 3904  df-sn 4585  df-pr 4587
This theorem is used by:  gpg5nbgrvtx03starlem1  49135  gpg5nbgrvtx03starlem2  49136  gpg5nbgrvtx03starlem3  49137  gpg5nbgrvtx13starlem1  49138  gpg5nbgrvtx13starlem2  49139  gpg5nbgrvtx13starlem3  49140  gpg5edgnedg  49197
  Copyright terms: Public domain W3C validator