| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfuni2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of class union. (Contributed by NM, 28-Jun-1998.) |
| Ref | Expression |
|---|---|
| dfuni2 | ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-uni 4863 | . 2 ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)} | |
| 2 | exancom 1880 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝑦)) | |
| 3 | df-rex 3086 | . . . 4 ⊢ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝑦)) | |
| 4 | 2, 3 | bitr4i 280 | . . 3 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) |
| 5 | 4 | abbii 2828 | . 2 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)} = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
| 6 | 1, 5 | eqtri 2784 | 1 ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 399 = wceq 1559 ∃wex 1798 ∈ wcel 2141 {cab 2739 ∃wrex 3085 ∪ cuni 4862 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-rex 3086 df-uni 4863 |
| This theorem is referenced by: nfunid 4868 uniiun 5013 rncnvepres 38769 uniel 43755 onsupmaxb 43777 |
| Copyright terms: Public domain | W3C validator |