Theorem naryrcl 49712

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  (class class class)co 7418   ↑_m cmap 8840  0cc0 11193  ℕ₀cn0 12599  ..^cfzo 13781  -aryF cnaryf 49707

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5657  df-dm 5661  df-iota 6493  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-naryf 49708

This theorem is used by:  naryfvalelfv  49713  0aryfvalelfv  49716  fv1arycl  49718  1arymaptfv  49721  fv2arycl  49729  2arymaptfv  49732