Theorem bj-evalval 38266

Description: Value of the evaluation at a class. Closed form of strfvnd 17407 and strfvn 17408. (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 3475	. 2 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
2		fveq1 6915	. . 3 ⊢ (𝑓 = 𝐹 → (𝑓‘𝐴) = (𝐹‘𝐴))
3		df-slot 17404	. . 3 ⊢ Slot 𝐴 = (𝑓 ∈ V ↦ (𝑓‘𝐴))
4		fvex 6929	. . 3 ⊢ (𝐹‘𝐴) ∈ V
5	2, 3, 4	fvmpt 7024	. 2 ⊢ (𝐹 ∈ V → (Slot 𝐴‘𝐹) = (𝐹‘𝐴))
6	1, 5	syl 18	1 ⊢ (𝐹 ∈ 𝑉 → (Slot 𝐴‘𝐹) = (𝐹‘𝐴))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ‘cfv 6566  Slot cslot 17403

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 5255  ax-nul 5266  ax-pr 5398

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-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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-slot 17404

This theorem is used by:  bj-evalid  38267  bj-evalidval  38269