2arymaptf - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > 2arymaptf		Structured version Visualization version GIF version

Theorem 2arymaptf 49150

Description: The mapping of binary (endo)functions is a function into the set of binary operations. (Contributed by AV, 21-May-2024.)

**Hypothesis**
Ref	Expression
2arymaptf.h	⊢ 𝐻 = (ℎ ∈ (2-aryF 𝑋) ↦ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})))

**Assertion**
Ref	Expression
2arymaptf	⊢ (𝑋 ∈ 𝑉 → 𝐻:(2-aryF 𝑋)⟶(𝑋 ↑_m (𝑋 × 𝑋)))

Distinct variable groups: 𝑥,ℎ,𝑦,𝑋 ℎ,𝑉,𝑥 Allowed substitution hints: 𝐻(𝑥,𝑦,ℎ) 𝑉(𝑦)

Proof of Theorem 2arymaptf Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 774	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → ℎ ∈ (2-aryF 𝑋))
2		xp1st 7970	. . . . . 6 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → (1^st ‘𝑧) ∈ 𝑋)
3	2	adantl 482	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → (1^st ‘𝑧) ∈ 𝑋)
4		xp2nd 7971	. . . . . 6 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → (2^nd ‘𝑧) ∈ 𝑋)
5	4	adantl 482	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → (2^nd ‘𝑧) ∈ 𝑋)
6		fv2arycl 49146	. . . . 5 ⊢ ((ℎ ∈ (2-aryF 𝑋) ∧ (1^st ‘𝑧) ∈ 𝑋 ∧ (2^nd ‘𝑧) ∈ 𝑋) → (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩}) ∈ 𝑋)
7	1, 3, 5, 6	syl3anc 1379	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩}) ∈ 𝑋)
8		vex 3436	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
9		vex 3436	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
10	8, 9	op1std 7948	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (1^st ‘𝑧) = 𝑥)
11	10	opeq2d 4818	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ⟨0, (1^st ‘𝑧)⟩ = ⟨0, 𝑥⟩)
12	8, 9	op2ndd 7949	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (2^nd ‘𝑧) = 𝑦)
13	12	opeq2d 4818	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ⟨1, (2^nd ‘𝑧)⟩ = ⟨1, 𝑦⟩)
14	11, 13	preq12d 4680	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → {⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩} = {⟨0, 𝑥⟩, ⟨1, 𝑦⟩})
15	14	fveq2d 6838	. . . . . 6 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩}) = (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩}))
16	15	mpompt 7477	. . . . 5 ⊢ (𝑧 ∈ (𝑋 × 𝑋) ↦ (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩})) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩}))
17	16	eqcomi 2749	. . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) = (𝑧 ∈ (𝑋 × 𝑋) ↦ (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩}))
18	7, 17	fmptd 7062	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})):(𝑋 × 𝑋)⟶𝑋)
19		sqxpexg 7705	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 × 𝑋) ∈ V)
20		elmapg 8783	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑋 × 𝑋) ∈ V) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) ∈ (𝑋 ↑_m (𝑋 × 𝑋)) ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})):(𝑋 × 𝑋)⟶𝑋))
21	19, 20	mpdan 693	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) ∈ (𝑋 ↑_m (𝑋 × 𝑋)) ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})):(𝑋 × 𝑋)⟶𝑋))
22	21	adantr 481	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) ∈ (𝑋 ↑_m (𝑋 × 𝑋)) ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})):(𝑋 × 𝑋)⟶𝑋))
23	18, 22	mpbird 258	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) ∈ (𝑋 ↑_m (𝑋 × 𝑋)))
24		2arymaptf.h	. 2 ⊢ 𝐻 = (ℎ ∈ (2-aryF 𝑋) ↦ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})))
25	23, 24	fmptd 7062	1 ⊢ (𝑋 ∈ 𝑉 → 𝐻:(2-aryF 𝑋)⟶(𝑋 ↑_m (𝑋 × 𝑋)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 Vcvv 3432 {cpr 4564 ⟨cop 4568 ↦ cmpt 5160 × cxp 5623 ⟶wf 6488 ‘cfv 6492 (class class class)co 7363 ∈ cmpo 7365 1^st c1st 7936 2^nd c2nd 7937 ↑_m cmap 8770 0cc0 11036 1c1 11037 2c2 12234 -aryF cnaryf 49124

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-map 8772 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-n0 12436 df-z 12523 df-uz 12787 df-fz 13460 df-fzo 13607 df-naryf 49125

This theorem is referenced by: 2arymaptf1 49151 2arymaptfo 49152

W3C validator