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

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

Proof of Theorem en3lplem2
StepHypRef Expression
1 en3lplem1 9613 . . . . 5 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 = 𝐴 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
2 en3lplem1 9613 . . . . . . . 8 ((𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝑥 = 𝐵 → (𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅))
323comr 1143 . . . . . . 7 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 = 𝐵 → (𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅))
43a1d 26 . . . . . 6 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐵 → (𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅)))
5 tprot 4710 . . . . . . . . 9 {𝐴, 𝐵, 𝐶} = {𝐵, 𝐶, 𝐴}
65ineq2i 4163 . . . . . . . 8 (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = (𝑥 ∩ {𝐵, 𝐶, 𝐴})
76neeq1i 3020 . . . . . . 7 ((𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅ ↔ (𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅)
87bicomi 227 . . . . . 6 ((𝑥 ∩ {𝐵, 𝐶, 𝐴}) ≠ ∅ ↔ (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
94, 8syl8ib 259 . . . . 5 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐵 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)))
10 jao 975 . . . . 5 ((𝑥 = 𝐴 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅) → ((𝑥 = 𝐵 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅) → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)))
111, 9, 10sylsyld 62 . . . 4 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)))
1211imp 412 . . 3 (((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) ∧ 𝑥 ∈ {𝐴, 𝐵, 𝐶}) → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
13 en3lplem1 9613 . . . . . . 7 ((𝐶 ∈ 𝐴 ∧ 𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶) → (𝑥 = 𝐶 → (𝑥 ∩ {𝐶, 𝐴, 𝐵}) ≠ ∅))
14133coml 1145 . . . . . 6 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 = 𝐶 → (𝑥 ∩ {𝐶, 𝐴, 𝐵}) ≠ ∅))
1514a1d 26 . . . . 5 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐶 → (𝑥 ∩ {𝐶, 𝐴, 𝐵}) ≠ ∅)))
16 tprot 4710 . . . . . . 7 {𝐶, 𝐴, 𝐵} = {𝐴, 𝐵, 𝐶}
1716ineq2i 4163 . . . . . 6 (𝑥 ∩ {𝐶, 𝐴, 𝐵}) = (𝑥 ∩ {𝐴, 𝐵, 𝐶})
1817neeq1i 3020 . . . . 5 ((𝑥 ∩ {𝐶, 𝐴, 𝐵}) ≠ ∅ ↔ (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
1915, 18syl8ib 259 . . . 4 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐶 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)))
2019imp 412 . . 3 (((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) ∧ 𝑥 ∈ {𝐴, 𝐵, 𝐶}) → (𝑥 = 𝐶 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
21 idd 25 . . . . . . 7 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → 𝑥 ∈ {𝐴, 𝐵, 𝐶}))
22 dftp2 4652 . . . . . . . 8 {𝐴, 𝐵, 𝐶} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)}
2322eleq2i 2853 . . . . . . 7 (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)})
2421, 23imbitrdi 254 . . . . . 6 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → 𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)}))
25 abid 2743 . . . . . 6 (𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶))
2624, 25imbitrdi 254 . . . . 5 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)))
27 df-3or 1104 . . . . 5 ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶) ↔ ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∨ 𝑥 = 𝐶))
2826, 27imbitrdi 254 . . . 4 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∨ 𝑥 = 𝐶)))
2928imp 412 . . 3 (((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) ∧ 𝑥 ∈ {𝐴, 𝐵, 𝐶}) → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∨ 𝑥 = 𝐶))
3012, 20, 29mpjaod 874 . 2 (((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) ∧ 𝑥 ∈ {𝐴, 𝐵, 𝐶}) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
3130ex 418 1 ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   ∨ w3o 1102   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2739   ≠ wne 2956   ∩ cin 3898  ∅c0 4279  {ctp 4588
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-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-nul 4280  df-sn 4585  df-pr 4587  df-tp 4589
This theorem is used by:  en3lp  9615
  Copyright terms: Public domain W3C validator