| 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.) (Proof shortened by BJ, 14-Jul-2026.) |
| Ref | Expression |
|---|---|
| uniex2 | ⊢ ∃𝑦 𝑦 = ∪ 𝑥 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axun2 7736 | . . 3 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) | |
| 2 | eluni 4876 | . . . . . 6 ⊢ (𝑧 ∈ ∪ 𝑥 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) | |
| 3 | 2 | bibi2i 340 | . . . . 5 ⊢ ((𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) ↔ (𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥))) |
| 4 | 3 | albii 1849 | . . . 4 ⊢ (∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) ↔ ∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥))) |
| 5 | 4 | exbii 1878 | . . 3 ⊢ (∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥))) |
| 6 | 1, 5 | mpbir 234 | . 2 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) |
| 7 | dfcleq 2756 | . . 3 ⊢ (𝑦 = ∪ 𝑥 ↔ ∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥)) | |
| 8 | 7 | biimpri 231 | . 2 ⊢ (∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) → 𝑦 = ∪ 𝑥) |
| 9 | 6, 8 | eximii 1867 | 1 ⊢ ∃𝑦 𝑦 = ∪ 𝑥 |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∀wal 1568 = wceq 1570 ∃wex 1809 ∈ wcel 2143 ∪ cuni 4873 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-v 3457 df-uni 4874 |
| This theorem is referenced by: vuniex 7739 |
| Copyright terms: Public domain | W3C validator |