Theorem cfsetsnfsetf1 44061

Description: The mapping of the class of singleton functions into the class of constant functions is an injection. (Contributed by AV, 14-Sep-2024.)

Hypotheses

Ref	Expression
cfsetsnfsetfv.f	⊢ 𝐹 = {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)}
cfsetsnfsetfv.g	⊢ 𝐺 = {𝑥 ∣ 𝑥:{𝑌}⟶𝐵}
cfsetsnfsetfv.h	⊢ 𝐻 = (𝑔 ∈ 𝐺 ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑌)))

Assertion

Ref	Expression
cfsetsnfsetf1	⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → 𝐻:𝐺–1-1→𝐹)

Distinct variable groups:   𝐴,𝑎,𝑔   𝑔,𝐺   𝑔,𝑉   𝑔,𝑌   𝐴,𝑏,𝑓,𝑧   𝑥,𝐵   𝐵,𝑎,𝑏,𝑓   𝑔,𝐹   𝐺,𝑎,𝑏,𝑧   𝑉,𝑎,𝑏,𝑧   𝑌,𝑎,𝑏,𝑓,𝑧   𝑥,𝑌,𝑔   𝑔,𝑏,𝑓,𝑧

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑧,𝑔)   𝐹(𝑥,𝑧,𝑓,𝑎,𝑏)   𝐺(𝑥,𝑓)   𝐻(𝑥,𝑧,𝑓,𝑔,𝑎,𝑏)   𝑉(𝑥,𝑓)

Proof of Theorem cfsetsnfsetf1

