Theorem naryfval 49116

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 484	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
2		oveq2 7368	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = (0..^𝑁))
3		naryfval.i	. . . . . . . 8 ⊢ 𝐼 = (0..^𝑁)
4	2, 3	eqtr4di 2790	. . . . . . 7 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = 𝐼)
5	4	adantr 480	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (0..^𝑛) = 𝐼)
6	1, 5	oveq12d 7378	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ↑m (0..^𝑛)) = (𝑋 ↑m 𝐼))
7	1, 6	oveq12d 7378	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ↑m (𝑥 ↑m (0..^𝑛))) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
8		df-naryf 49115	. . . 4 ⊢ -aryF = (𝑛 ∈ ℕ0, 𝑥 ∈ V ↦ (𝑥 ↑m (𝑥 ↑m (0..^𝑛))))
9		ovex 7393	. . . 4 ⊢ (𝑋 ↑m (𝑋 ↑m 𝐼)) ∈ V
10	7, 8, 9	ovmpoa 7515	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
11	10	ex 412	. 2 ⊢ (𝑁 ∈ ℕ0 → (𝑋 ∈ V → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼))))
12		simpr 484	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → 𝑋 ∈ V)
13		df-naryf 49115	. . . . 5 ⊢ -aryF = (𝑥 ∈ ℕ0, 𝑛 ∈ V ↦ (𝑛 ↑m (𝑛 ↑m (0..^𝑥))))
14	13	mpondm0 7600	. . . 4 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = ∅)
15	12, 14	nsyl5 159	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = ∅)
16		simpl 482	. . . 4 ⊢ ((𝑋 ∈ V ∧ (𝑋 ↑m 𝐼) ∈ V) → 𝑋 ∈ V)
17		df-map 8768	. . . . 5 ⊢ ↑m = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∣ 𝑓:𝑦⟶𝑥})
18	17	mpondm0 7600	. . . 4 ⊢ (¬ (𝑋 ∈ V ∧ (𝑋 ↑m 𝐼) ∈ V) → (𝑋 ↑m (𝑋 ↑m 𝐼)) = ∅)
19	16, 18	nsyl5 159	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝑋 ↑m (𝑋 ↑m 𝐼)) = ∅)
20	15, 19	eqtr4d 2775	. 2 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
21	11, 20	pm2.61d1 180	1 ⊢ (𝑁 ∈ ℕ0 → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {cab 2715  Vcvv 3430  ∅c0 4274  ⟶wf 6488  (class class class)co 7360   ↑_m cmap 8766  0cc0 11029  ℕ₀cn0 12428  ..^cfzo 13599  -aryF cnaryf 49114

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-map 8768  df-naryf 49115

This theorem is referenced by:  naryfvalixp  49117  naryfvalel  49118