Metamath Proof Explorer


Theorem bj-evalidval

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

Ref Expression
Assertion bj-evalidval ⊢ V ∈ W ∧ A ∈ V ∧ F ∈ U → F ⁡ Slot A ⁡ I ↾ V = Slot A ⁡ F

Proof

Step Hyp Ref Expression
1 bj-evalid ⊢ V ∈ W ∧ A ∈ V → Slot A ⁡ I ↾ V = A
2 1 fveq2d ⊢ V ∈ W ∧ A ∈ V → F ⁡ Slot A ⁡ I ↾ V = F ⁡ A
3 2 3adant3 ⊢ V ∈ W ∧ A ∈ V ∧ F ∈ U → F ⁡ Slot A ⁡ I ↾ V = F ⁡ A
4 bj-evalval ⊢ F ∈ U → Slot A ⁡ F = F ⁡ A
5 4 eqcomd ⊢ F ∈ U → F ⁡ A = Slot A ⁡ F
6 5 3ad2ant3 ⊢ V ∈ W ∧ A ∈ V ∧ F ∈ U → F ⁡ A = Slot A ⁡ F
7 3 6 eqtrd ⊢ V ∈ W ∧ A ∈ V ∧ F ∈ U → F ⁡ Slot A ⁡ I ↾ V = Slot A ⁡ F