MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  djuexb Structured version   Visualization version   GIF version

Theorem djuexb 9917
Description: The disjoint union of two classes is a set iff both classes are sets. (Contributed by Jim Kingdon, 6-Sep-2023.)
Assertion
Ref Expression
djuexb ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴𝐵) ∈ V)

Proof of Theorem djuexb
StepHypRef Expression
1 djuex 9916 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
2 df-dju 9909 . . . . 5 (𝐴𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
32eleq1i 2853 . . . 4 ((𝐴𝐵) ∈ V ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V)
4 unexb 7751 . . . 4 ((({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V) ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V)
53, 4bitr4i 281 . . 3 ((𝐴𝐵) ∈ V ↔ (({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V))
6 0nep0 5326 . . . . . 6 ∅ ≠ {∅}
76necomi 3011 . . . . 5 {∅} ≠ ∅
8 rnexg 7902 . . . . . 6 (({∅} × 𝐴) ∈ V → ran ({∅} × 𝐴) ∈ V)
9 rnxp 6167 . . . . . . 7 ({∅} ≠ ∅ → ran ({∅} × 𝐴) = 𝐴)
109eleq1d 2847 . . . . . 6 ({∅} ≠ ∅ → (ran ({∅} × 𝐴) ∈ V ↔ 𝐴 ∈ V))
118, 10imbitrid 247 . . . . 5 ({∅} ≠ ∅ → (({∅} × 𝐴) ∈ V → 𝐴 ∈ V))
127, 11ax-mp 5 . . . 4 (({∅} × 𝐴) ∈ V → 𝐴 ∈ V)
13 1oex 8468 . . . . . 6 1o ∈ V
1413snnz 4740 . . . . 5 {1o} ≠ ∅
15 rnexg 7902 . . . . . 6 (({1o} × 𝐵) ∈ V → ran ({1o} × 𝐵) ∈ V)
16 rnxp 6167 . . . . . . 7 ({1o} ≠ ∅ → ran ({1o} × 𝐵) = 𝐵)
1716eleq1d 2847 . . . . . 6 ({1o} ≠ ∅ → (ran ({1o} × 𝐵) ∈ V ↔ 𝐵 ∈ V))
1815, 17imbitrid 247 . . . . 5 ({1o} ≠ ∅ → (({1o} × 𝐵) ∈ V → 𝐵 ∈ V))
1914, 18ax-mp 5 . . . 4 (({1o} × 𝐵) ∈ V → 𝐵 ∈ V)
2012, 19anim12i 625 . . 3 ((({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
215, 20sylbi 220 . 2 ((𝐴𝐵) ∈ V → (𝐴 ∈ V ∧ 𝐵 ∈ V))
221, 21impbii 212 1 ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴𝐵) ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  wcel 2145  wne 2957  Vcvv 3453  cun 3900  c0 4282  {csn 4587   × cxp 5657  ran crn 5660  1oc1o 8451  cdju 9906
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670  df-suc 6367  df-1o 8458  df-dju 9909
This theorem is used by:  djuinf  10194  pwdjudom  10220
  Copyright terms: Public domain W3C validator