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

Theorem preleqg 9303
Description: Equality of two unordered pairs when one member of each pair contains the other member. Closed form of preleq 9304. (Contributed by AV, 15-Jun-2022.)
Assertion
Ref Expression
preleqg (((𝐴𝐵𝐵𝑉𝐶𝐷) ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → (𝐴 = 𝐶𝐵 = 𝐷))

Proof of Theorem preleqg
StepHypRef Expression
1 elneq 9287 . . . . 5 (𝐴𝐵𝐴𝐵)
213ad2ant1 1131 . . . 4 ((𝐴𝐵𝐵𝑉𝐶𝐷) → 𝐴𝐵)
3 preq12nebg 4790 . . . 4 ((𝐴𝐵𝐵𝑉𝐴𝐵) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶))))
42, 3syld3an3 1407 . . 3 ((𝐴𝐵𝐵𝑉𝐶𝐷) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶))))
5 eleq12 2828 . . . . . . . . . 10 ((𝐴 = 𝐷𝐵 = 𝐶) → (𝐴𝐵𝐷𝐶))
6 elnotel 9298 . . . . . . . . . . 11 (𝐷𝐶 → ¬ 𝐶𝐷)
76pm2.21d 121 . . . . . . . . . 10 (𝐷𝐶 → (𝐶𝐷 → (𝐴 = 𝐶𝐵 = 𝐷)))
85, 7syl6bi 252 . . . . . . . . 9 ((𝐴 = 𝐷𝐵 = 𝐶) → (𝐴𝐵 → (𝐶𝐷 → (𝐴 = 𝐶𝐵 = 𝐷))))
98com3l 89 . . . . . . . 8 (𝐴𝐵 → (𝐶𝐷 → ((𝐴 = 𝐷𝐵 = 𝐶) → (𝐴 = 𝐶𝐵 = 𝐷))))
109a1d 25 . . . . . . 7 (𝐴𝐵 → (𝐵𝑉 → (𝐶𝐷 → ((𝐴 = 𝐷𝐵 = 𝐶) → (𝐴 = 𝐶𝐵 = 𝐷)))))
11103imp 1109 . . . . . 6 ((𝐴𝐵𝐵𝑉𝐶𝐷) → ((𝐴 = 𝐷𝐵 = 𝐶) → (𝐴 = 𝐶𝐵 = 𝐷)))
1211com12 32 . . . . 5 ((𝐴 = 𝐷𝐵 = 𝐶) → ((𝐴𝐵𝐵𝑉𝐶𝐷) → (𝐴 = 𝐶𝐵 = 𝐷)))
1312jao1i 854 . . . 4 (((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶)) → ((𝐴𝐵𝐵𝑉𝐶𝐷) → (𝐴 = 𝐶𝐵 = 𝐷)))
1413com12 32 . . 3 ((𝐴𝐵𝐵𝑉𝐶𝐷) → (((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶)) → (𝐴 = 𝐶𝐵 = 𝐷)))
154, 14sylbid 239 . 2 ((𝐴𝐵𝐵𝑉𝐶𝐷) → ({𝐴, 𝐵} = {𝐶, 𝐷} → (𝐴 = 𝐶𝐵 = 𝐷)))
1615imp 406 1 (((𝐴𝐵𝐵𝑉𝐶𝐷) ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  wo 843  w3a 1085   = wceq 1539  wcel 2108  wne 2942  {cpr 4560
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-reg 9281
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-eprel 5486  df-fr 5535
This theorem is referenced by:  preleq  9304
  Copyright terms: Public domain W3C validator