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

Theorem djuexb 9947
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 9946 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
2 df-dju 9939 . . . . 5 (𝐴𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
32eleq1i 2851 . . . 4 ((𝐴𝐵) ∈ V ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V)
4 unexb 7747 . . . 4 ((({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V) ↔ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ∈ V)
53, 4bitr4i 281 . . 3 ((𝐴𝐵) ∈ V ↔ (({∅} × 𝐴) ∈ V ∧ ({1o} × 𝐵) ∈ V))
6 0nep0 5319 . . . . . 6 ∅ ≠ {∅}
76necomi 3009 . . . . 5 {∅} ≠ ∅
8 rnexg 7898 . . . . . 6 (({∅} × 𝐴) ∈ V → ran ({∅} × 𝐴) ∈ V)
9 rnxp 6158 . . . . . . 7 ({∅} ≠ ∅ → ran ({∅} × 𝐴) = 𝐴)
109eleq1d 2845 . . . . . 6 ({∅} ≠ ∅ → (ran ({∅} × 𝐴) ∈ V ↔ 𝐴 ∈ V))
118, 10imbitrid 247 . . . . 5 ({∅} ≠ ∅ → (({∅} × 𝐴) ∈ V → 𝐴 ∈ V))
127, 11ax-mp 5 . . . 4 (({∅} × 𝐴) ∈ V → 𝐴 ∈ V)
13 1oex 8465 . . . . . 6 1o ∈ V
1413snnz 4737 . . . . 5 {1o} ≠ ∅
15 rnexg 7898 . . . . . 6 (({1o} × 𝐵) ∈ V → ran ({1o} × 𝐵) ∈ V)
16 rnxp 6158 . . . . . . 7 ({1o} ≠ ∅ → ran ({1o} × 𝐵) = 𝐵)
1716eleq1d 2845 . . . . . 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 2955  Vcvv 3450  cun 3897  c0 4279  {csn 4584   × cxp 5646  ran crn 5649  1oc1o 8448  cdju 9936
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 2732  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735
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 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5654  df-rel 5655  df-cnv 5656  df-dm 5658  df-rn 5659  df-suc 6358  df-1o 8455  df-dju 9939
This theorem is used by:  djuinf  10224  pwdjudom  10250
  Copyright terms: Public domain W3C validator