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 48563

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 48562	. 2 ⊢ (𝑋 ∈ 𝑉 → 𝐻:(1-aryF 𝑋)⟶(𝑋 ↑_m 𝑋))
3	1	1arymaptfv 48561	. . . . . 6 ⊢ (𝑓 ∈ (1-aryF 𝑋) → (𝐻‘𝑓) = (𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})))
4	3	ad2antrl 728	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → (𝐻‘𝑓) = (𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})))
5	1	1arymaptfv 48561	. . . . . 6 ⊢ (𝑔 ∈ (1-aryF 𝑋) → (𝐻‘𝑔) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})))
6	5	ad2antll 729	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → (𝐻‘𝑔) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})))
7	4, 6	eqeq12d 2753	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → ((𝐻‘𝑓) = (𝐻‘𝑔) ↔ (𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩}))))
8		fvex 6919	. . . . . . 7 ⊢ (𝑓‘{⟨0, 𝑥⟩}) ∈ V
9	8	rgenw 3065	. . . . . 6 ⊢ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) ∈ V
10		mpteqb 7035	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) ∈ V → ((𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})) ↔ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})))
11	9, 10	mp1i 13	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋))) → ((𝑥 ∈ 𝑋 ↦ (𝑓‘{⟨0, 𝑥⟩})) = (𝑥 ∈ 𝑋 ↦ (𝑔‘{⟨0, 𝑥⟩})) ↔ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})))
12		1aryfvalel 48557	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (𝑓 ∈ (1-aryF 𝑋) ↔ 𝑓:(𝑋 ↑_m {0})⟶𝑋))
13		1aryfvalel 48557	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (𝑔 ∈ (1-aryF 𝑋) ↔ 𝑔:(𝑋 ↑_m {0})⟶𝑋))
14	12, 13	anbi12d 632	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → ((𝑓 ∈ (1-aryF 𝑋) ∧ 𝑔 ∈ (1-aryF 𝑋)) ↔ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋)))
15		ffn 6736	. . . . . . . . . . 11 ⊢ (𝑓:(𝑋 ↑_m {0})⟶𝑋 → 𝑓 Fn (𝑋 ↑_m {0}))
16	15	adantr 480	. . . . . . . . . 10 ⊢ ((𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) → 𝑓 Fn (𝑋 ↑_m {0}))
17	16	3ad2ant2 1135	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → 𝑓 Fn (𝑋 ↑_m {0}))
18		ffn 6736	. . . . . . . . . . 11 ⊢ (𝑔:(𝑋 ↑_m {0})⟶𝑋 → 𝑔 Fn (𝑋 ↑_m {0}))
19	18	adantl 481	. . . . . . . . . 10 ⊢ ((𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) → 𝑔 Fn (𝑋 ↑_m {0}))
20	19	3ad2ant2 1135	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → 𝑔 Fn (𝑋 ↑_m {0}))
21		elmapi 8889	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝑋 ↑_m {0}) → 𝑦:{0}⟶𝑋)
22		c0ex 11255	. . . . . . . . . . . . 13 ⊢ 0 ∈ V
23	22	fsn2 7156	. . . . . . . . . . . 12 ⊢ (𝑦:{0}⟶𝑋 ↔ ((𝑦‘0) ∈ 𝑋 ∧ 𝑦 = {⟨0, (𝑦‘0)⟩}))
24	21, 23	sylib 218	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝑋 ↑_m {0}) → ((𝑦‘0) ∈ 𝑋 ∧ 𝑦 = {⟨0, (𝑦‘0)⟩}))
25		opeq2 4874	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = (𝑦‘0) → ⟨0, 𝑥⟩ = ⟨0, (𝑦‘0)⟩)
26	25	sneqd 4638	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = (𝑦‘0) → {⟨0, 𝑥⟩} = {⟨0, (𝑦‘0)⟩})
27	26	fveq2d 6910	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (𝑦‘0) → (𝑓‘{⟨0, 𝑥⟩}) = (𝑓‘{⟨0, (𝑦‘0)⟩}))
28	26	fveq2d 6910	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (𝑦‘0) → (𝑔‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩}))
29	27, 28	eqeq12d 2753	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (𝑦‘0) → ((𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩}) ↔ (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
30	29	rspccv 3619	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩}) → ((𝑦‘0) ∈ 𝑋 → (𝑓‘{⟨0, (𝑦‘0)⟩}) = (𝑔‘{⟨0, (𝑦‘0)⟩})))
31	30	3ad2ant3 1136	. . . . . . . . . . . . . 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 6906	. . . . . . . . . . . . . 14 ⊢ (𝑦 = {⟨0, (𝑦‘0)⟩} → (𝑓‘𝑦) = (𝑓‘{⟨0, (𝑦‘0)⟩}))
35		fveq2 6906	. . . . . . . . . . . . . 14 ⊢ (𝑦 = {⟨0, (𝑦‘0)⟩} → (𝑔‘𝑦) = (𝑔‘{⟨0, (𝑦‘0)⟩}))
36	34, 35	eqeq12d 2753	. . . . . . . . . . . . 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 7054	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑓:(𝑋 ↑_m {0})⟶𝑋 ∧ 𝑔:(𝑋 ↑_m {0})⟶𝑋) ∧ ∀𝑥 ∈ 𝑋 (𝑓‘{⟨0, 𝑥⟩}) = (𝑔‘{⟨0, 𝑥⟩})) → 𝑓 = 𝑔)
42	41	3exp 1120	. . . . . . 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 3202	. 2 ⊢ (𝑋 ∈ 𝑉 → ∀𝑓 ∈ (1-aryF 𝑋)∀𝑔 ∈ (1-aryF 𝑋)((𝐻‘𝑓) = (𝐻‘𝑔) → 𝑓 = 𝑔))
48		dff13 7275	. 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 1087 = wceq 1540 ∈ wcel 2108 ∀wral 3061 Vcvv 3480 {csn 4626 ⟨cop 4632 ↦ cmpt 5225 Fn wfn 6556 ⟶wf 6557 –1-1→wf1 6558 ‘cfv 6561 (class class class)co 7431 ↑_m cmap 8866 0cc0 11155 1c1 11156 -aryF cnaryf 48547

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-er 8745 df-map 8868 df-en 8986 df-dom 8987 df-sdom 8988 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-n0 12527 df-z 12614 df-uz 12879 df-fz 13548 df-fzo 13695 df-naryf 48548

This theorem is referenced by: 1arymaptf1o 48565

W3C validator