| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uniex2 | Structured version Visualization version GIF version | ||
| Description: The Axiom of Union using the standard abbreviation for union. Given any set 𝑥, its union 𝑦 exists. (Contributed by NM, 4-Jun-2006.) |
| Ref | Expression |
|---|---|
| uniex2 | ⊢ ∃𝑦 𝑦 = ∪ 𝑥 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-un 7722 | . . . 4 ⊢ ∃𝑦∀𝑧(∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → 𝑧 ∈ 𝑦) | |
| 2 | eluni 4871 | . . . . . . 7 ⊢ (𝑧 ∈ ∪ 𝑥 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) | |
| 3 | 2 | imbi1i 352 | . . . . . 6 ⊢ ((𝑧 ∈ ∪ 𝑥 → 𝑧 ∈ 𝑦) ↔ (∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → 𝑧 ∈ 𝑦)) |
| 4 | 3 | albii 1842 | . . . . 5 ⊢ (∀𝑧(𝑧 ∈ ∪ 𝑥 → 𝑧 ∈ 𝑦) ↔ ∀𝑧(∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → 𝑧 ∈ 𝑦)) |
| 5 | 4 | exbii 1871 | . . . 4 ⊢ (∃𝑦∀𝑧(𝑧 ∈ ∪ 𝑥 → 𝑧 ∈ 𝑦) ↔ ∃𝑦∀𝑧(∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → 𝑧 ∈ 𝑦)) |
| 6 | 1, 5 | mpbir 234 | . . 3 ⊢ ∃𝑦∀𝑧(𝑧 ∈ ∪ 𝑥 → 𝑧 ∈ 𝑦) |
| 7 | 6 | sepexi 5256 | . 2 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) |
| 8 | dfcleq 2758 | . . 3 ⊢ (𝑦 = ∪ 𝑥 ↔ ∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥)) | |
| 9 | 8 | exbii 1871 | . 2 ⊢ (∃𝑦 𝑦 = ∪ 𝑥 ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥)) |
| 10 | 7, 9 | mpbir 234 | 1 ⊢ ∃𝑦 𝑦 = ∪ 𝑥 |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1561 = wceq 1563 ∃wex 1802 ∈ wcel 2145 ∪ cuni 4868 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5251 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1566 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-uni 4869 |
| This theorem is referenced by: vuniex 7726 |
| Copyright terms: Public domain | W3C validator |