Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iunopab | Structured version Visualization version GIF version |
Description: Move indexed union inside an ordered-pair abstraction. (Contributed by Stefan O'Rear, 20-Feb-2015.) |
Ref | Expression |
---|---|
iunopab | ⊢ ∪ 𝑧 ∈ 𝐴 {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑦〉 ∣ ∃𝑧 ∈ 𝐴 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elopab 5417 | . . . . 5 ⊢ (𝑤 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
2 | 1 | rexbii 3250 | . . . 4 ⊢ (∃𝑧 ∈ 𝐴 𝑤 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑧 ∈ 𝐴 ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)) |
3 | rexcom4 3252 | . . . . 5 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑧 ∈ 𝐴 ∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
4 | rexcom4 3252 | . . . . . . 7 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑧 ∈ 𝐴 (𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
5 | r19.42v 3353 | . . . . . . . 8 ⊢ (∃𝑧 ∈ 𝐴 (𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝑤 = 〈𝑥, 𝑦〉 ∧ ∃𝑧 ∈ 𝐴 𝜑)) | |
6 | 5 | exbii 1847 | . . . . . . 7 ⊢ (∃𝑦∃𝑧 ∈ 𝐴 (𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ ∃𝑧 ∈ 𝐴 𝜑)) |
7 | 4, 6 | bitri 277 | . . . . . 6 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ ∃𝑧 ∈ 𝐴 𝜑)) |
8 | 7 | exbii 1847 | . . . . 5 ⊢ (∃𝑥∃𝑧 ∈ 𝐴 ∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ ∃𝑧 ∈ 𝐴 𝜑)) |
9 | 3, 8 | bitri 277 | . . . 4 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ ∃𝑧 ∈ 𝐴 𝜑)) |
10 | 2, 9 | bitri 277 | . . 3 ⊢ (∃𝑧 ∈ 𝐴 𝑤 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ ∃𝑧 ∈ 𝐴 𝜑)) |
11 | 10 | abbii 2889 | . 2 ⊢ {𝑤 ∣ ∃𝑧 ∈ 𝐴 𝑤 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑}} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ ∃𝑧 ∈ 𝐴 𝜑)} |
12 | df-iun 4924 | . 2 ⊢ ∪ 𝑧 ∈ 𝐴 {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑧 ∈ 𝐴 𝑤 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑}} | |
13 | df-opab 5132 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ ∃𝑧 ∈ 𝐴 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ ∃𝑧 ∈ 𝐴 𝜑)} | |
14 | 11, 12, 13 | 3eqtr4i 2857 | 1 ⊢ ∪ 𝑧 ∈ 𝐴 {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑦〉 ∣ ∃𝑧 ∈ 𝐴 𝜑} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 = wceq 1536 ∃wex 1779 ∈ wcel 2113 {cab 2802 ∃wrex 3142 〈cop 4576 ∪ ciun 4922 {copab 5131 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-rex 3147 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-iun 4924 df-opab 5132 |
This theorem is referenced by: marypha2lem2 8903 |
Copyright terms: Public domain | W3C validator |