![]() |
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 4908 | . 2 ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)} | |
2 | exancom 1862 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝑦)) | |
3 | df-rex 3069 | . . . 4 ⊢ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝑦)) | |
4 | 2, 3 | bitr4i 277 | . . 3 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) |
5 | 4 | abbii 2800 | . 2 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)} = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
6 | 1, 5 | eqtri 2758 | 1 ⊢ ∪ 𝐴 = {𝑥 ∣ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 394 = wceq 1539 ∃wex 1779 ∈ wcel 2104 {cab 2707 ∃wrex 3068 ∪ cuni 4907 |
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 1911 ax-6 1969 ax-7 2009 ax-9 2114 ax-ext 2701 |
This theorem depends on definitions: df-bi 206 df-an 395 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2722 df-rex 3069 df-uni 4908 |
This theorem is referenced by: nfunid 4913 unieqOLD 4919 uniiun 5060 rncnvepres 37475 uniel 42268 onsupmaxb 42290 |
Copyright terms: Public domain | W3C validator |