| 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 7737 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ∈ V) | |
| 2 | ssun1 4153 | . . . 4 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
| 3 | ssexg 5293 | . . . 4 ⊢ ((𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ∈ V) → 𝐴 ∈ V) | |
| 4 | 2, 3 | mpan 690 | . . 3 ⊢ ((𝐴 ∪ 𝐵) ∈ V → 𝐴 ∈ V) |
| 5 | ssun2 4154 | . . . 4 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵) | |
| 6 | ssexg 5293 | . . . 4 ⊢ ((𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ∈ V) → 𝐵 ∈ V) | |
| 7 | 5, 6 | mpan 690 | . . 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 2108 Vcvv 3459 ∪ cun 3924 ⊆ wss 3926 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 ax-un 7729 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-sn 4602 df-pr 4604 df-uni 4884 |
| This theorem is referenced by: unexgOLD 7743 sucexb 7798 fodomr 9142 fsuppun 9399 fsuppunbi 9401 djuexb 9923 bj-tagex 37005 |
| Copyright terms: Public domain | W3C validator |