| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunid | Structured version Visualization version GIF version | ||
| Description: An indexed union of singletons recovers the index set. (Contributed by NM, 6-Sep-2005.) (Proof shortened by SN, 15-Jan-2025.) |
| Ref | Expression |
|---|---|
| iunid | ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-iun 4962 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑥}} | |
| 2 | clel5 3633 | . . . 4 ⊢ (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝑥) | |
| 3 | velsn 4610 | . . . . 5 ⊢ (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥) | |
| 4 | 3 | rexbii 3118 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑥} ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝑥) |
| 5 | 2, 4 | bitr4i 281 | . . 3 ⊢ (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑥}) |
| 6 | 5 | eqabi 2904 | . 2 ⊢ 𝐴 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑥}} |
| 7 | 1, 6 | eqtr4i 2795 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1567 ∈ wcel 2149 {cab 2747 ∃wrex 3095 {csn 4594 ∪ ciun 4960 |
| 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-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rex 3096 df-v 3465 df-sn 4595 df-iun 4962 |
| This theorem is referenced by: iunxpconst 5735 fvn0ssdmfun 7070 abnexg 7755 xpexgALT 7978 uniqs 8771 rankcf 10762 dprd2da 20114 t1ficld 23453 discmp 23524 xkoinjcn 23813 metnrmlem2 24987 ovoliunlem1 25630 i1fima 25806 i1fd 25809 itg1addlem5 25828 dmdju 32933 fnpreimac 32956 gsumpart 33324 elrspunidl 33680 sibfof 34675 bnj1415 35371 1enumen 35428 cvmlift2lem12 35705 poimirlem30 38189 itg2addnclem2 38211 ftc1anclem6 38237 salexct3 46948 salgensscntex 46950 ctvonmbl 47295 vonct 47299 |
| Copyright terms: Public domain | W3C validator |