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

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

Proof of Theorem en3lplem1
StepHypRef Expression
1 simp3 1139 . . 3 ((𝐴𝐵𝐵𝐶𝐶𝐴) → 𝐶𝐴)
2 eleq2 2826 . . 3 (𝑥 = 𝐴 → (𝐶𝑥𝐶𝐴))
31, 2syl5ibrcom 247 . 2 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐴𝐶𝑥))
4 tpid3g 4731 . . . . 5 (𝐶𝐴𝐶 ∈ {𝐴, 𝐵, 𝐶})
543ad2ant3 1136 . . . 4 ((𝐴𝐵𝐵𝐶𝐶𝐴) → 𝐶 ∈ {𝐴, 𝐵, 𝐶})
6 inelcm 4419 . . . 4 ((𝐶𝑥𝐶 ∈ {𝐴, 𝐵, 𝐶}) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
75, 6sylan2 594 . . 3 ((𝐶𝑥 ∧ (𝐴𝐵𝐵𝐶𝐶𝐴)) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
87expcom 413 . 2 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝐶𝑥 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
93, 8syld 47 1 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐴 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1087   = wceq 1542  wcel 2114  wne 2933  cin 3902  c0 4287  {ctp 4586
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-nul 4288  df-sn 4583  df-pr 4585  df-tp 4587
This theorem is referenced by:  en3lplem2  9534
  Copyright terms: Public domain W3C validator