| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bj-uniex2 | GIF version | ||
| Description: uniex2 4559 from bounded separation. (Contributed by BJ, 15-Oct-2019.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| bj-uniex2 | ⊢ ∃𝑦 𝑦 = ∪ 𝑥 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bdcuni 16695 | . . . 4 ⊢ BOUNDED ∪ 𝑥 | |
| 2 | 1 | bdeli 16665 | . . 3 ⊢ BOUNDED 𝑧 ∈ ∪ 𝑥 |
| 3 | zfun 4557 | . . . 4 ⊢ ∃𝑦∀𝑧(∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑦) | |
| 4 | eluni 3919 | . . . . . . 7 ⊢ (𝑧 ∈ ∪ 𝑥 ↔ ∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥)) | |
| 5 | 4 | imbi1i 238 | . . . . . 6 ⊢ ((𝑧 ∈ ∪ 𝑥 → 𝑧 ∈ 𝑦) ↔ (∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑦)) |
| 6 | 5 | albii 1519 | . . . . 5 ⊢ (∀𝑧(𝑧 ∈ ∪ 𝑥 → 𝑧 ∈ 𝑦) ↔ ∀𝑧(∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑦)) |
| 7 | 6 | exbii 1654 | . . . 4 ⊢ (∃𝑦∀𝑧(𝑧 ∈ ∪ 𝑥 → 𝑧 ∈ 𝑦) ↔ ∃𝑦∀𝑧(∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑦)) |
| 8 | 3, 7 | mpbir 146 | . . 3 ⊢ ∃𝑦∀𝑧(𝑧 ∈ ∪ 𝑥 → 𝑧 ∈ 𝑦) |
| 9 | 2, 8 | bdbm1.3ii 16710 | . 2 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥) |
| 10 | dfcleq 2228 | . . 3 ⊢ (𝑦 = ∪ 𝑥 ↔ ∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥)) | |
| 11 | 10 | exbii 1654 | . 2 ⊢ (∃𝑦 𝑦 = ∪ 𝑥 ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ∈ ∪ 𝑥)) |
| 12 | 9, 11 | mpbir 146 | 1 ⊢ ∃𝑦 𝑦 = ∪ 𝑥 |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∀wal 1396 = wceq 1398 ∃wex 1541 ∈ wcel 2205 ∪ cuni 3916 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-un 4556 ax-bd0 16632 ax-bdex 16638 ax-bdel 16640 ax-bdsb 16641 ax-bdsep 16703 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-rex 2528 df-v 2817 df-uni 3917 df-bdc 16660 |
| This theorem is referenced by: bj-uniex 16736 |
| Copyright terms: Public domain | W3C validator |