Theorem naryfval 49834

Description: The set of the n-ary (endo)functions on a class 𝑋. (Contributed by AV, 13-May-2024.)

Hypothesis

Ref	Expression
naryfval.i	⊢ 𝐼 = (0..^𝑁)

Assertion

Ref	Expression
naryfval	⊢ (𝑁 ∈ ℕ0 → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))

Proof of Theorem naryfval

Dummy variables 𝑛 𝑥 𝑓 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 490	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
2		oveq2 7429	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = (0..^𝑁))
3		naryfval.i	. . . . . . . 8 ⊢ 𝐼 = (0..^𝑁)
4	2, 3	eqtr4di 2813	. . . . . . 7 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = 𝐼)
5	4	adantr 486	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (0..^𝑛) = 𝐼)
6	1, 5	oveq12d 7439	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ↑m (0..^𝑛)) = (𝑋 ↑m 𝐼))
7	1, 6	oveq12d 7439	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ↑m (𝑥 ↑m (0..^𝑛))) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
8		df-naryf 49833	. . . 4 ⊢ -aryF = (𝑛 ∈ ℕ0, 𝑥 ∈ V ↦ (𝑥 ↑m (𝑥 ↑m (0..^𝑛))))
9		ovex 7454	. . . 4 ⊢ (𝑋 ↑m (𝑋 ↑m 𝐼)) ∈ V
10	7, 8, 9	ovmpoa 7576	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
11	10	ex 418	. 2 ⊢ (𝑁 ∈ ℕ0 → (𝑋 ∈ V → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼))))
12		simpr 490	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → 𝑋 ∈ V)
13		df-naryf 49833	. . . . 5 ⊢ -aryF = (𝑥 ∈ ℕ0, 𝑛 ∈ V ↦ (𝑛 ↑m (𝑛 ↑m (0..^𝑥))))
14	13	mpondm0 7662	. . . 4 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = ∅)
15	12, 14	nsyl5 160	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = ∅)
16		simpl 488	. . . 4 ⊢ ((𝑋 ∈ V ∧ (𝑋 ↑m 𝐼) ∈ V) → 𝑋 ∈ V)
17		df-map 8853	. . . . 5 ⊢ ↑m = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∣ 𝑓:𝑦⟶𝑥})
18	17	mpondm0 7662	. . . 4 ⊢ (¬ (𝑋 ∈ V ∧ (𝑋 ↑m 𝐼) ∈ V) → (𝑋 ↑m (𝑋 ↑m 𝐼)) = ∅)
19	16, 18	nsyl5 160	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝑋 ↑m (𝑋 ↑m 𝐼)) = ∅)
20	15, 19	eqtr4d 2798	. 2 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
21	11, 20	pm2.61d1 182	1 ⊢ (𝑁 ∈ ℕ0 → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  Vcvv 3450  ∅c0 4278  ⟶wf 6535  (class class class)co 7421   ↑_m cmap 8851  0cc0 11204  ℕ₀cn0 12610  ..^cfzo 13792  -aryF cnaryf 49832

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-map 8853  df-naryf 49833

This theorem is used by:  naryfvalixp  49835  naryfvalel  49836