![]() |
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 5056 and rnmpt 5982. (Contributed by Steven Nguyen, 7-Jun-2023.) |
Ref | Expression |
---|---|
iunsn | ⊢ ∪ 𝑥 ∈ 𝐴 {𝐵} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-iun 5017 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝐵} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝐵}} | |
2 | velsn 4664 | . . . 4 ⊢ (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵) | |
3 | 2 | rexbii 3100 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ {𝐵} ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵) |
4 | 3 | abbii 2812 | . 2 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝐵}} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
5 | 1, 4 | eqtri 2768 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝐵} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2108 {cab 2717 ∃wrex 3076 {csn 4648 ∪ ciun 5015 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-rex 3077 df-v 3490 df-sn 4649 df-iun 5017 |
This theorem is referenced by: pzriprnglem11 21527 dfqs3 42235 fsetabsnop 46967 |
Copyright terms: Public domain | W3C validator |