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 9666 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ⊔ 𝐵) ∈ V) | |
2 | df-dju 9659 | . . . . 5 ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵)) | |
3 | 2 | eleq1i 2829 | . . . 4 ⊢ ((𝐴 ⊔ 𝐵) ∈ V ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V) |
4 | unexb 7598 | . . . 4 ⊢ ((({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V) ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V) | |
5 | 3, 4 | bitr4i 277 | . . 3 ⊢ ((𝐴 ⊔ 𝐵) ∈ V ↔ (({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V)) |
6 | 0nep0 5280 | . . . . . 6 ⊢ ∅ ≠ {∅} | |
7 | 6 | necomi 2998 | . . . . 5 ⊢ {∅} ≠ ∅ |
8 | rnexg 7751 | . . . . . 6 ⊢ (({∅} × 𝐴) ∈ V → ran ({∅} × 𝐴) ∈ V) | |
9 | rnxp 6073 | . . . . . . 7 ⊢ ({∅} ≠ ∅ → ran ({∅} × 𝐴) = 𝐴) | |
10 | 9 | eleq1d 2823 | . . . . . 6 ⊢ ({∅} ≠ ∅ → (ran ({∅} × 𝐴) ∈ V ↔ 𝐴 ∈ V)) |
11 | 8, 10 | syl5ib 243 | . . . . 5 ⊢ ({∅} ≠ ∅ → (({∅} × 𝐴) ∈ V → 𝐴 ∈ V)) |
12 | 7, 11 | ax-mp 5 | . . . 4 ⊢ (({∅} × 𝐴) ∈ V → 𝐴 ∈ V) |
13 | 1oex 8307 | . . . . . 6 ⊢ 1o ∈ V | |
14 | 13 | snnz 4712 | . . . . 5 ⊢ {1o} ≠ ∅ |
15 | rnexg 7751 | . . . . . 6 ⊢ (({1o} × 𝐵) ∈ V → ran ({1o} × 𝐵) ∈ V) | |
16 | rnxp 6073 | . . . . . . 7 ⊢ ({1o} ≠ ∅ → ran ({1o} × 𝐵) = 𝐵) | |
17 | 16 | eleq1d 2823 | . . . . . 6 ⊢ ({1o} ≠ ∅ → (ran ({1o} × 𝐵) ∈ V ↔ 𝐵 ∈ V)) |
18 | 15, 17 | syl5ib 243 | . . . . 5 ⊢ ({1o} ≠ ∅ → (({1o} × 𝐵) ∈ V → 𝐵 ∈ V)) |
19 | 14, 18 | ax-mp 5 | . . . 4 ⊢ (({1o} × 𝐵) ∈ V → 𝐵 ∈ V) |
20 | 12, 19 | anim12i 613 | . . 3 ⊢ ((({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
21 | 5, 20 | sylbi 216 | . 2 ⊢ ((𝐴 ⊔ 𝐵) ∈ V → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
22 | 1, 21 | impbii 208 | 1 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ⊔ 𝐵) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∈ wcel 2106 ≠ wne 2943 Vcvv 3432 ∪ cun 3885 ∅c0 4256 {csn 4561 × cxp 5587 ran crn 5590 1oc1o 8290 ⊔ cdju 9656 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-xp 5595 df-rel 5596 df-cnv 5597 df-dm 5599 df-rn 5600 df-suc 6272 df-1o 8297 df-dju 9659 |
This theorem is referenced by: djuinf 9944 pwdjudom 9972 |
Copyright terms: Public domain | W3C validator |