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

Theorem nfdju 9981
Description: Bound-variable hypothesis builder for disjoint union. (Contributed by Jim Kingdon, 23-Jun-2022.)
Hypotheses
Ref Expression
nfdju.1 Ⅎ𝑥𝐴
nfdju.2 Ⅎ𝑥𝐵
Assertion
Ref Expression
nfdju Ⅎ𝑥(𝐴 ⊔ 𝐵)

Proof of Theorem nfdju
StepHypRef Expression
1 df-dju 9975 . 2 (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
2 nfcv 2923 . . . 4 Ⅎ𝑥{∅}
3 nfdju.1 . . . 4 Ⅎ𝑥𝐴
42, 3nfxp 5684 . . 3 Ⅎ𝑥({∅} × 𝐴)
5 nfcv 2923 . . . 4 Ⅎ𝑥{1o}
6 nfdju.2 . . . 4 Ⅎ𝑥𝐵
75, 6nfxp 5684 . . 3 Ⅎ𝑥({1o} × 𝐵)
84, 7nfun 4117 . 2 Ⅎ𝑥(({∅} × 𝐴) ∪ ({1o} × 𝐵))
91, 8nfcxfr 2921 1 Ⅎ𝑥(𝐴 ⊔ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  Ⅎwnfc 2908   ∪ cun 3897  ∅c0 4279  {csn 4584   × cxp 5649  1oc1o 8462   ⊔ cdju 9972
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-v 3453  df-un 3904  df-opab 5168  df-xp 5657  df-dju 9975
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator