| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > uniex2 | 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 4575 | . . 3 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) | |
| 2 | eluni 3933 | . . . . . 6 ⊢ (𝑧 ∈ ∪ 𝑥 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) | |
| 3 | 2 | bibi2i 227 | . . . . 5 ⊢ ((𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) ↔ (𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥))) |
| 4 | 3 | albii 1523 | . . . 4 ⊢ (∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) ↔ ∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥))) |
| 5 | 4 | exbii 1658 | . . 3 ⊢ (∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥))) |
| 6 | 1, 5 | mpbir 146 | . 2 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) |
| 7 | dfcleq 2232 | . . 3 ⊢ (𝑦 = ∪ 𝑥 ↔ ∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥)) | |
| 8 | 7 | biimpri 133 | . 2 ⊢ (∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) → 𝑦 = ∪ 𝑥) |
| 9 | 6, 8 | eximii 1655 | 1 ⊢ ∃𝑦 𝑦 = ∪ 𝑥 |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∀wal 1400 = wceq 1402 ∃wex 1545 ∈ wcel 2209 ∪ cuni 3930 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-un 4573 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-uni 3931 |
| This theorem is referenced by: uniex 4578 |
| Copyright terms: Public domain | W3C validator |