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

Theorem nfdisj1 5083
Description: Bound-variable hypothesis builder for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
nfdisj1 𝑥Disj 𝑥𝐴 𝐵

Proof of Theorem nfdisj1
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 df-disj 5070 . 2 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑦∃*𝑥𝐴 𝑦𝐵)
2 nfrmo1 3380 . . 3 𝑥∃*𝑥𝐴 𝑦𝐵
32nfal 2322 . 2 𝑥𝑦∃*𝑥𝐴 𝑦𝐵
41, 3nfxfr 1853 1 𝑥Disj 𝑥𝐴 𝐵
Colors of variables: wff setvar class
Syntax hints:  wal 1538  wnf 1783  wcel 2109  ∃*wrmo 3350  Disj wdisj 5069
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-10 2142  ax-11 2158  ax-12 2178
This theorem depends on definitions:  df-bi 207  df-or 848  df-ex 1780  df-nf 1784  df-mo 2533  df-rmo 3351  df-disj 5070
This theorem is referenced by:  disjabrex  32561  disjabrexf  32562  hasheuni  34068  ldgenpisyslem1  34146  measvunilem  34195  measvunilem0  34196  measvuni  34197  measinblem  34203  voliune  34212  volfiniune  34213  volmeas  34214  dstrvprob  34456  ismeannd  46458
  Copyright terms: Public domain W3C validator