Theorem naryrcl 48737

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 48733	. 2 ⊢ -aryF = (𝑥 ∈ ℕ0, 𝑛 ∈ V ↦ (𝑛 ↑m (𝑛 ↑m (0..^𝑥))))
2	1	elmpocl 7593	1 ⊢ (𝐹 ∈ (𝑁-aryF 𝑋) → (𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111  Vcvv 3436  (class class class)co 7352   ↑_m cmap 8756  0cc0 11012  ℕ₀cn0 12387  ..^cfzo 13560  -aryF cnaryf 48732

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5236  ax-nul 5246  ax-pr 5372

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-opab 5156  df-xp 5625  df-dm 5629  df-iota 6443  df-fv 6495  df-ov 7355  df-oprab 7356  df-mpo 7357  df-naryf 48733

This theorem is referenced by:  naryfvalelfv  48738  0aryfvalelfv  48741  fv1arycl  48743  1arymaptfv  48746  fv2arycl  48754  2arymaptfv  48757