Theorem bj-evalval 37976

Description: Value of the evaluation at a class. Closed form of strfvnd 17356 and strfvn 17357. (Contributed by NM, 9-Sep-2011.) (Revised by Mario Carneiro, 15-Nov-2014.) (Revised by BJ, 27-Dec-2021.)

Assertion

Ref	Expression
bj-evalval	⊢ (𝐹 ∈ 𝑉 → (Slot 𝐴‘𝐹) = (𝐹‘𝐴))

Proof of Theorem bj-evalval

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3472	. 2 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
2		fveq1 6882	. . 3 ⊢ (𝑓 = 𝐹 → (𝑓‘𝐴) = (𝐹‘𝐴))
3		df-slot 17353	. . 3 ⊢ Slot 𝐴 = (𝑓 ∈ V ↦ (𝑓‘𝐴))
4		fvex 6896	. . 3 ⊢ (𝐹‘𝐴) ∈ V
5	2, 3, 4	fvmpt 6991	. 2 ⊢ (𝐹 ∈ V → (Slot 𝐴‘𝐹) = (𝐹‘𝐴))
6	1, 5	syl 18	1 ⊢ (𝐹 ∈ 𝑉 → (Slot 𝐴‘𝐹) = (𝐹‘𝐴))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ‘cfv 6537  Slot cslot 17352

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545  df-slot 17353

This theorem is used by:  bj-evalid  37977  bj-evalidval  37979