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

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

Proof of Theorem en3lplem1
StepHypRef Expression
1 simp3 1151 . . 3 ((𝐴𝐵𝐵𝐶𝐶𝐴) → 𝐶𝐴)
2 eleq2 2851 . . 3 (𝑥 = 𝐴 → (𝐶𝑥𝐶𝐴))
31, 2syl5ibrcom 249 . 2 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐴𝐶𝑥))
4 tpid3g 4731 . . . . 5 (𝐶𝐴𝐶 ∈ {𝐴, 𝐵, 𝐶})
543ad2ant3 1148 . . . 4 ((𝐴𝐵𝐵𝐶𝐶𝐴) → 𝐶 ∈ {𝐴, 𝐵, 𝐶})
6 inelcm 4419 . . . 4 ((𝐶𝑥𝐶 ∈ {𝐴, 𝐵, 𝐶}) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
75, 6sylan2 602 . . 3 ((𝐶𝑥 ∧ (𝐴𝐵𝐵𝐶𝐶𝐴)) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)
87expcom 417 . 2 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝐶𝑥 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
93, 8syld 47 1 ((𝐴𝐵𝐵𝐶𝐶𝐴) → (𝑥 = 𝐴 → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1098   = wceq 1560  wcel 2142  wne 2957  cin 3903  c0 4285  {ctp 4586
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-nul 4286  df-sn 4583  df-pr 4585  df-tp 4587
This theorem is referenced by:  en3lplem2  9568
  Copyright terms: Public domain W3C validator