Metamath Proof Explorer


Theorem naryfvalelwrdf

Description: An n-ary (endo)function on a set X expressed as a function over the set of words on X of length n . (Contributed by AV, 4-Jun-2024)

Ref Expression
Assertion naryfvalelwrdf ⊢ N ∈ ℕ 0 ∧ X ∈ V → F ∈ N -aryF X ↔ F : w ∈ Word X | w = N ⟶ X

Proof

Step Hyp Ref Expression
1 eqid ⊢ 0 ..^ N = 0 ..^ N
2 1 naryfvalel ⊢ N ∈ ℕ 0 ∧ X ∈ V → F ∈ N -aryF X ↔ F : X 0 ..^ N ⟶ X
3 wrdnval ⊢ X ∈ V ∧ N ∈ ℕ 0 → w ∈ Word X | w = N = X 0 ..^ N
4 3 ancoms ⊢ N ∈ ℕ 0 ∧ X ∈ V → w ∈ Word X | w = N = X 0 ..^ N
5 4 feq2d ⊢ N ∈ ℕ 0 ∧ X ∈ V → F : w ∈ Word X | w = N ⟶ X ↔ F : X 0 ..^ N ⟶ X
6 2 5 bitr4d ⊢ N ∈ ℕ 0 ∧ X ∈ V → F ∈ N -aryF X ↔ F : w ∈ Word X | w = N ⟶ X