Theorem fnressn 7165

Description: A function restricted to a singleton. (Contributed by NM, 9-Oct-2004.)

Assertion

Ref	Expression
fnressn	⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩})

Proof of Theorem fnressn

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sneq 4590	. . . . . 6 ⊢ (𝑥 = 𝐵 → {𝑥} = {𝐵})
2	1	reseq2d 5970	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐹 ↾ {𝑥}) = (𝐹 ↾ {𝐵}))
3		fveq2 6888	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵))
4		opeq12 4841	. . . . . . 7 ⊢ ((𝑥 = 𝐵 ∧ (𝐹‘𝑥) = (𝐹‘𝐵)) → ⟨𝑥, (𝐹‘𝑥)⟩ = ⟨𝐵, (𝐹‘𝐵)⟩)
5	3, 4	mpdan 700	. . . . . 6 ⊢ (𝑥 = 𝐵 → ⟨𝑥, (𝐹‘𝑥)⟩ = ⟨𝐵, (𝐹‘𝐵)⟩)
6	5	sneqd 4592	. . . . 5 ⊢ (𝑥 = 𝐵 → {⟨𝑥, (𝐹‘𝑥)⟩} = {⟨𝐵, (𝐹‘𝐵)⟩})
7	2, 6	eqeq12d 2776	. . . 4 ⊢ (𝑥 = 𝐵 → ((𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩} ↔ (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩}))
8	7	imbi2d 343	. . 3 ⊢ (𝑥 = 𝐵 → ((𝐹 Fn 𝐴 → (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩}) ↔ (𝐹 Fn 𝐴 → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩})))
9		vex 3454	. . . . . . 7 ⊢ 𝑥 ∈ V
10	9	snss 4741	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↔ {𝑥} ⊆ 𝐴)
11		fnssres 6665	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ {𝑥} ⊆ 𝐴) → (𝐹 ↾ {𝑥}) Fn {𝑥})
12	10, 11	sylan2b 606	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 ↾ {𝑥}) Fn {𝑥})
13		dffn2 6714	. . . . . 6 ⊢ ((𝐹 ↾ {𝑥}) Fn {𝑥} ↔ (𝐹 ↾ {𝑥}):{𝑥}⟶V)
14	9	fsn2 7140	. . . . . 6 ⊢ ((𝐹 ↾ {𝑥}):{𝑥}⟶V ↔ (((𝐹 ↾ {𝑥})‘𝑥) ∈ V ∧ (𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩}))
15		fvex 6901	. . . . . . . 8 ⊢ ((𝐹 ↾ {𝑥})‘𝑥) ∈ V
16	15	biantrur 540	. . . . . . 7 ⊢ ((𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩} ↔ (((𝐹 ↾ {𝑥})‘𝑥) ∈ V ∧ (𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩}))
17		vsnid 4620	. . . . . . . . . . 11 ⊢ 𝑥 ∈ {𝑥}
18		fvres 6907	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑥} → ((𝐹 ↾ {𝑥})‘𝑥) = (𝐹‘𝑥))
19	17, 18	ax-mp 5	. . . . . . . . . 10 ⊢ ((𝐹 ↾ {𝑥})‘𝑥) = (𝐹‘𝑥)
20	19	opeq2i 4843	. . . . . . . . 9 ⊢ ⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩ = ⟨𝑥, (𝐹‘𝑥)⟩
21	20	sneqi 4591	. . . . . . . 8 ⊢ {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩} = {⟨𝑥, (𝐹‘𝑥)⟩}
22	21	eqeq2i 2773	. . . . . . 7 ⊢ ((𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩} ↔ (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩})
23	16, 22	bitr3i 280	. . . . . 6 ⊢ ((((𝐹 ↾ {𝑥})‘𝑥) ∈ V ∧ (𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩}) ↔ (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩})
24	13, 14, 23	3bitri 300	. . . . 5 ⊢ ((𝐹 ↾ {𝑥}) Fn {𝑥} ↔ (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩})
25	12, 24	sylib 221	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩})
26	25	expcom 419	. . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐹 Fn 𝐴 → (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩}))
27	8, 26	vtoclga 3536	. 2 ⊢ (𝐵 ∈ 𝐴 → (𝐹 Fn 𝐴 → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩}))
28	27	impcom 413	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3896  {csn 4584  ⟨cop 4834   ↾ cres 5652   Fn wfn 6536  ⟶wf 6537  ‘cfv 6541

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549

This theorem is used by:  funressn  7166  fressnfv  7167  fnsnsplit  7191  canthp1lem2  10743  fseq1p1m1  13737  resunimafz0  14595  dprd2da  20265  dmdprdpr  20272  dprdpr  20273  dpjlem  20274  pgpfaclem1  20304  islindf4  22151  xpstopnlem1  24135  ptcmpfi  24139  nosupbnd2lem1  28079  noinfbnd2lem1  28094  rnressnsn  33320  gsumhashmul  33676  selvply1rhm0  34206  esplyind  34255  subfacp1lem5  36037  cvmliftlem10  36147  poimirlem9  38654