Theorem fvmpt3 5670

Description: Value of a function given in maps-to notation, with a slightly different sethood condition. (Contributed by Stefan O'Rear, 30-Jan-2015.)

Hypotheses

Ref	Expression
fvmpt3.a	⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
fvmpt3.b	⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵)
fvmpt3.c	⊢ (𝑥 ∈ 𝐷 → 𝐵 ∈ 𝑉)

Assertion

Ref	Expression
fvmpt3	⊢ (𝐴 ∈ 𝐷 → (𝐹‘𝐴) = 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝑥,𝐷   𝑥,𝑉

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

Proof of Theorem fvmpt3

Step	Hyp	Ref	Expression
1		fvmpt3.a	. . . 4 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
2	1	eleq1d 2275	. . 3 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ 𝑉 ↔ 𝐶 ∈ 𝑉))
3		fvmpt3.c	. . 3 ⊢ (𝑥 ∈ 𝐷 → 𝐵 ∈ 𝑉)
4	2, 3	vtoclga 2841	. 2 ⊢ (𝐴 ∈ 𝐷 → 𝐶 ∈ 𝑉)
5		fvmpt3.b	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵)
6	1, 5	fvmptg 5667	. 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑉) → (𝐹‘𝐴) = 𝐶)
7	4, 6	mpdan 421	1 ⊢ (𝐴 ∈ 𝐷 → (𝐹‘𝐴) = 𝐶)

Syntax hints:   → wi 4   = wceq 1373   ∈ wcel 2177   ↦ cmpt 4112  ‘cfv 5279

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4169  ax-pow 4225  ax-pr 4260

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-sbc 3003  df-un 3174  df-in 3176  df-ss 3183  df-pw 3622  df-sn 3643  df-pr 3644  df-op 3646  df-uni 3856  df-br 4051  df-opab 4113  df-mpt 4114  df-id 4347  df-xp 4688  df-rel 4689  df-cnv 4690  df-co 4691  df-dm 4692  df-iota 5240  df-fun 5281  df-fv 5287

This theorem is referenced by:  fvmpt3i  5671  frec2uzsucd  10563