| 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 2901 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 2 | nfab1 2903 | . . 3 ⊢ Ⅎ𝑦{𝑦 ∣ 𝜑} | |
| 3 | 1, 2 | nfiun 4954 | . 2 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} |
| 4 | nfab1 2903 | . 2 ⊢ Ⅎ𝑦{𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} | |
| 5 | abid 2721 | . . . 4 ⊢ (𝑦 ∈ {𝑦 ∣ 𝜑} ↔ 𝜑) | |
| 6 | 5 | rexbii 3086 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑦 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) |
| 7 | eliun 4926 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ {𝑦 ∣ 𝜑}) | |
| 8 | abid 2721 | . . 3 ⊢ (𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) | |
| 9 | 6, 7, 8 | 3bitr4i 304 | . 2 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} ↔ 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑}) |
| 10 | 3, 4, 9 | eqri 3935 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝜑} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝜑} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ∈ wcel 2119 {cab 2717 ∃wrex 3063 ∪ ciun 4922 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-tru 1550 df-ex 1787 df-nf 1791 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ral 3054 df-rex 3064 df-v 3433 df-iun 4924 |
| This theorem is referenced by: iunrab 4983 dfimafn2 6891 pzriprnglem10 21466 pzriprnglem11 21467 rabiun 37969 dfaimafn2 47637 rnfdmpr 47752 |
| Copyright terms: Public domain | W3C validator |