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

Theorem nfdju 9909
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 9903 . 2 (𝐴𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
2 nfcv 2927 . . . 4 𝑥{∅}
3 nfdju.1 . . . 4 𝑥𝐴
42, 3nfxp 5696 . . 3 𝑥({∅} × 𝐴)
5 nfcv 2927 . . . 4 𝑥{1o}
6 nfdju.2 . . . 4 𝑥𝐵
75, 6nfxp 5696 . . 3 𝑥({1o} × 𝐵)
84, 7nfun 4124 . 2 𝑥(({∅} × 𝐴) ∪ ({1o} × 𝐵))
91, 8nfcxfr 2925 1 𝑥(𝐴𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wnfc 2912  cun 3904  c0 4286  {csn 4591   × cxp 5661  1oc1o 8452  cdju 9900
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737
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 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-v 3459  df-un 3911  df-opab 5176  df-xp 5669  df-dju 9903
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator