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

Theorem enp1ilem 9178
Description: Lemma for uses of enp1i 9179. (Contributed by Mario Carneiro, 5-Jan-2016.)
Hypothesis
Ref Expression
enp1ilem.1 𝑇 = ({𝑥} ∪ 𝑆)
Assertion
Ref Expression
enp1ilem (𝑥𝐴 → ((𝐴 ∖ {𝑥}) = 𝑆𝐴 = 𝑇))

Proof of Theorem enp1ilem
StepHypRef Expression
1 uneq1 4113 . . 3 ((𝐴 ∖ {𝑥}) = 𝑆 → ((𝐴 ∖ {𝑥}) ∪ {𝑥}) = (𝑆 ∪ {𝑥}))
2 undif1 4428 . . 3 ((𝐴 ∖ {𝑥}) ∪ {𝑥}) = (𝐴 ∪ {𝑥})
3 uncom 4110 . . . 4 (𝑆 ∪ {𝑥}) = ({𝑥} ∪ 𝑆)
4 enp1ilem.1 . . . 4 𝑇 = ({𝑥} ∪ 𝑆)
53, 4eqtr4i 2762 . . 3 (𝑆 ∪ {𝑥}) = 𝑇
61, 2, 53eqtr3g 2794 . 2 ((𝐴 ∖ {𝑥}) = 𝑆 → (𝐴 ∪ {𝑥}) = 𝑇)
7 snssi 4764 . . . 4 (𝑥𝐴 → {𝑥} ⊆ 𝐴)
8 ssequn2 4141 . . . 4 ({𝑥} ⊆ 𝐴 ↔ (𝐴 ∪ {𝑥}) = 𝐴)
97, 8sylib 218 . . 3 (𝑥𝐴 → (𝐴 ∪ {𝑥}) = 𝐴)
109eqeq1d 2738 . 2 (𝑥𝐴 → ((𝐴 ∪ {𝑥}) = 𝑇𝐴 = 𝑇))
116, 10imbitrid 244 1 (𝑥𝐴 → ((𝐴 ∖ {𝑥}) = 𝑆𝐴 = 𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  cdif 3898  cun 3899  wss 3901  {csn 4580
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-sn 4581
This theorem is referenced by:  en2  9180  en3  9181  en4  9182
  Copyright terms: Public domain W3C validator