| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unexb | Structured version Visualization version GIF version | ||
| Description: Existence of union is equivalent to existence of its components. (Contributed by NM, 11-Jun-1998.) |
| Ref | Expression |
|---|---|
| unexb | ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ∪ 𝐵) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unexg 7697 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ∈ V) | |
| 2 | ssun1 4118 | . . . 4 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
| 3 | ssexg 5264 | . . . 4 ⊢ ((𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ∈ V) → 𝐴 ∈ V) | |
| 4 | 2, 3 | mpan 691 | . . 3 ⊢ ((𝐴 ∪ 𝐵) ∈ V → 𝐴 ∈ V) |
| 5 | ssun2 4119 | . . . 4 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵) | |
| 6 | ssexg 5264 | . . . 4 ⊢ ((𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ∈ V) → 𝐵 ∈ V) | |
| 7 | 5, 6 | mpan 691 | . . 3 ⊢ ((𝐴 ∪ 𝐵) ∈ V → 𝐵 ∈ V) |
| 8 | 4, 7 | jca 511 | . 2 ⊢ ((𝐴 ∪ 𝐵) ∈ V → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 9 | 1, 8 | impbii 209 | 1 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ∪ 𝐵) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∈ wcel 2114 Vcvv 3429 ∪ cun 3887 ⊆ wss 3889 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 ax-sep 5231 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-rab 3390 df-v 3431 df-un 3894 df-in 3896 df-ss 3906 df-sn 4568 df-pr 4570 df-uni 4851 |
| This theorem is referenced by: unexgOLD 7703 sucexb 7758 fodomr 9066 fsuppun 9300 fsuppunbi 9302 djuexb 9833 bj-tagex 37294 |
| Copyright terms: Public domain | W3C validator |