![]() |
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 4801 | . 2 ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)} | |
2 | exancom 1862 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝑦)) | |
3 | df-rex 3112 | . . . 4 ⊢ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝑦)) | |
4 | 2, 3 | bitr4i 281 | . . 3 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) |
5 | 4 | abbii 2863 | . 2 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)} = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
6 | 1, 5 | eqtri 2821 | 1 ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 399 = wceq 1538 ∃wex 1781 ∈ wcel 2111 {cab 2776 ∃wrex 3107 ∪ cuni 4800 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-rex 3112 df-uni 4801 |
This theorem is referenced by: nfunid 4806 unieqOLD 4812 uniiun 4945 rncnvepres 35721 |
Copyright terms: Public domain | W3C validator |