| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: The Axiom of Union using the standard abbreviation for union. Given any set x, its union y exists. |
| Ref | Expression |
|---|---|
| uniex2 | ⊢ ∃y y = ∪x |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axun 2873 | . . . 4 ⊢ ∃y∀z(∃y(z ∈ y ⋀ y ∈ x) → z ∈ y) | |
| 2 | eluni 2510 | . . . . . . 7 ⊢ (z ∈ ∪x ↔ ∃y(z ∈ y ⋀ y ∈ x)) | |
| 3 | 2 | imbi1i 186 | . . . . . 6 ⊢ ((z ∈ ∪x → z ∈ y) ↔ (∃y(z ∈ y ⋀ y ∈ x) → z ∈ y)) |
| 4 | 3 | albii 1001 | . . . . 5 ⊢ (∀z(z ∈ ∪x → z ∈ y) ↔ ∀z(∃y(z ∈ y ⋀ y ∈ x) → z ∈ y)) |
| 5 | 4 | exbii 1053 | . . . 4 ⊢ (∃y∀z(z ∈ ∪x → z ∈ y) ↔ ∃y∀z(∃y(z ∈ y ⋀ y ∈ x) → z ∈ y)) |
| 6 | 1, 5 | mpbir 190 | . . 3 ⊢ ∃y∀z(z ∈ ∪x → z ∈ y) |
| 7 | 6 | bm1.3ii 2711 | . 2 ⊢ ∃y∀z(z ∈ y ↔ z ∈ ∪x) |
| 8 | dfcleq 1473 | . . 3 ⊢ (y = ∪x ↔ ∀z(z ∈ y ↔ z ∈ ∪x)) | |
| 9 | 8 | exbii 1053 | . 2 ⊢ (∃y y = ∪x ↔ ∃y∀z(z ∈ y ↔ z ∈ ∪x)) |
| 10 | 7, 9 | mpbir 190 | 1 ⊢ ∃y y = ∪x |
| Colors of variables: wff set class |
| Syntax hints: → wi 3 ↔ wb 146 ⋀ wa 223 ∀wal 956 = wceq 958 ∈ wcel 960 ∃wex 982 ∪cuni 2507 |
| This theorem is referenced by: uniex 2876 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-10 968 ax-12 970 ax-13 971 ax-14 972 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-10o 1142 ax-16 1212 ax-11o 1220 ax-ext 1462 ax-sep 2708 ax-un 2872 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 983 df-sb 1174 df-clab 1467 df-cleq 1472 df-clel 1475 df-v 1815 df-uni 2508 |