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

Theorem nf3and 1549
Description: Deduction form of bound-variable hypothesis builder nf3an 1546. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 16-Oct-2016.)
Hypotheses
Ref Expression
nfand.1  |-  ( ph  ->  F/ x ps )
nfand.2  |-  ( ph  ->  F/ x ch )
nfand.3  |-  ( ph  ->  F/ x th )
Assertion
Ref Expression
nf3and  |-  ( ph  ->  F/ x ( ps 
/\  ch  /\  th )
)

Proof of Theorem nf3and
StepHypRef Expression
1 df-3an 965 . 2  |-  ( ( ps  /\  ch  /\  th )  <->  ( ( ps 
/\  ch )  /\  th ) )
2 nfand.1 . . . 4  |-  ( ph  ->  F/ x ps )
3 nfand.2 . . . 4  |-  ( ph  ->  F/ x ch )
42, 3nfand 1548 . . 3  |-  ( ph  ->  F/ x ( ps 
/\  ch ) )
5 nfand.3 . . 3  |-  ( ph  ->  F/ x th )
64, 5nfand 1548 . 2  |-  ( ph  ->  F/ x ( ( ps  /\  ch )  /\  th ) )
71, 6nfxfrd 1452 1  |-  ( ph  ->  F/ x ( ps 
/\  ch  /\  th )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 963   F/wnf 1437
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1424  ax-gen 1426
This theorem depends on definitions:  df-bi 116  df-3an 965  df-nf 1438
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator