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

Theorem nfovd 6104
Description: Deduction version of bound-variable hypothesis builder nfov 6105. (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 6078 . 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 3916 . . 3  |-  ( ph  -> 
F/_ x <. A ,  B >. )
62, 5nffvd 5702 . 2  |-  ( ph  -> 
F/_ x ( F `
 <. A ,  B >. ) )
71, 6nfcxfrd 2390 1  |-  ( ph  -> 
F/_ x ( A F B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4   F/_wnfc 2379   <.cop 3708   ` cfv 5372  (class class class)co 6075
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-iota 5332  df-fv 5380  df-ov 6078
This theorem is referenced by:  nfov  6105  nfnegd  8512
  Copyright terms: Public domain W3C validator