| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unisn3 | Structured version Visualization version GIF version | ||
| Description: Union of a singleton in the form of a restricted class abstraction. (Contributed by NM, 3-Jul-2008.) |
| Ref | Expression |
|---|---|
| unisn3 | ⊢ (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rabsn 4692 | . . 3 ⊢ (𝐴 ∈ 𝐵 → {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = {𝐴}) | |
| 2 | 1 | unieqd 4889 | . 2 ⊢ (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = ∪ {𝐴}) |
| 3 | unisng 4894 | . 2 ⊢ (𝐴 ∈ 𝐵 → ∪ {𝐴} = 𝐴) | |
| 4 | 2, 3 | eqtrd 2804 | 1 ⊢ (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 {crab 3423 {csn 4594 ∪ cuni 4876 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-ex 1807 df-nf 1811 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rab 3424 df-v 3465 df-un 3918 df-ss 3930 df-sn 4595 df-pr 4597 df-uni 4877 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |