| 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 4958 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑥}} | |
| 2 | clel5 3624 | . . . 4 ⊢ (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝑥) | |
| 3 | velsn 4605 | . . . . 5 ⊢ (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥) | |
| 4 | 3 | rexbii 3112 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑥} ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝑥) |
| 5 | 2, 4 | bitr4i 281 | . . 3 ⊢ (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑥}) |
| 6 | 5 | eqabi 2898 | . 2 ⊢ 𝐴 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑥}} |
| 7 | 1, 6 | eqtr4i 2789 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 {cab 2741 ∃wrex 3089 {csn 4589 ∪ ciun 4956 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rex 3090 df-v 3457 df-sn 4590 df-iun 4958 |
| This theorem is referenced by: iunxpconst 5734 fvn0ssdmfun 7069 abnexg 7751 xpexgALT 7974 uniqs 8767 rankcf 10757 dprd2da 20109 t1ficld 23484 discmp 23555 xkoinjcn 23844 metnrmlem2 25018 ovoliunlem1 25661 i1fima 25837 i1fd 25840 itg1addlem5 25859 dmdju 32992 fnpreimac 33015 gsumpart 33383 elrspunidl 33736 sibfof 34730 bnj1415 35426 1enumen 35485 cvmlift2lem12 35806 poimirlem30 38321 itg2addnclem2 38343 ftc1anclem6 38369 salexct3 47076 salgensscntex 47078 ctvonmbl 47423 vonct 47427 |
| Copyright terms: Public domain | W3C validator |