Theorem fvmptd2f 6777

Description: Alternate deduction version of fvmpt 6761, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.) (Proof shortened by AV, 19-Jan-2022.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem fvmptd2f

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

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536  Ⅎwnf 1783   ∈ wcel 2113  Ⅎwnfc 2960   ↦ cmpt 5139  ‘cfv 6348

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-sbc 3769  df-csb 3877  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fv 6356

This theorem is referenced by:  fvmptdv  6778  yonedalem4b  17521