| 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 4666 | . . 3 ⊢ (𝐴 ∈ 𝐵 → {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = {𝐴}) | |
| 2 | 1 | unieqd 4864 | . 2 ⊢ (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = ∪ {𝐴}) |
| 3 | unisng 4869 | . 2 ⊢ (𝐴 ∈ 𝐵 → ∪ {𝐴} = 𝐴) | |
| 4 | 2, 3 | eqtrd 2772 | 1 ⊢ (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 = 𝐴} = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {crab 3390 {csn 4568 ∪ cuni 4851 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-un 3895 df-ss 3907 df-sn 4569 df-pr 4571 df-uni 4852 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |