![]() |
Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > naryfvalixp | Structured version Visualization version GIF version |
Description: The set of the n-ary (endo)functions on a class 𝑋 expressed with the notation of infinite Cartesian products. (Contributed by AV, 19-May-2024.) |
Ref | Expression |
---|---|
naryfval.i | ⊢ 𝐼 = (0..^𝑁) |
Ref | Expression |
---|---|
naryfvalixp | ⊢ (𝑁 ∈ ℕ0 → (𝑁-aryF 𝑋) = (𝑋 ↑m X𝑥 ∈ 𝐼 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | naryfval.i | . . . . . 6 ⊢ 𝐼 = (0..^𝑁) | |
2 | 1 | naryfval 47402 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼))) |
3 | 2 | adantr 480 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼))) |
4 | 1 | ovexi 7446 | . . . . . . 7 ⊢ 𝐼 ∈ V |
5 | 4 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝐼 ∈ V) |
6 | ixpconstg 8904 | . . . . . 6 ⊢ ((𝐼 ∈ V ∧ 𝑋 ∈ V) → X𝑥 ∈ 𝐼 𝑋 = (𝑋 ↑m 𝐼)) | |
7 | 5, 6 | sylan 579 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → X𝑥 ∈ 𝐼 𝑋 = (𝑋 ↑m 𝐼)) |
8 | 7 | oveq2d 7428 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑋 ↑m X𝑥 ∈ 𝐼 𝑋) = (𝑋 ↑m (𝑋 ↑m 𝐼))) |
9 | 3, 8 | eqtr4d 2774 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = (𝑋 ↑m X𝑥 ∈ 𝐼 𝑋)) |
10 | 9 | ex 412 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑋 ∈ V → (𝑁-aryF 𝑋) = (𝑋 ↑m X𝑥 ∈ 𝐼 𝑋))) |
11 | simpr 484 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → 𝑋 ∈ V) | |
12 | df-naryf 47401 | . . . . 5 ⊢ -aryF = (𝑥 ∈ ℕ0, 𝑛 ∈ V ↦ (𝑛 ↑m (𝑛 ↑m (0..^𝑥)))) | |
13 | 12 | mpondm0 7651 | . . . 4 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝑋 ∈ V) → (𝑁-aryF 𝑋) = ∅) |
14 | 11, 13 | nsyl5 159 | . . 3 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = ∅) |
15 | reldmmap 8833 | . . . 4 ⊢ Rel dom ↑m | |
16 | 15 | ovprc1 7451 | . . 3 ⊢ (¬ 𝑋 ∈ V → (𝑋 ↑m X𝑥 ∈ 𝐼 𝑋) = ∅) |
17 | 14, 16 | eqtr4d 2774 | . 2 ⊢ (¬ 𝑋 ∈ V → (𝑁-aryF 𝑋) = (𝑋 ↑m X𝑥 ∈ 𝐼 𝑋)) |
18 | 10, 17 | pm2.61d1 180 | 1 ⊢ (𝑁 ∈ ℕ0 → (𝑁-aryF 𝑋) = (𝑋 ↑m X𝑥 ∈ 𝐼 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2105 Vcvv 3473 ∅c0 4322 (class class class)co 7412 ↑m cmap 8824 Xcixp 8895 0cc0 11114 ℕ0cn0 12477 ..^cfzo 13632 -aryF cnaryf 47400 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-sbc 3778 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-ov 7415 df-oprab 7416 df-mpo 7417 df-map 8826 df-ixp 8896 df-naryf 47401 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |