| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunab | Structured version Visualization version GIF version | ||
| Description: The indexed union of a class abstraction. (Contributed by NM, 27-Dec-2004.) |
| Ref | Expression |
|---|---|
| iunab | ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2764 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
| 2 | nfab1 2766 | . . . 4 ⊢ Ⅎ𝑦{𝑦 ∣ 𝜑} | |
| 3 | 1, 2 | nfiun 4548 | . . 3 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} |
| 4 | nfab1 2766 | . . 3 ⊢ Ⅎ𝑦{𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} | |
| 5 | 3, 4 | cleqf 2790 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} ↔ ∀𝑦(𝑦 ∈ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} ↔ 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑})) |
| 6 | abid 2610 | . . . 4 ⊢ (𝑦 ∈ {𝑦 ∣ 𝜑} ↔ 𝜑) | |
| 7 | 6 | rexbii 3041 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑦 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) |
| 8 | eliun 4524 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑦 ∣ 𝜑}) | |
| 9 | abid 2610 | . . 3 ⊢ (𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) | |
| 10 | 7, 8, 9 | 3bitr4i 292 | . 2 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} ↔ 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑}) |
| 11 | 5, 10 | mpgbir 1726 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 196 = wceq 1483 ∈ wcel 1990 {cab 2608 ∃wrex 2913 ∪ ciun 4520 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-v 3202 df-iun 4522 |
| This theorem is referenced by: iunrab 4567 iunid 4575 dfimafn2 6246 rabiun 33382 dfaimafn2 41246 rnfdmpr 41300 |
| Copyright terms: Public domain | W3C validator |