| 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 10013 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ⊔ 𝐵) ∈ V) | |
| 2 | df-dju 10006 | . . . . 5 ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵)) | |
| 3 | 2 | eleq1i 2855 | . . . 4 ⊢ ((𝐴 ⊔ 𝐵) ∈ V ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V) |
| 4 | unexb 7784 | . . . 4 ⊢ ((({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V) ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V) | |
| 5 | 3, 4 | bitr4i 281 | . . 3 ⊢ ((𝐴 ⊔ 𝐵) ∈ V ↔ (({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V)) |
| 6 | 0nep0 5323 | . . . . . 6 ⊢ ∅ ≠ {∅} | |
| 7 | 6 | necomi 3013 | . . . . 5 ⊢ {∅} ≠ ∅ |
| 8 | rnexg 7935 | . . . . . 6 ⊢ (({∅} × 𝐴) ∈ V → ran ({∅} × 𝐴) ∈ V) | |
| 9 | rnxp 6173 | . . . . . . 7 ⊢ ({∅} ≠ ∅ → ran ({∅} × 𝐴) = 𝐴) | |
| 10 | 9 | eleq1d 2849 | . . . . . 6 ⊢ ({∅} ≠ ∅ → (ran ({∅} × 𝐴) ∈ V ↔ 𝐴 ∈ V)) |
| 11 | 8, 10 | imbitrid 247 | . . . . 5 ⊢ ({∅} ≠ ∅ → (({∅} × 𝐴) ∈ V → 𝐴 ∈ V)) |
| 12 | 7, 11 | ax-mp 5 | . . . 4 ⊢ (({∅} × 𝐴) ∈ V → 𝐴 ∈ V) |
| 13 | 1oex 8511 | . . . . . 6 ⊢ 1o ∈ V | |
| 14 | 13 | snnz 4737 | . . . . 5 ⊢ {1o} ≠ ∅ |
| 15 | rnexg 7935 | . . . . . 6 ⊢ (({1o} × 𝐵) ∈ V → ran ({1o} × 𝐵) ∈ V) | |
| 16 | rnxp 6173 | . . . . . . 7 ⊢ ({1o} ≠ ∅ → ran ({1o} × 𝐵) = 𝐵) | |
| 17 | 16 | eleq1d 2849 | . . . . . 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 625 | . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ∪ cun 4152 ∅c0 4281 {csn 4588 × cxp 5653 ran crn 5656 1oc1o 8494 ⊔ cdju 10003 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-xp 5661 df-rel 5662 df-cnv 5663 df-dm 5665 df-rn 5666 df-suc 6383 df-1o 8501 df-dju 10006 |
| This theorem is used by: djuinf 10291 pwdjudom 10317 |
| Copyright terms: Public domain | W3C validator |