Theorem nfovd 7396

Description: Deduction version of bound-variable hypothesis builder nfov 7397. (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 7370	. 2 ⊢ (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2		nfovd.3	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐹)
3		nfovd.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
4		nfovd.4	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐵)
5	3, 4	nfopd 4833	. . 3 ⊢ (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)
6	2, 5	nffvd 6852	. 2 ⊢ (𝜑 → Ⅎ𝑥(𝐹‘⟨𝐴, 𝐵⟩))
7	1, 6	nfcxfrd 2897	1 ⊢ (𝜑 → Ⅎ𝑥(𝐴𝐹𝐵))

Syntax hints:   → wi 4  Ⅎwnfc 2883  ⟨cop 4573  ‘cfv 6498  (class class class)co 7367

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-iota 6454  df-fv 6506  df-ov 7370

This theorem is referenced by:  nfov  7397  nfnegd  11388