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

Theorem en3lplem2 8755
Description: Lemma for en3lp 8756. (Contributed by Alan Sare, 28-Oct-2011.)
Assertion
Ref Expression
en3lplem2 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem en3lplem2
StepHypRef Expression
1 en3lplem1 8754 . . . . 5 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐴 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
2 en3lplem1 8754 . . . . . . . 8 ((𝐵𝐶𝐶𝐴𝐴𝐵) → (𝑥 = 𝐵 → (𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅))
323comr 1148 . . . . . . 7 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐵 → (𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅))
43a1d 25 . . . . . 6 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐵 → (𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅)))
5 tprot 4475 . . . . . . . . 9 {𝐴, 𝐵, 𝐶} = {𝐵, 𝐶, 𝐴}
65ineq2i 4010 . . . . . . . 8 (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = (𝑥 ∩ {𝐵, 𝐶, 𝐴})
76neeq1i 3042 . . . . . . 7 ((𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅ ↔ (𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅)
87bicomi 215 . . . . . 6 ((𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅ ↔ (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
94, 8syl8ib 247 . . . . 5 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐵 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)))
10 jao 974 . . . . 5 ((𝑥 = 𝐴 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅) → ((𝑥 = 𝐵 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅) → ((𝑥 = 𝐴𝑥 = 𝐵) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)))
111, 9, 10sylsyld 61 . . . 4 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝑥 = 𝐴𝑥 = 𝐵) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)))
1211imp 395 . . 3 (((𝐴𝐵𝐵𝐶𝐶𝐴) ∧ 𝑥 ∈ {𝐴, 𝐵, 𝐶}) → ((𝑥 = 𝐴𝑥 = 𝐵) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
13 en3lplem1 8754 . . . . . . 7 ((𝐶𝐴𝐴𝐵𝐵𝐶) → (𝑥 = 𝐶 → (𝑥 ∩ {𝐶, 𝐴, 𝐵}) ≠ ∅))
14133coml 1150 . . . . . 6 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐶 → (𝑥 ∩ {𝐶, 𝐴, 𝐵}) ≠ ∅))
1514a1d 25 . . . . 5 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐶 → (𝑥 ∩ {𝐶, 𝐴, 𝐵}) ≠ ∅)))
16 tprot 4475 . . . . . . 7 {𝐶, 𝐴, 𝐵} = {𝐴, 𝐵, 𝐶}
1716ineq2i 4010 . . . . . 6 (𝑥 ∩ {𝐶, 𝐴, 𝐵}) = (𝑥 ∩ {𝐴, 𝐵, 𝐶})
1817neeq1i 3042 . . . . 5 ((𝑥 ∩ {𝐶, 𝐴, 𝐵}) ≠ ∅ ↔ (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
1915, 18syl8ib 247 . . . 4 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐶 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)))
2019imp 395 . . 3 (((𝐴𝐵𝐵𝐶𝐶𝐴) ∧ 𝑥 ∈ {𝐴, 𝐵, 𝐶}) → (𝑥 = 𝐶 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
21 idd 24 . . . . . . 7 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → 𝑥 ∈ {𝐴, 𝐵, 𝐶}))
22 dftp2 4423 . . . . . . . 8 {𝐴, 𝐵, 𝐶} = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵𝑥 = 𝐶)}
2322eleq2i 2877 . . . . . . 7 (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵𝑥 = 𝐶)})
2421, 23syl6ib 242 . . . . . 6 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → 𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵𝑥 = 𝐶)}))
25 abid 2794 . . . . . 6 (𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵𝑥 = 𝐶)} ↔ (𝑥 = 𝐴𝑥 = 𝐵𝑥 = 𝐶))
2624, 25syl6ib 242 . . . . 5 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐴𝑥 = 𝐵𝑥 = 𝐶)))
27 df-3or 1101 . . . . 5 ((𝑥 = 𝐴𝑥 = 𝐵𝑥 = 𝐶) ↔ ((𝑥 = 𝐴𝑥 = 𝐵) ∨ 𝑥 = 𝐶))
2826, 27syl6ib 242 . . . 4 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝑥 = 𝐴𝑥 = 𝐵) ∨ 𝑥 = 𝐶)))
2928imp 395 . . 3 (((𝐴𝐵𝐵𝐶𝐶𝐴) ∧ 𝑥 ∈ {𝐴, 𝐵, 𝐶}) → ((𝑥 = 𝐴𝑥 = 𝐵) ∨ 𝑥 = 𝐶))
3012, 20, 29mpjaod 878 . 2 (((𝐴𝐵𝐵𝐶𝐶𝐴) ∧ 𝑥 ∈ {𝐴, 𝐵, 𝐶}) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
3130ex 399 1 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wo 865  w3o 1099  w3a 1100   = wceq 1637  wcel 2156  {cab 2792  wne 2978  cin 3768  c0 4116  {ctp 4374
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2068  ax-7 2104  ax-9 2165  ax-10 2185  ax-11 2201  ax-12 2214  ax-13 2420  ax-ext 2784
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3or 1101  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2061  df-clab 2793  df-cleq 2799  df-clel 2802  df-nfc 2937  df-ne 2979  df-v 3393  df-dif 3772  df-un 3774  df-in 3776  df-nul 4117  df-sn 4371  df-pr 4373  df-tp 4375
This theorem is referenced by:  en3lp  8756
  Copyright terms: Public domain W3C validator