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

Theorem nf3and 1823
Description: Deduction form of bound-variable hypothesis builder nf3an 1827. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 16-Oct-2016.)
Hypotheses
Ref Expression
nfand.1  F/
nfand.2  F/
nfand.3  F/
Assertion
Ref Expression
nf3and  F/

Proof of Theorem nf3and
StepHypRef Expression
1 df-3an 936 . 2
2 nfand.1 . . . 4  F/
3 nfand.2 . . . 4  F/
42, 3nfand 1822 . . 3  F/
5 nfand.3 . . 3  F/
64, 5nfand 1822 . 2  F/
71, 6nfxfrd 1571 1  F/
Colors of variables: wff setvar class
Syntax hints:   wi 4   wa 358   w3a 934   F/wnf 1544
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-11 1746
This theorem depends on definitions:  df-bi 177  df-an 360  df-3an 936  df-ex 1542  df-nf 1545
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator