Theorem bj-evalidval 37101

Description: Closed general form of strndxid 17222. Both sides are equal to (𝐹‘𝐴) by bj-evalid 37099 and bj-evalval 37098 respectively, but bj-evalidval 37101 adds something to bj-evalid 37099 and bj-evalval 37098 in that Slot 𝐴 appears on both sides. (Contributed by BJ, 27-Dec-2021.)

Assertion

Ref	Expression
bj-evalidval	⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐹 ∈ 𝑈) → (𝐹‘(Slot 𝐴‘( I ↾ 𝑉))) = (Slot 𝐴‘𝐹))

Proof of Theorem bj-evalidval

Step	Hyp	Ref	Expression
1		bj-evalid 37099	. . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → (Slot 𝐴‘( I ↾ 𝑉)) = 𝐴)
2	1	fveq2d 6885	. . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → (𝐹‘(Slot 𝐴‘( I ↾ 𝑉))) = (𝐹‘𝐴))
3	2	3adant3 1132	. 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐹 ∈ 𝑈) → (𝐹‘(Slot 𝐴‘( I ↾ 𝑉))) = (𝐹‘𝐴))
4		bj-evalval 37098	. . . 4 ⊢ (𝐹 ∈ 𝑈 → (Slot 𝐴‘𝐹) = (𝐹‘𝐴))
5	4	eqcomd 2742	. . 3 ⊢ (𝐹 ∈ 𝑈 → (𝐹‘𝐴) = (Slot 𝐴‘𝐹))
6	5	3ad2ant3 1135	. 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐹 ∈ 𝑈) → (𝐹‘𝐴) = (Slot 𝐴‘𝐹))
7	3, 6	eqtrd 2771	1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐹 ∈ 𝑈) → (𝐹‘(Slot 𝐴‘( I ↾ 𝑉))) = (Slot 𝐴‘𝐹))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   I cid 5552   ↾ cres 5661  ‘cfv 6536  Slot cslot 17205

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 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-res 5671  df-iota 6489  df-fun 6538  df-fv 6544  df-slot 17206

This theorem is referenced by: (None)