| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > djuexb | Structured version Visualization version GIF version | ||
| Description: The disjoint union of two classes is a set iff both classes are sets. (Contributed by Jim Kingdon, 6-Sep-2023.) |
| Ref | Expression |
|---|---|
| djuexb | ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ⊔ 𝐵) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | djuex 9897 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ⊔ 𝐵) ∈ V) | |
| 2 | df-dju 9890 | . . . . 5 ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵)) | |
| 3 | 2 | eleq1i 2861 | . . . 4 ⊢ ((𝐴 ⊔ 𝐵) ∈ V ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V) |
| 4 | unexb 7749 | . . . 4 ⊢ ((({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V) ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V) | |
| 5 | 3, 4 | bitr4i 281 | . . 3 ⊢ ((𝐴 ⊔ 𝐵) ∈ V ↔ (({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V)) |
| 6 | 0nep0 5332 | . . . . . 6 ⊢ ∅ ≠ {∅} | |
| 7 | 6 | necomi 3019 | . . . . 5 ⊢ {∅} ≠ ∅ |
| 8 | rnexg 7902 | . . . . . 6 ⊢ (({∅} × 𝐴) ∈ V → ran ({∅} × 𝐴) ∈ V) | |
| 9 | rnxp 6172 | . . . . . . 7 ⊢ ({∅} ≠ ∅ → ran ({∅} × 𝐴) = 𝐴) | |
| 10 | 9 | eleq1d 2855 | . . . . . 6 ⊢ ({∅} ≠ ∅ → (ran ({∅} × 𝐴) ∈ V ↔ 𝐴 ∈ V)) |
| 11 | 8, 10 | imbitrid 247 | . . . . 5 ⊢ ({∅} ≠ ∅ → (({∅} × 𝐴) ∈ V → 𝐴 ∈ V)) |
| 12 | 7, 11 | ax-mp 5 | . . . 4 ⊢ (({∅} × 𝐴) ∈ V → 𝐴 ∈ V) |
| 13 | 1oex 8466 | . . . . . 6 ⊢ 1o ∈ V | |
| 14 | 13 | snnz 4747 | . . . . 5 ⊢ {1o} ≠ ∅ |
| 15 | rnexg 7902 | . . . . . 6 ⊢ (({1o} × 𝐵) ∈ V → ran ({1o} × 𝐵) ∈ V) | |
| 16 | rnxp 6172 | . . . . . . 7 ⊢ ({1o} ≠ ∅ → ran ({1o} × 𝐵) = 𝐵) | |
| 17 | 16 | eleq1d 2855 | . . . . . 6 ⊢ ({1o} ≠ ∅ → (ran ({1o} × 𝐵) ∈ V ↔ 𝐵 ∈ V)) |
| 18 | 15, 17 | imbitrid 247 | . . . . 5 ⊢ ({1o} ≠ ∅ → (({1o} × 𝐵) ∈ V → 𝐵 ∈ V)) |
| 19 | 14, 18 | ax-mp 5 | . . . 4 ⊢ (({1o} × 𝐵) ∈ V → 𝐵 ∈ V) |
| 20 | 12, 19 | anim12i 624 | . . 3 ⊢ ((({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 21 | 5, 20 | sylbi 220 | . 2 ⊢ ((𝐴 ⊔ 𝐵) ∈ V → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 22 | 1, 21 | impbii 212 | 1 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ⊔ 𝐵) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2150 ≠ wne 2965 Vcvv 3462 ∪ cun 3911 ∅c0 4294 {csn 4594 × cxp 5663 ran crn 5666 1oc1o 8449 ⊔ cdju 9887 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-11 2199 ax-ext 2742 ax-sep 5262 ax-nul 5274 ax-pow 5340 ax-pr 5408 ax-un 7736 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-ne 2966 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-xp 5671 df-rel 5672 df-cnv 5673 df-dm 5675 df-rn 5676 df-suc 6370 df-1o 8456 df-dju 9890 |
| This theorem is referenced by: djuinf 10175 pwdjudom 10201 |
| Copyright terms: Public domain | W3C validator |