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 49006

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 769	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → ℎ ∈ (2-aryF 𝑋))
2		xp1st 7975	. . . . . 6 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → (1^st ‘𝑧) ∈ 𝑋)
3	2	adantl 481	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → (1^st ‘𝑧) ∈ 𝑋)
4		xp2nd 7976	. . . . . 6 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → (2^nd ‘𝑧) ∈ 𝑋)
5	4	adantl 481	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → (2^nd ‘𝑧) ∈ 𝑋)
6		fv2arycl 49002	. . . . 5 ⊢ ((ℎ ∈ (2-aryF 𝑋) ∧ (1^st ‘𝑧) ∈ 𝑋 ∧ (2^nd ‘𝑧) ∈ 𝑋) → (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩}) ∈ 𝑋)
7	1, 3, 5, 6	syl3anc 1374	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩}) ∈ 𝑋)
8		vex 3446	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
9		vex 3446	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
10	8, 9	op1std 7953	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (1^st ‘𝑧) = 𝑥)
11	10	opeq2d 4838	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ⟨0, (1^st ‘𝑧)⟩ = ⟨0, 𝑥⟩)
12	8, 9	op2ndd 7954	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (2^nd ‘𝑧) = 𝑦)
13	12	opeq2d 4838	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ⟨1, (2^nd ‘𝑧)⟩ = ⟨1, 𝑦⟩)
14	11, 13	preq12d 4700	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → {⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩} = {⟨0, 𝑥⟩, ⟨1, 𝑦⟩})
15	14	fveq2d 6846	. . . . . 6 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩}) = (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩}))
16	15	mpompt 7482	. . . . 5 ⊢ (𝑧 ∈ (𝑋 × 𝑋) ↦ (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩})) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩}))
17	16	eqcomi 2746	. . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) = (𝑧 ∈ (𝑋 × 𝑋) ↦ (ℎ‘{⟨0, (1^st ‘𝑧)⟩, ⟨1, (2^nd ‘𝑧)⟩}))
18	7, 17	fmptd 7068	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})):(𝑋 × 𝑋)⟶𝑋)
19		sqxpexg 7710	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 × 𝑋) ∈ V)
20		elmapg 8788	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑋 × 𝑋) ∈ V) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) ∈ (𝑋 ↑_m (𝑋 × 𝑋)) ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})):(𝑋 × 𝑋)⟶𝑋))
21	19, 20	mpdan 688	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) ∈ (𝑋 ↑_m (𝑋 × 𝑋)) ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})):(𝑋 × 𝑋)⟶𝑋))
22	21	adantr 480	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) ∈ (𝑋 ↑_m (𝑋 × 𝑋)) ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})):(𝑋 × 𝑋)⟶𝑋))
23	18, 22	mpbird 257	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ℎ ∈ (2-aryF 𝑋)) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})) ∈ (𝑋 ↑_m (𝑋 × 𝑋)))
24		2arymaptf.h	. 2 ⊢ 𝐻 = (ℎ ∈ (2-aryF 𝑋) ↦ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩, ⟨1, 𝑦⟩})))
25	23, 24	fmptd 7068	1 ⊢ (𝑋 ∈ 𝑉 → 𝐻:(2-aryF 𝑋)⟶(𝑋 ↑_m (𝑋 × 𝑋)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 {cpr 4584 ⟨cop 4588 ↦ cmpt 5181 × cxp 5630 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 1^st c1st 7941 2^nd c2nd 7942 ↑_m cmap 8775 0cc0 11038 1c1 11039 2c2 12212 -aryF cnaryf 48980

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-map 8777 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-n0 12414 df-z 12501 df-uz 12764 df-fz 13436 df-fzo 13583 df-naryf 48981

This theorem is referenced by: 2arymaptf1 49007 2arymaptfo 49008

W3C validator