MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfovd Unicode version

Theorem nfovd 6035
Description: Deduction version of bound-variable hypothesis builder nfov 6036. (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 6016 . 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 3936 . . 3  |-  ( ph  -> 
F/_ x <. A ,  B >. )
62, 5nffvd 5670 . 2  |-  ( ph  -> 
F/_ x ( F `
 <. A ,  B >. ) )
71, 6nfcxfrd 2514 1  |-  ( ph  -> 
F/_ x ( A F B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4   F/_wnfc 2503   <.cop 3753   ` cfv 5387  (class class class)co 6013
This theorem is referenced by:  nfov  6036  nfnegd  9226
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-ral 2647  df-rex 2648  df-rab 2651  df-v 2894  df-dif 3259  df-un 3261  df-in 3263  df-ss 3270  df-nul 3565  df-if 3676  df-sn 3756  df-pr 3757  df-op 3759  df-uni 3951  df-br 4147  df-iota 5351  df-fv 5395  df-ov 6016
  Copyright terms: Public domain W3C validator