Theorem naryfval 49449

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 7431	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = (0..^𝑁))
3		naryfval.i	. . . . . . . 8 ⊢ 𝐼 = (0..^𝑁)
4	2, 3	eqtr4di 2819	. . . . . . 7 ⊢ (𝑛 = 𝑁 → (0..^𝑛) = 𝐼)
5	4	adantr 486	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (0..^𝑛) = 𝐼)
6	1, 5	oveq12d 7441	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ↑m (0..^𝑛)) = (𝑋 ↑m 𝐼))
7	1, 6	oveq12d 7441	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ↑m (𝑥 ↑m (0..^𝑛))) = (𝑋 ↑m (𝑋 ↑m 𝐼)))
8		df-naryf 49448	. . . 4 ⊢ -aryF = (𝑛 ∈ ℕ0, 𝑥 ∈ V ↦ (𝑥 ↑m (𝑥 ↑m (0..^𝑛))))
9		ovex 7456	. . . 4 ⊢ (𝑋 ↑m (𝑋 ↑m 𝐼)) ∈ V
10	7, 8, 9	ovmpoa 7578	. . 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 49448	. . . . 5 ⊢ -aryF = (𝑥 ∈ ℕ0, 𝑛 ∈ V ↦ (𝑛 ↑m (𝑛 ↑m (0..^𝑥))))
14	13	mpondm0 7663	. . . 4 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = ∅)
15	12, 14	nsyl5 160	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = ∅)
16		simpl 488	. . . 4 ⊢ ((𝑋 ∈ V ∧ (𝑋 ↑m 𝐼) ∈ V) → 𝑋 ∈ V)
17		df-map 8835	. . . . 5 ⊢ ↑m = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∣ 𝑓:𝑦⟶𝑥})
18	17	mpondm0 7663	. . . 4 ⊢ (¬ (𝑋 ∈ V ∧ (𝑋 ↑m 𝐼) ∈ V) → (𝑋 ↑m (𝑋 ↑m 𝐼)) = ∅)
19	16, 18	nsyl5 160	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝑋 ↑m (𝑋 ↑m 𝐼)) = ∅)
20	15, 19	eqtr4d 2804	. 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 1570   ∈ wcel 2146  {cab 2744  Vcvv 3458  ∅c0 4289  ⟶wf 6539  (class class class)co 7423   ↑_m cmap 8833  0cc0 11118  ℕ₀cn0 12522  ..^cfzo 13701  -aryF cnaryf 49447

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-map 8835  df-naryf 49448

This theorem is used by:  naryfvalixp  49450  naryfvalel  49451