Theorem naryfval 49391

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 489	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
2		oveq2 7420	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = (0..^𝑁))
3		naryfval.i	. . . . . . . 8 ⊢ 𝐼 = (0..^𝑁)
4	2, 3	eqtr4di 2816	. . . . . . 7 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = 𝐼)
5	4	adantr 485	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (0..^𝑛) = 𝐼)
6	1, 5	oveq12d 7430	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ↑m (0..^𝑛)) = (𝑋 ↑m 𝐼))
7	1, 6	oveq12d 7430	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ↑m (𝑥 ↑m (0..^𝑛))) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
8		df-naryf 49390	. . . 4 ⊢ -aryF = (𝑛 ∈ ℕ0, 𝑥 ∈ V ↦ (𝑥 ↑m (𝑥 ↑m (0..^𝑛))))
9		ovex 7445	. . . 4 ⊢ (𝑋 ↑m (𝑋 ↑m 𝐼)) ∈ V
10	7, 8, 9	ovmpoa 7567	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
11	10	ex 417	. 2 ⊢ (𝑁 ∈ ℕ0 → (𝑋 ∈ V → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼))))
12		simpr 489	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → 𝑋 ∈ V)
13		df-naryf 49390	. . . . 5 ⊢ -aryF = (𝑥 ∈ ℕ0, 𝑛 ∈ V ↦ (𝑛 ↑m (𝑛 ↑m (0..^𝑥))))
14	13	mpondm0 7652	. . . 4 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = ∅)
15	12, 14	nsyl5 160	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = ∅)
16		simpl 487	. . . 4 ⊢ ((𝑋 ∈ V ∧ (𝑋 ↑m 𝐼) ∈ V) → 𝑋 ∈ V)
17		df-map 8827	. . . . 5 ⊢ ↑m = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∣ 𝑓:𝑦⟶𝑥})
18	17	mpondm0 7652	. . . 4 ⊢ (¬ (𝑋 ∈ V ∧ (𝑋 ↑m 𝐼) ∈ V) → (𝑋 ↑m (𝑋 ↑m 𝐼)) = ∅)
19	16, 18	nsyl5 160	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝑋 ↑m (𝑋 ↑m 𝐼)) = ∅)
20	15, 19	eqtr4d 2801	. 2 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
21	11, 20	pm2.61d1 182	1 ⊢ (𝑁 ∈ ℕ0 → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  {cab 2741  Vcvv 3455  ∅c0 4287  ⟶wf 6534  (class class class)co 7412   ↑_m cmap 8825  0cc0 11101  ℕ₀cn0 12505  ..^cfzo 13684  -aryF cnaryf 49389

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8827  df-naryf 49390

This theorem is referenced by:  naryfvalixp  49392  naryfvalel  49393