Theorem fvmptdv 7031

Description: Alternate deduction version of fvmpt 7013, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.)

Hypotheses

Ref	Expression
fvmptd2f.1	⊢ (𝜑 → 𝐴 ∈ 𝐷)
fvmptd2f.2	⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝑉)
fvmptd2f.3	⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝐹‘𝐴) = 𝐵 → 𝜓))

Assertion

Ref	Expression
fvmptdv	⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → 𝜓))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐷   𝜑,𝑥   𝑥,𝐹   𝜓,𝑥

Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥)

Proof of Theorem fvmptdv

Step	Hyp	Ref	Expression
1		fvmptd2f.1	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐷)
2		fvmptd2f.2	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝑉)
3		fvmptd2f.3	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝐹‘𝐴) = 𝐵 → 𝜓))
4		nfcv 2926	. 2 ⊢ Ⅎ𝑥𝐹
5		nfv 1949	. 2 ⊢ Ⅎ𝑥𝜓
6	1, 2, 3, 4, 5	fvmptd2f 7030	1 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → 𝜓))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ↦ cmpt 5189  ‘cfv 6555

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fv 6563

This theorem is used by: (None)