Theorem nfovd 7164

Description: Deduction version of bound-variable hypothesis builder nfov 7165. (Contributed by NM, 13-Dec-2005.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)

Hypotheses

Ref	Expression
nfovd.2	⊢ (𝜑 → Ⅎ𝑥𝐴)
nfovd.3	⊢ (𝜑 → Ⅎ𝑥𝐹)
nfovd.4	⊢ (𝜑 → Ⅎ𝑥𝐵)

Assertion

Ref	Expression
nfovd	⊢ (𝜑 → Ⅎ𝑥(𝐴𝐹𝐵))

Proof of Theorem nfovd

Step	Hyp	Ref	Expression
1		df-ov 7138	. 2 ⊢ (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2		nfovd.3	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐹)
3		nfovd.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
4		nfovd.4	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐵)
5	3, 4	nfopd 4782	. . 3 ⊢ (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)
6	2, 5	nffvd 6657	. 2 ⊢ (𝜑 → Ⅎ𝑥(𝐹‘⟨𝐴, 𝐵⟩))
7	1, 6	nfcxfrd 2954	1 ⊢ (𝜑 → Ⅎ𝑥(𝐴𝐹𝐵))

Syntax hints:   → wi 4  Ⅎwnfc 2936  ⟨cop 4531  ‘cfv 6324  (class class class)co 7135

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-iota 6283  df-fv 6332  df-ov 7138

This theorem is referenced by:  nfov  7165  nfnegd  10870