ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfint Unicode version

Theorem nfint 3854
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  |-  F/_ x A
Assertion
Ref Expression
nfint  |-  F/_ x |^| A

Proof of Theorem nfint
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfint2 3846 . 2  |-  |^| A  =  { y  |  A. z  e.  A  y  e.  z }
2 nfint.1 . . . 4  |-  F/_ x A
3 nfv 1528 . . . 4  |-  F/ x  y  e.  z
42, 3nfralxy 2515 . . 3  |-  F/ x A. z  e.  A  y  e.  z
54nfab 2324 . 2  |-  F/_ x { y  |  A. z  e.  A  y  e.  z }
61, 5nfcxfr 2316 1  |-  F/_ x |^| A
Colors of variables: wff set class
Syntax hints:   {cab 2163   F/_wnfc 2306   A.wral 2455   |^|cint 3844
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-int 3845
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator