| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunsn | Structured version Visualization version GIF version | ||
| Description: Indexed union of a singleton. Compare dfiun2 4995 and rnmpt 5951. (Contributed by Steven Nguyen, 7-Jun-2023.) |
| Ref | Expression |
|---|---|
| iunsn | ⊢ ∪ 𝑥 ∈ 𝐴 {𝐵} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-iun 4958 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝐵} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝐵}} | |
| 2 | velsn 4600 | . . . 4 ⊢ (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵) | |
| 3 | 2 | rexbii 3113 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ {𝐵} ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵) |
| 4 | 3 | abbii 2830 | . 2 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝐵}} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| 5 | 1, 4 | eqtri 2786 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝐵} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 {cab 2741 ∃wrex 3090 {csn 4588 ∪ ciun 4956 |
| 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-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rex 3091 df-v 3456 df-sn 4589 df-iun 4958 |
| This theorem is used by: pzriprnglem11 21852 dfproplem 38909 dfqs3 43557 fsetabsnop 48393 |
| Copyright terms: Public domain | W3C validator |