Theorem naryrcl 46618

Description: Reverse closure for n-ary (endo)functions. (Contributed by AV, 14-May-2024.)

Hypothesis

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

Assertion

Ref	Expression
naryrcl	⊢ (𝐹 ∈ (𝑁-aryF 𝑋) → (𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V))

Proof of Theorem naryrcl

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

Step	Hyp	Ref	Expression
1		df-naryf 46614	. 2 ⊢ -aryF = (𝑥 ∈ ℕ0, 𝑛 ∈ V ↦ (𝑛 ↑m (𝑛 ↑m (0..^𝑥))))
2	1	elmpocl 7587	1 ⊢ (𝐹 ∈ (𝑁-aryF 𝑋) → (𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  Vcvv 3443  (class class class)co 7351   ↑_m cmap 8723  0cc0 11009  ℕ₀cn0 12371  ..^cfzo 13521  -aryF cnaryf 46613

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2708  ax-sep 5254  ax-nul 5261  ax-pr 5382

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ral 3063  df-rex 3072  df-rab 3406  df-v 3445  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4281  df-if 4485  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-br 5104  df-opab 5166  df-xp 5637  df-dm 5641  df-iota 6445  df-fv 6501  df-ov 7354  df-oprab 7355  df-mpo 7356  df-naryf 46614

This theorem is referenced by:  naryfvalelfv  46619  0aryfvalelfv  46622  fv1arycl  46624  1arymaptfv  46627  fv2arycl  46635  2arymaptfv  46638