New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  nfint Unicode version

Theorem nfint 3936
 Description: Bound-variable hypothesis builder for intersection. (Contributed by NM, 2-Feb-1997.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)
Hypothesis
Ref Expression
nfint.1
Assertion
Ref Expression
nfint

Proof of Theorem nfint
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfint2 3928 . 2
2 nfint.1 . . . 4
3 nfv 1619 . . . 4
42, 3nfral 2667 . . 3
54nfab 2493 . 2
61, 5nfcxfr 2486 1
 Colors of variables: wff setvar class Syntax hints:   wcel 1710  cab 2339  wnfc 2476  wral 2614  cint 3926 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ral 2619  df-int 3927 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator