Theorem nfovd 5545

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

Hypotheses

Ref	Expression
nfovd.2	⊢ (φ → ℲxA)
nfovd.3	⊢ (φ → ℲxF)
nfovd.4	⊢ (φ → ℲxB)

Assertion

Ref	Expression
nfovd	⊢ (φ → Ⅎx(AFB))

Proof of Theorem nfovd

Step	Hyp	Ref	Expression
1		df-ov 5527	. 2 ⊢ (AFB) = (F ‘⟨A, B⟩)
2		nfovd.3	. . 3 ⊢ (φ → ℲxF)
3		nfovd.2	. . . 4 ⊢ (φ → ℲxA)
4		nfovd.4	. . . 4 ⊢ (φ → ℲxB)
5	3, 4	nfopd 4606	. . 3 ⊢ (φ → Ⅎx⟨A, B⟩)
6	2, 5	nffvd 5336	. 2 ⊢ (φ → Ⅎx(F ‘⟨A, B⟩))
7	1, 6	nfcxfrd 2488	1 ⊢ (φ → Ⅎx(AFB))

Syntax hints:   → wi 4  Ⅎwnfc 2477  ⟨cop 4562   ‘cfv 4782  (class class class)co 5526

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-addc 4379  df-nnc 4380  df-phi 4566  df-op 4567  df-br 4641  df-fv 4796  df-ov 5527

This theorem is referenced by:  nfov  5546