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

Theorem unisn3 4893
Description: Union of a singleton in the form of a restricted class abstraction. (Contributed by NM, 3-Jul-2008.)
Assertion
Ref Expression
unisn3 (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = 𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem unisn3
StepHypRef Expression
1 rabsn 4684 . . 3 (𝐴 ∈ 𝐵 → {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = {𝐴})
21unieqd 4885 . 2 (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = ∪ {𝐴})
3 unisng 4890 . 2 (𝐴 ∈ 𝐵 → ∪ {𝐴} = 𝐴)
42, 3eqtrd 2798 1 (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {crab 3416  {csn 4588  ∪ cuni 4872
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-pr 4591  df-uni 4873
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator