| 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 2898 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
| 2 | nfab1 2900 | . . . 4 ⊢ Ⅎ𝑦{𝑦 ∣ 𝜑} | |
| 3 | 1, 2 | nfiun 4999 | . . 3 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} |
| 4 | nfab1 2900 | . . 3 ⊢ Ⅎ𝑦{𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} | |
| 5 | 3, 4 | cleqf 2927 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} ↔ ∀𝑦(𝑦 ∈ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} ↔ 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑})) |
| 6 | abid 2717 | . . . 4 ⊢ (𝑦 ∈ {𝑦 ∣ 𝜑} ↔ 𝜑) | |
| 7 | 6 | rexbii 3083 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑦 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) |
| 8 | eliun 4971 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑦 ∣ 𝜑}) | |
| 9 | abid 2717 | . . 3 ⊢ (𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) | |
| 10 | 7, 8, 9 | 3bitr4i 303 | . 2 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} ↔ 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑}) |
| 11 | 5, 10 | mpgbir 1799 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1540 ∈ wcel 2108 {cab 2713 ∃wrex 3060 ∪ ciun 4967 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-ex 1780 df-nf 1784 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ral 3052 df-rex 3061 df-v 3461 df-iun 4969 |
| This theorem is referenced by: iunrab 5028 iunidOLD 5037 dfimafn2 6942 pzriprnglem10 21451 pzriprnglem11 21452 rabiun 37617 dfaimafn2 47195 rnfdmpr 47310 |
| Copyright terms: Public domain | W3C validator |