Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > iunid | GIF version |
Description: An indexed union of singletons recovers the index set. (Contributed by NM, 6-Sep-2005.) |
Ref | Expression |
---|---|
iunid | ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-sn 3381 | . . . . 5 ⊢ {𝑥} = {𝑦 ∣ 𝑦 = 𝑥} | |
2 | equcom 1593 | . . . . . 6 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦) | |
3 | 2 | abbii 2153 | . . . . 5 ⊢ {𝑦 ∣ 𝑦 = 𝑥} = {𝑦 ∣ 𝑥 = 𝑦} |
4 | 1, 3 | eqtri 2060 | . . . 4 ⊢ {𝑥} = {𝑦 ∣ 𝑥 = 𝑦} |
5 | 4 | a1i 9 | . . 3 ⊢ (𝑥 ∈ 𝐴 → {𝑥} = {𝑦 ∣ 𝑥 = 𝑦}) |
6 | 5 | iuneq2i 3675 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝑥 = 𝑦} |
7 | iunab 3703 | . . 3 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝑥 = 𝑦} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦} | |
8 | risset 2352 | . . . 4 ⊢ (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦) | |
9 | 8 | abbii 2153 | . . 3 ⊢ {𝑦 ∣ 𝑦 ∈ 𝐴} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦} |
10 | abid2 2158 | . . 3 ⊢ {𝑦 ∣ 𝑦 ∈ 𝐴} = 𝐴 | |
11 | 7, 9, 10 | 3eqtr2i 2066 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝑥 = 𝑦} = 𝐴 |
12 | 6, 11 | eqtri 2060 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 |
Colors of variables: wff set class |
Syntax hints: = wceq 1243 ∈ wcel 1393 {cab 2026 ∃wrex 2307 {csn 3375 ∪ ciun 3657 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-in 2924 df-ss 2931 df-sn 3381 df-iun 3659 |
This theorem is referenced by: iunxpconst 4400 xpexgALT 5760 uniqs 6164 |
Copyright terms: Public domain | W3C validator |