| 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 4874 | . 2 ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)} | |
| 2 | exancom 1888 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝑦)) | |
| 3 | df-rex 3096 | . . . 4 ⊢ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝑦)) | |
| 4 | 2, 3 | bitr4i 281 | . . 3 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) |
| 5 | 4 | abbii 2836 | . 2 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)} = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
| 6 | 1, 5 | eqtri 2792 | 1 ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 = wceq 1567 ∃wex 1806 ∈ wcel 2149 {cab 2747 ∃wrex 3095 ∪ cuni 4873 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-rex 3096 df-uni 4874 |
| This theorem is referenced by: nfunid 4879 uniiun 5024 rncnvepres 38843 uniel 43829 onsupmaxb 43851 |
| Copyright terms: Public domain | W3C validator |