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

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

Proof of Theorem en3lplem1
StepHypRef Expression
1 simp3 1156 . . 3 ((𝐴𝐵𝐵𝐶𝐶𝐴) → 𝐶𝐴)
2 eleq2 2854 . . 3 (𝑥 = 𝐴 → (𝐶𝑥𝐶𝐴))
31, 2syl5ibrcom 250 . 2 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐴𝐶𝑥))
4 tpid3g 4740 . . . . 5 (𝐶𝐴𝐶 ∈ {𝐴, 𝐵, 𝐶})
543ad2ant3 1153 . . . 4 ((𝐴𝐵𝐵𝐶𝐶𝐴) → 𝐶 ∈ {𝐴, 𝐵, 𝐶})
6 inelcm 4425 . . . 4 ((𝐶𝑥𝐶 ∈ {𝐴, 𝐵, 𝐶}) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
75, 6sylan2 605 . . 3 ((𝐶𝑥 ∧ (𝐴𝐵𝐵𝐶𝐶𝐴)) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
87expcom 419 . 2 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝐶𝑥 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
93, 8syld 48 1 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐴 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  w3a 1103   = wceq 1570  wcel 2146  wne 2960  cin 3905  c0 4286  {ctp 4595
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 2148  ax-9 2156  ax-ext 2737
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 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-nul 4287  df-sn 4592  df-pr 4594  df-tp 4596
This theorem is used by:  en3lplem2  9589
  Copyright terms: Public domain W3C validator