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

Theorem nfovd 5793
Description: Deduction version of bound-variable hypothesis builder nfov 5794. (Contributed by NM, 13-Dec-2005.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Hypotheses
Ref Expression
nfovd.2  |-  ( ph  -> 
F/_ x A )
nfovd.3  |-  ( ph  -> 
F/_ x F )
nfovd.4  |-  ( ph  -> 
F/_ x B )
Assertion
Ref Expression
nfovd  |-  ( ph  -> 
F/_ x ( A F B ) )

Proof of Theorem nfovd
StepHypRef Expression
1 df-ov 5770 . 2  |-  ( A F B )  =  ( F `  <. A ,  B >. )
2 nfovd.3 . . 3  |-  ( ph  -> 
F/_ x F )
3 nfovd.2 . . . 4  |-  ( ph  -> 
F/_ x A )
4 nfovd.4 . . . 4  |-  ( ph  -> 
F/_ x B )
53, 4nfopd 3717 . . 3  |-  ( ph  -> 
F/_ x <. A ,  B >. )
62, 5nffvd 5426 . 2  |-  ( ph  -> 
F/_ x ( F `
 <. A ,  B >. ) )
71, 6nfcxfrd 2277 1  |-  ( ph  -> 
F/_ x ( A F B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4   F/_wnfc 2266   <.cop 3525   ` cfv 5118  (class class class)co 5767
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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-rex 2420  df-v 2683  df-un 3070  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-iota 5083  df-fv 5126  df-ov 5770
This theorem is referenced by:  nfov  5794  nfnegd  7951
  Copyright terms: Public domain W3C validator