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

Theorem 3elpr2eq 4843
Description: If there are three elements in a proper unordered pair, and two of them are different from the third one, the two must be equal. (Contributed by AV, 19-Dec-2021.)
Assertion
Ref Expression
3elpr2eq (((𝑋 ∈ {𝐴, 𝐵} ∧ 𝑌 ∈ {𝐴, 𝐵} ∧ 𝑍 ∈ {𝐴, 𝐵}) ∧ (𝑌𝑋𝑍𝑋)) → 𝑌 = 𝑍)

Proof of Theorem 3elpr2eq
StepHypRef Expression
1 elpri 4588 . . 3 (𝑋 ∈ {𝐴, 𝐵} → (𝑋 = 𝐴𝑋 = 𝐵))
2 elpri 4588 . . 3 (𝑌 ∈ {𝐴, 𝐵} → (𝑌 = 𝐴𝑌 = 𝐵))
3 elpri 4588 . . 3 (𝑍 ∈ {𝐴, 𝐵} → (𝑍 = 𝐴𝑍 = 𝐵))
4 eqtr3 2765 . . . . . . . . . . 11 ((𝑍 = 𝐴𝑋 = 𝐴) → 𝑍 = 𝑋)
5 eqneqall 2955 . . . . . . . . . . 11 (𝑍 = 𝑋 → (𝑍𝑋𝑌 = 𝑍))
64, 5syl 17 . . . . . . . . . 10 ((𝑍 = 𝐴𝑋 = 𝐴) → (𝑍𝑋𝑌 = 𝑍))
76adantld 490 . . . . . . . . 9 ((𝑍 = 𝐴𝑋 = 𝐴) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))
87ex 412 . . . . . . . 8 (𝑍 = 𝐴 → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍)))
98a1d 25 . . . . . . 7 (𝑍 = 𝐴 → ((𝑌 = 𝐴𝑌 = 𝐵) → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
10 eqtr3 2765 . . . . . . . . . . . . 13 ((𝑌 = 𝐴𝑋 = 𝐴) → 𝑌 = 𝑋)
11 eqneqall 2955 . . . . . . . . . . . . 13 (𝑌 = 𝑋 → (𝑌𝑋 → (𝑍𝑋𝑌 = 𝑍)))
1210, 11syl 17 . . . . . . . . . . . 12 ((𝑌 = 𝐴𝑋 = 𝐴) → (𝑌𝑋 → (𝑍𝑋𝑌 = 𝑍)))
1312impd 410 . . . . . . . . . . 11 ((𝑌 = 𝐴𝑋 = 𝐴) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))
1413ex 412 . . . . . . . . . 10 (𝑌 = 𝐴 → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍)))
1514a1d 25 . . . . . . . . 9 (𝑌 = 𝐴 → (𝑍 = 𝐵 → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
16 eqtr3 2765 . . . . . . . . . . 11 ((𝑌 = 𝐵𝑍 = 𝐵) → 𝑌 = 𝑍)
17162a1d 26 . . . . . . . . . 10 ((𝑌 = 𝐵𝑍 = 𝐵) → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍)))
1817ex 412 . . . . . . . . 9 (𝑌 = 𝐵 → (𝑍 = 𝐵 → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
1915, 18jaoi 853 . . . . . . . 8 ((𝑌 = 𝐴𝑌 = 𝐵) → (𝑍 = 𝐵 → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
2019com12 32 . . . . . . 7 (𝑍 = 𝐵 → ((𝑌 = 𝐴𝑌 = 𝐵) → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
219, 20jaoi 853 . . . . . 6 ((𝑍 = 𝐴𝑍 = 𝐵) → ((𝑌 = 𝐴𝑌 = 𝐵) → (𝑋 = 𝐴 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
2221com13 88 . . . . 5 (𝑋 = 𝐴 → ((𝑌 = 𝐴𝑌 = 𝐵) → ((𝑍 = 𝐴𝑍 = 𝐵) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
23 eqtr3 2765 . . . . . . . . . . 11 ((𝑌 = 𝐴𝑍 = 𝐴) → 𝑌 = 𝑍)
24232a1d 26 . . . . . . . . . 10 ((𝑌 = 𝐴𝑍 = 𝐴) → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍)))
2524ex 412 . . . . . . . . 9 (𝑌 = 𝐴 → (𝑍 = 𝐴 → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
26 eqtr3 2765 . . . . . . . . . . . . 13 ((𝑌 = 𝐵𝑋 = 𝐵) → 𝑌 = 𝑋)
2726, 11syl 17 . . . . . . . . . . . 12 ((𝑌 = 𝐵𝑋 = 𝐵) → (𝑌𝑋 → (𝑍𝑋𝑌 = 𝑍)))
2827impd 410 . . . . . . . . . . 11 ((𝑌 = 𝐵𝑋 = 𝐵) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))
2928ex 412 . . . . . . . . . 10 (𝑌 = 𝐵 → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍)))
3029a1d 25 . . . . . . . . 9 (𝑌 = 𝐵 → (𝑍 = 𝐴 → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
3125, 30jaoi 853 . . . . . . . 8 ((𝑌 = 𝐴𝑌 = 𝐵) → (𝑍 = 𝐴 → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
3231com12 32 . . . . . . 7 (𝑍 = 𝐴 → ((𝑌 = 𝐴𝑌 = 𝐵) → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
33 eqtr3 2765 . . . . . . . . . . 11 ((𝑍 = 𝐵𝑋 = 𝐵) → 𝑍 = 𝑋)
3433, 5syl 17 . . . . . . . . . 10 ((𝑍 = 𝐵𝑋 = 𝐵) → (𝑍𝑋𝑌 = 𝑍))
3534adantld 490 . . . . . . . . 9 ((𝑍 = 𝐵𝑋 = 𝐵) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))
3635ex 412 . . . . . . . 8 (𝑍 = 𝐵 → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍)))
3736a1d 25 . . . . . . 7 (𝑍 = 𝐵 → ((𝑌 = 𝐴𝑌 = 𝐵) → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
3832, 37jaoi 853 . . . . . 6 ((𝑍 = 𝐴𝑍 = 𝐵) → ((𝑌 = 𝐴𝑌 = 𝐵) → (𝑋 = 𝐵 → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
3938com13 88 . . . . 5 (𝑋 = 𝐵 → ((𝑌 = 𝐴𝑌 = 𝐵) → ((𝑍 = 𝐴𝑍 = 𝐵) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
4022, 39jaoi 853 . . . 4 ((𝑋 = 𝐴𝑋 = 𝐵) → ((𝑌 = 𝐴𝑌 = 𝐵) → ((𝑍 = 𝐴𝑍 = 𝐵) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))))
41403imp 1109 . . 3 (((𝑋 = 𝐴𝑋 = 𝐵) ∧ (𝑌 = 𝐴𝑌 = 𝐵) ∧ (𝑍 = 𝐴𝑍 = 𝐵)) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))
421, 2, 3, 41syl3an 1158 . 2 ((𝑋 ∈ {𝐴, 𝐵} ∧ 𝑌 ∈ {𝐴, 𝐵} ∧ 𝑍 ∈ {𝐴, 𝐵}) → ((𝑌𝑋𝑍𝑋) → 𝑌 = 𝑍))
4342imp 406 1 (((𝑋 ∈ {𝐴, 𝐵} ∧ 𝑌 ∈ {𝐴, 𝐵} ∧ 𝑍 ∈ {𝐴, 𝐵}) ∧ (𝑌𝑋𝑍𝑋)) → 𝑌 = 𝑍)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 843  w3a 1085   = wceq 1541  wcel 2109  wne 2944  {cpr 4568
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-ext 2710
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-ex 1786  df-sb 2071  df-clab 2717  df-cleq 2731  df-clel 2817  df-ne 2945  df-v 3432  df-un 3896  df-sn 4567  df-pr 4569
This theorem is referenced by:  numedglnl  27495
  Copyright terms: Public domain W3C validator