Theorem cfsetsnfsetf1 47591

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 47590	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → 𝐻:𝐺⟶𝐹)
5	1, 2, 3	cfsetsnfsetfv 47589	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑚 ∈ 𝐺) → (𝐻‘𝑚) = (𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)))
6	5	ad2ant2r 755	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → (𝐻‘𝑚) = (𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)))
7	1, 2, 3	cfsetsnfsetfv 47589	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑛 ∈ 𝐺) → (𝐻‘𝑛) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)))
8	7	ad2ant2rl 757	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → (𝐻‘𝑛) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)))
9	6, 8	eqeq12d 2768	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝐻‘𝑚) = (𝐻‘𝑛) ↔ (𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌))))
10		fvexd 6867	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) ∧ 𝑎 ∈ 𝐴) → (𝑚‘𝑌) ∈ V)
11	10	ralrimiva 3144	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ∀𝑎 ∈ 𝐴 (𝑚‘𝑌) ∈ V)
12		mpteqb 6980	. . . . . 6 ⊢ (∀𝑎 ∈ 𝐴 (𝑚‘𝑌) ∈ V → ((𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)) ↔ ∀𝑎 ∈ 𝐴 (𝑚‘𝑌) = (𝑛‘𝑌)))
13	11, 12	syl 17	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)) ↔ ∀𝑎 ∈ 𝐴 (𝑚‘𝑌) = (𝑛‘𝑌)))
14		simplr 776	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → 𝑌 ∈ 𝐴)
15		idd 24	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) ∧ 𝑎 = 𝑌) → ((𝑚‘𝑌) = (𝑛‘𝑌) → (𝑚‘𝑌) = (𝑛‘𝑌)))
16	14, 15	rspcimdv 3562	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → (∀𝑎 ∈ 𝐴 (𝑚‘𝑌) = (𝑛‘𝑌) → (𝑚‘𝑌) = (𝑛‘𝑌)))
17		vex 3448	. . . . . . . . . 10 ⊢ 𝑚 ∈ V
18		feq1 6654	. . . . . . . . . 10 ⊢ (𝑥 = 𝑚 → (𝑥:{𝑌}⟶𝐵 ↔ 𝑚:{𝑌}⟶𝐵))
19	17, 18, 2	elab2 3632	. . . . . . . . 9 ⊢ (𝑚 ∈ 𝐺 ↔ 𝑚:{𝑌}⟶𝐵)
20		vex 3448	. . . . . . . . . 10 ⊢ 𝑛 ∈ V
21		feq1 6654	. . . . . . . . . 10 ⊢ (𝑥 = 𝑛 → (𝑥:{𝑌}⟶𝐵 ↔ 𝑛:{𝑌}⟶𝐵))
22	20, 21, 2	elab2 3632	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝐺 ↔ 𝑛:{𝑌}⟶𝐵)
23	19, 22	anbi12i 636	. . . . . . . 8 ⊢ ((𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺) ↔ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵))
24		simp3 1147	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → (𝑚‘𝑌) = (𝑛‘𝑌))
25		simp1r 1208	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → 𝑌 ∈ 𝐴)
26		fveq2 6852	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → (𝑚‘𝑦) = (𝑚‘𝑌))
27		fveq2 6852	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → (𝑛‘𝑦) = (𝑛‘𝑌))
28	26, 27	eqeq12d 2768	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑌 → ((𝑚‘𝑦) = (𝑛‘𝑦) ↔ (𝑚‘𝑌) = (𝑛‘𝑌)))
29	28	ralsng 4624	. . . . . . . . . . . 12 ⊢ (𝑌 ∈ 𝐴 → (∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦) ↔ (𝑚‘𝑌) = (𝑛‘𝑌)))
30	25, 29	syl 17	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → (∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦) ↔ (𝑚‘𝑌) = (𝑛‘𝑌)))
31	24, 30	mpbird 259	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → ∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦))
32		ffn 6676	. . . . . . . . . . . . 13 ⊢ (𝑚:{𝑌}⟶𝐵 → 𝑚 Fn {𝑌})
33		ffn 6676	. . . . . . . . . . . . 13 ⊢ (𝑛:{𝑌}⟶𝐵 → 𝑛 Fn {𝑌})
34	32, 33	anim12i 621	. . . . . . . . . . . 12 ⊢ ((𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) → (𝑚 Fn {𝑌} ∧ 𝑛 Fn {𝑌}))
35	34	3ad2ant2 1143	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → (𝑚 Fn {𝑌} ∧ 𝑛 Fn {𝑌}))
36		eqfnfv 6996	. . . . . . . . . . 11 ⊢ ((𝑚 Fn {𝑌} ∧ 𝑛 Fn {𝑌}) → (𝑚 = 𝑛 ↔ ∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦)))
37	35, 36	syl 17	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → (𝑚 = 𝑛 ↔ ∀𝑦 ∈ {𝑌} (𝑚‘𝑦) = (𝑛‘𝑦)))
38	31, 37	mpbird 259	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) ∧ (𝑚‘𝑌) = (𝑛‘𝑌)) → 𝑚 = 𝑛)
39	38	3exp 1128	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → ((𝑚:{𝑌}⟶𝐵 ∧ 𝑛:{𝑌}⟶𝐵) → ((𝑚‘𝑌) = (𝑛‘𝑌) → 𝑚 = 𝑛)))
40	23, 39	biimtrid 244	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → ((𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺) → ((𝑚‘𝑌) = (𝑛‘𝑌) → 𝑚 = 𝑛)))
41	40	imp 409	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝑚‘𝑌) = (𝑛‘𝑌) → 𝑚 = 𝑛))
42	16, 41	syld 47	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → (∀𝑎 ∈ 𝐴 (𝑚‘𝑌) = (𝑛‘𝑌) → 𝑚 = 𝑛))
43	13, 42	sylbid 242	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝑎 ∈ 𝐴 ↦ (𝑚‘𝑌)) = (𝑎 ∈ 𝐴 ↦ (𝑛‘𝑌)) → 𝑚 = 𝑛))
44	9, 43	sylbid 242	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) ∧ (𝑚 ∈ 𝐺 ∧ 𝑛 ∈ 𝐺)) → ((𝐻‘𝑚) = (𝐻‘𝑛) → 𝑚 = 𝑛))
45	44	ralrimivva 3195	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → ∀𝑚 ∈ 𝐺 ∀𝑛 ∈ 𝐺 ((𝐻‘𝑚) = (𝐻‘𝑛) → 𝑚 = 𝑛))
46		dff13 7223	. 2 ⊢ (𝐻:𝐺–1-1→𝐹 ↔ (𝐻:𝐺⟶𝐹 ∧ ∀𝑚 ∈ 𝐺 ∀𝑛 ∈ 𝐺 ((𝐻‘𝑚) = (𝐻‘𝑛) → 𝑚 = 𝑛)))
47	4, 45, 46	sylanbrc 591	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → 𝐻:𝐺–1-1→𝐹)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1095   = wceq 1550   ∈ wcel 2132  {cab 2730  ∀wral 3066  ∃wrex 3076  Vcvv 3444  {csn 4572   ↦ cmpt 5171   Fn wfn 6501  ⟶wf 6502  –1-1→wf1 6503  ‘cfv 6506

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pr 5380

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-id 5531  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514

This theorem is referenced by:  cfsetsnfsetf1o  47593