Dummy variables 𝑚 𝑛 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cfsetsnfsetfv.f	. . 3 ⊢ 𝐹 = {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)}
2		cfsetsnfsetfv.g	. . 3 ⊢ 𝐺 = {𝑥 ∣ 𝑥:{𝑌}⟶𝐵}
3		cfsetsnfsetfv.h	. . 3 ⊢ 𝐻 = (𝑔 ∈ 𝐺 ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑌)))
4	1, 2, 3	cfsetsnfsetf 44060	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → 𝐻:𝐺⟶𝐹)
5	1, 2, 3	cfsetsnfsetfv 44059	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑚 ∈ 𝐺) → (𝐻‘𝑚) = (𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)))
6	5	ad2ant2r 746	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → (𝐻‘𝑚) = (𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)))
7	1, 2, 3	cfsetsnfsetfv 44059	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑛 ∈ 𝐺) → (𝐻‘𝑛) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)))
8	7	ad2ant2rl 748	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → (𝐻‘𝑛) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)))
9	6, 8	eqeq12d 2774	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝐻‘𝑚) = (𝐻‘𝑛) ↔ (𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌))))
10		fvexd 6678	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) ∧ 𝑎 ∈ 𝐴) → (𝑚‘𝑌) ∈ V)
11	10	ralrimiva 3113	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ∀𝑎 ∈ 𝐴 (𝑚‘𝑌) ∈ V)
12		mpteqb 6783	. . . . . 6 ⊢ (∀𝑎 ∈ 𝐴 (𝑚‘𝑌) ∈ V → ((𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)) ↔ ∀𝑎 ∈ 𝐴 (𝑚‘𝑌) = (𝑛‘𝑌)))
13	11, 12	syl 17	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)) ↔ ∀𝑎 ∈ 𝐴 (𝑚‘𝑌) = (𝑛‘𝑌)))
14		simplr 768	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → 𝑌 ∈ 𝐴)
15		idd 24	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) ∧ 𝑎 = 𝑌) → ((𝑚‘𝑌) = (𝑛‘𝑌) → (𝑚‘𝑌) = (𝑛‘𝑌)))
16	14, 15	rspcimdv 3533	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → (∀𝑎 ∈ 𝐴 (𝑚‘𝑌) = (𝑛‘𝑌) → (𝑚‘𝑌) = (𝑛‘𝑌)))
17		vex 3413	. . . . . . . . . 10 ⊢ 𝑚 ∈ V
18		feq1 6484	. . . . . . . . . 10 ⊢ (𝑥 = 𝑚 → (𝑥:{𝑌}⟶𝐵 ↔ 𝑚:{𝑌}⟶𝐵))
19	17, 18, 2	elab2 3593	. . . . . . . . 9 ⊢ (𝑚 ∈ 𝐺 ↔ 𝑚:{𝑌}⟶𝐵)
20		vex 3413	. . . . . . . . . 10 ⊢ 𝑛 ∈ V
21		feq1 6484	. . . . . . . . . 10 ⊢ (𝑥 = 𝑛 → (𝑥:{𝑌}⟶𝐵 ↔ 𝑛:{𝑌}⟶𝐵))
22	20, 21, 2	elab2 3593	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝐺 ↔ 𝑛:{𝑌}⟶𝐵)
23	19, 22	anbi12i 629	. . . . . . . 8 ⊢ ((𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺) ↔ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵))
24		simp3 1135	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → (𝑚‘𝑌) = (𝑛‘𝑌))
25		simp1r 1195	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → 𝑌 ∈ 𝐴)
26		fveq2 6663	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → (𝑚‘𝑦) = (𝑚‘𝑌))
27		fveq2 6663	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → (𝑛‘𝑦) = (𝑛‘𝑌))
28	26, 27	eqeq12d 2774	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑌 → ((𝑚‘𝑦) = (𝑛‘𝑦) ↔ (𝑚‘𝑌) = (𝑛‘𝑌)))
29	28	ralsng 4573	. . . . . . . . . . . 12 ⊢ (𝑌 ∈ 𝐴 → (∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦) ↔ (𝑚‘𝑌) = (𝑛‘𝑌)))
30	25, 29	syl 17	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → (∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦) ↔ (𝑚‘𝑌) = (𝑛‘𝑌)))
31	24, 30	mpbird 260	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → ∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦))
32		ffn 6503	. . . . . . . . . . . . 13 ⊢ (𝑚:{𝑌}⟶𝐵 → 𝑚 Fn {𝑌})
33		ffn 6503	. . . . . . . . . . . . 13 ⊢ (𝑛:{𝑌}⟶𝐵 → 𝑛 Fn {𝑌})
34	32, 33	anim12i 615	. . . . . . . . . . . 12 ⊢ ((𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) → (𝑚 Fn {𝑌} ∧ 𝑛 Fn {𝑌}))
35	34	3ad2ant2 1131	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → (𝑚 Fn {𝑌} ∧ 𝑛 Fn {𝑌}))
36		eqfnfv 6798	. . . . . . . . . . 11 ⊢ ((𝑚 Fn {𝑌} ∧ 𝑛 Fn {𝑌}) → (𝑚 = 𝑛 ↔ ∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦)))
37	35, 36	syl 17	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → (𝑚 = 𝑛 ↔ ∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦)))
38	31, 37	mpbird 260	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → 𝑚 = 𝑛)
39	38	3exp 1116	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → ((𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) → ((𝑚‘𝑌) = (𝑛‘𝑌) → 𝑚 = 𝑛)))
40	23, 39	syl5bi 245	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → ((𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺) → ((𝑚‘𝑌) = (𝑛‘𝑌) → 𝑚 = 𝑛)))
41	40	imp 410	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝑚‘𝑌) = (𝑛‘𝑌) → 𝑚 = 𝑛))
42	16, 41	syld 47	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → (∀𝑎 ∈ 𝐴 (𝑚‘𝑌) = (𝑛‘𝑌) → 𝑚 = 𝑛))
43	13, 42	sylbid 243	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)) → 𝑚 = 𝑛))
44	9, 43	sylbid 243	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝐻‘𝑚) = (𝐻‘𝑛) → 𝑚 = 𝑛))
45	44	ralrimivva 3120	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → ∀𝑚 ∈ 𝐺 ∀𝑛 ∈ 𝐺 ((𝐻‘𝑚) = (𝐻‘𝑛) → 𝑚 = 𝑛))
46		dff13 7011	. 2 ⊢ (𝐻:𝐺–1-1→𝐹 ↔ (𝐻:𝐺⟶𝐹 ∧ ∀𝑚 ∈ 𝐺 ∀𝑛 ∈ 𝐺 ((𝐻‘𝑚) = (𝐻‘𝑛) → 𝑚 = 𝑛)))
47	4, 45, 46	sylanbrc 586	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → 𝐻:𝐺–1-1→𝐹)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  {cab 2735  ∀wral 3070  ∃wrex 3071  Vcvv 3409  {csn 4525   ↦ cmpt 5116   Fn wfn 6335  ⟶wf 6336  –1-1→wf1 6337  ‘cfv 6340

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-rep 5160  ax-sep 5173  ax-nul 5180  ax-pr 5302

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-reu 3077  df-rab 3079  df-v 3411  df-sbc 3699  df-csb 3808  df-dif 3863  df-un 3865  df-in 3867  df-ss 3877  df-nul 4228  df-if 4424  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-iun 4888  df-br 5037  df-opab 5099  df-mpt 5117  df-id 5434  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-iota 6299  df-fun 6342  df-fn 6343  df-f 6344  df-f1 6345  df-fo 6346  df-f1o 6347  df-fv 6348

This theorem is referenced by:  cfsetsnfsetf1o  44063