1arymaptf1 - Mathbox for Alexander van der Vekens

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

Theorem 1arymaptf1 48674

Description: The mapping of unary (endo)functions is a one-to-one function into the set of endofunctions. (Contributed by AV, 19-May-2024.)

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

**Assertion**
Ref	Expression
1arymaptf1	⊢ (𝑋 ∈ 𝑉 → 𝐻:(1-aryF 𝑋)–1-1→(𝑋 ↑_m 𝑋))

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

Proof of Theorem 1arymaptf1 Dummy variables 𝑓 𝑔 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1arymaptfv.h	. . 3 ⊢ 𝐻 = (ℎ ∈ (1-aryF 𝑋) ↦ (𝑥 ∈ 𝑋 ↦ (ℎ‘{⟨0, 𝑥⟩})))
2	1	1arymaptf 48673	. 2 ⊢ (𝑋 ∈ 𝑉 → 𝐻:(1-aryF 𝑋)⟶(𝑋 ↑_m 𝑋))
3	1	1arymaptfv 48672	. . . . . 6 ⊢ (𝑓 ∈ (1-aryF 𝑋) → (𝐻‘𝑓) = (𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})))
4	3	ad2antrl 728	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → (𝐻‘𝑓) = (𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})))
5	1	1arymaptfv 48672	. . . . . 6 ⊢ (𝑔 ∈ (1-aryF 𝑋) → (𝐻‘𝑔) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})))
6	5	ad2antll 729	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → (𝐻‘𝑔) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})))
7	4, 6	eqeq12d 2747	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → ((𝐻‘𝑓) = (𝐻‘𝑔) ↔ (𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩}))))
8		fvex 6830	. . . . . . 7 ⊢ (𝑓‘{⟨0, 𝑥⟩}) ∈ V
9	8	rgenw 3051	. . . . . 6 ⊢ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) ∈ V
10		mpteqb 6943	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) ∈ V → ((𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})) ↔ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})))
11	9, 10	mp1i 13	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → ((𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})) ↔ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})))
12		1aryfvalel 48668	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (𝑓 ∈ (1-aryF 𝑋) ↔ 𝑓:(𝑋 ↑_m {0})⟶𝑋))
13		1aryfvalel 48668	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (𝑔 ∈ (1-aryF 𝑋) ↔ 𝑔:(𝑋 ↑_m {0})⟶𝑋))
14	12, 13	anbi12d 632	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → ((𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋)) ↔ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋)))
15		ffn 6646	. . . . . . . . . . 11 ⊢ (𝑓:(𝑋 ↑_m {0})⟶𝑋 → 𝑓 Fn (𝑋 ↑_m {0}))
16	15	adantr 480	. . . . . . . . . 10 ⊢ ((𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) → 𝑓 Fn (𝑋 ↑_m {0}))
17	16	3ad2ant2 1134	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → 𝑓 Fn (𝑋 ↑_m {0}))
18		ffn 6646	. . . . . . . . . . 11 ⊢ (𝑔:(𝑋 ↑_m {0})⟶𝑋 → 𝑔 Fn (𝑋 ↑_m {0}))
19	18	adantl 481	. . . . . . . . . 10 ⊢ ((𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) → 𝑔 Fn (𝑋 ↑_m {0}))
20	19	3ad2ant2 1134	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → 𝑔 Fn (𝑋 ↑_m {0}))
21		elmapi 8768	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝑋 ↑_m {0}) → 𝑦:{0}⟶𝑋)
22		c0ex 11101	. . . . . . . . . . . . 13 ⊢ 0 ∈ V
23	22	fsn2 7064	. . . . . . . . . . . 12 ⊢ (𝑦:{0}⟶𝑋 ↔ ((𝑦‘0) ∈ 𝑋 ∧ 𝑦 = {⟨0, (𝑦‘0)⟩}))
24	21, 23	sylib 218	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝑋 ↑_m {0}) → ((𝑦‘0) ∈ 𝑋 ∧ 𝑦 = {⟨0, (𝑦‘0)⟩}))
25		opeq2 4821	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = (𝑦‘0) → ⟨0, 𝑥⟩ = ⟨0, (𝑦‘0)⟩)
26	25	sneqd 4583	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = (𝑦‘0) → {⟨0, 𝑥⟩} = {⟨0, (𝑦‘0)⟩})
27	26	fveq2d 6821	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (𝑦‘0) → (𝑓‘{⟨0, 𝑥⟩}) = (𝑓‘{⟨0, (𝑦‘0)⟩}))
28	26	fveq2d 6821	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (𝑦‘0) → (𝑔‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩}))
29	27, 28	eqeq12d 2747	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (𝑦‘0) → ((𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩}) ↔ (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
30	29	rspccv 3569	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩}) → ((𝑦‘0) ∈ 𝑋 → (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
31	30	3ad2ant3 1135	. . . . . . . . . . . . . 14 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → ((𝑦‘0) ∈ 𝑋 → (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
32	31	com12 32	. . . . . . . . . . . . 13 ⊢ ((𝑦‘0) ∈ 𝑋 → ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
33	32	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝑦‘0) ∈ 𝑋 ∧ 𝑦 = {⟨0, (𝑦‘0)⟩}) → ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
34		fveq2 6817	. . . . . . . . . . . . . 14 ⊢ (𝑦 = {⟨0, (𝑦‘0)⟩} → (𝑓‘𝑦) = (𝑓‘{⟨0, (𝑦‘0)⟩}))
35		fveq2 6817	. . . . . . . . . . . . . 14 ⊢ (𝑦 = {⟨0, (𝑦‘0)⟩} → (𝑔‘𝑦) = (𝑔‘{⟨0, (𝑦‘0)⟩}))
36	34, 35	eqeq12d 2747	. . . . . . . . . . . . 13 ⊢ (𝑦 = {⟨0, (𝑦‘0)⟩} → ((𝑓‘𝑦) = (𝑔‘𝑦) ↔ (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
37	36	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝑦‘0) ∈ 𝑋 ∧ 𝑦 = {⟨0, (𝑦‘0)⟩}) → ((𝑓‘𝑦) = (𝑔‘𝑦) ↔ (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
38	33, 37	sylibrd 259	. . . . . . . . . . 11 ⊢ (((𝑦‘0) ∈ 𝑋 ∧ 𝑦 = {⟨0, (𝑦‘0)⟩}) → ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → (𝑓‘𝑦) = (𝑔‘𝑦)))
39	24, 38	syl 17	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝑋 ↑_m {0}) → ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → (𝑓‘𝑦) = (𝑔‘𝑦)))
40	39	impcom 407	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) ∧ 𝑦 ∈ (𝑋 ↑_m {0})) → (𝑓‘𝑦) = (𝑔‘𝑦))
41	17, 20, 40	eqfnfvd 6962	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → 𝑓 = 𝑔)
42	41	3exp 1119	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → ((𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) → (∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩}) → 𝑓 = 𝑔)))
43	14, 42	sylbid 240	. . . . . 6 ⊢ (𝑋 ∈ 𝑉 → ((𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋)) → (∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩}) → 𝑓 = 𝑔)))
44	43	imp 406	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → (∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩}) → 𝑓 = 𝑔))
45	11, 44	sylbid 240	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → ((𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})) → 𝑓 = 𝑔))
46	7, 45	sylbid 240	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → ((𝐻‘𝑓) = (𝐻‘𝑔) → 𝑓 = 𝑔))
47	46	ralrimivva 3175	. 2 ⊢ (𝑋 ∈ 𝑉 → ∀𝑓 ∈ (1-aryF 𝑋)∀𝑔 ∈ (1-aryF 𝑋)((𝐻‘𝑓) = (𝐻‘𝑔) → 𝑓 = 𝑔))
48		dff13 7183	. 2 ⊢ (𝐻:(1-aryF 𝑋)–1-1→(𝑋 ↑_m 𝑋) ↔ (𝐻:(1-aryF 𝑋)⟶(𝑋 ↑_m 𝑋) ∧ ∀𝑓 ∈ (1-aryF 𝑋)∀𝑔 ∈ (1-aryF 𝑋)((𝐻‘𝑓) = (𝐻‘𝑔) → 𝑓 = 𝑔)))
49	2, 47, 48	sylanbrc 583	1 ⊢ (𝑋 ∈ 𝑉 → 𝐻:(1-aryF 𝑋)–1-1→(𝑋 ↑_m 𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ∀wral 3047 Vcvv 3436 {csn 4571 ⟨cop 4577 ↦ cmpt 5167 Fn wfn 6471 ⟶wf 6472 –1-1→wf1 6473 ‘cfv 6476 (class class class)co 7341 ↑_m cmap 8745 0cc0 11001 1c1 11002 -aryF cnaryf 48658

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-rep 5212 ax-sep 5229 ax-nul 5239 ax-pow 5298 ax-pr 5365 ax-un 7663 ax-cnex 11057 ax-resscn 11058 ax-1cn 11059 ax-icn 11060 ax-addcl 11061 ax-addrcl 11062 ax-mulcl 11063 ax-mulrcl 11064 ax-mulcom 11065 ax-addass 11066 ax-mulass 11067 ax-distr 11068 ax-i2m1 11069 ax-1ne0 11070 ax-1rid 11071 ax-rnegex 11072 ax-rrecex 11073 ax-cnre 11074 ax-pre-lttri 11075 ax-pre-lttrn 11076 ax-pre-ltadd 11077 ax-pre-mulgt0 11078

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 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-nel 3033 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-iun 4938 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5506 df-eprel 5511 df-po 5519 df-so 5520 df-fr 5564 df-we 5566 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-1st 7916 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-er 8617 df-map 8747 df-en 8865 df-dom 8866 df-sdom 8867 df-pnf 11143 df-mnf 11144 df-xr 11145 df-ltxr 11146 df-le 11147 df-sub 11341 df-neg 11342 df-nn 12121 df-n0 12377 df-z 12464 df-uz 12728 df-fz 13403 df-fzo 13550 df-naryf 48659

This theorem is referenced by: 1arymaptf1o 48676

W3C validator