Theorem fnressn 7160

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 4594	. . . . . 6 ⊢ (𝑥 = 𝐵 → {𝑥} = {𝐵})
2	1	reseq2d 5970	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐹 ↾ {𝑥}) = (𝐹 ↾ {𝐵}))
3		fveq2 6883	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵))
4		opeq12 4835	. . . . . . 7 ⊢ ((𝑥 = 𝐵 ∧ (𝐹‘𝑥) = (𝐹‘𝐵)) → ⟨𝑥, (𝐹‘𝑥)⟩ = ⟨𝐵, (𝐹‘𝐵)⟩)
5	3, 4	mpdan 700	. . . . . 6 ⊢ (𝑥 = 𝐵 → ⟨𝑥, (𝐹‘𝑥)⟩ = ⟨𝐵, (𝐹‘𝐵)⟩)
6	5	sneqd 4596	. . . . 5 ⊢ (𝑥 = 𝐵 → {⟨𝑥, (𝐹‘𝑥)⟩} = {⟨𝐵, (𝐹‘𝐵)⟩})
7	2, 6	eqeq12d 2777	. . . 4 ⊢ (𝑥 = 𝐵 → ((𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩} ↔ (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩}))
8	7	imbi2d 343	. . 3 ⊢ (𝑥 = 𝐵 → ((𝐹 Fn 𝐴 → (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩}) ↔ (𝐹 Fn 𝐴 → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩})))
9		vex 3455	. . . . . . 7 ⊢ 𝑥 ∈ V
10	9	snss 4745	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↔ {𝑥} ⊆ 𝐴)
11		fnssres 6660	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ {𝑥} ⊆ 𝐴) → (𝐹 ↾ {𝑥}) Fn {𝑥})
12	10, 11	sylan2b 606	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 ↾ {𝑥}) Fn {𝑥})
13		dffn2 6709	. . . . . 6 ⊢ ((𝐹 ↾ {𝑥}) Fn {𝑥} ↔ (𝐹 ↾ {𝑥}):{𝑥}⟶V)
14	9	fsn2 7135	. . . . . 6 ⊢ ((𝐹 ↾ {𝑥}):{𝑥}⟶V ↔ (((𝐹 ↾ {𝑥})‘𝑥) ∈ V ∧ (𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩}))
15		fvex 6896	. . . . . . . 8 ⊢ ((𝐹 ↾ {𝑥})‘𝑥) ∈ V
16	15	biantrur 540	. . . . . . 7 ⊢ ((𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩} ↔ (((𝐹 ↾ {𝑥})‘𝑥) ∈ V ∧ (𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩}))
17		vsnid 4624	. . . . . . . . . . 11 ⊢ 𝑥 ∈ {𝑥}
18		fvres 6902	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑥} → ((𝐹 ↾ {𝑥})‘𝑥) = (𝐹‘𝑥))
19	17, 18	ax-mp 5	. . . . . . . . . 10 ⊢ ((𝐹 ↾ {𝑥})‘𝑥) = (𝐹‘𝑥)
20	19	opeq2i 4837	. . . . . . . . 9 ⊢ ⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩ = ⟨𝑥, (𝐹‘𝑥)⟩
21	20	sneqi 4595	. . . . . . . 8 ⊢ {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩} = {⟨𝑥, (𝐹‘𝑥)⟩}
22	21	eqeq2i 2774	. . . . . . 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 3537	. 2 ⊢ (𝐵 ∈ 𝐴 → (𝐹 Fn 𝐴 → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩}))
28	27	impcom 413	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ⊆ wss 3899  {csn 4584  ⟨cop 4590   ↾ cres 5653   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545

This theorem is used by:  funressn  7161  fressnfv  7162  fnsnsplit  7187  canthp1lem2  10731  fseq1p1m1  13725  resunimafz0  14583  dprd2da  20251  dmdprdpr  20258  dprdpr  20259  dpjlem  20260  pgpfaclem1  20290  islindf4  22137  xpstopnlem1  24121  ptcmpfi  24125  nosupbnd2lem1  28065  noinfbnd2lem1  28080  rnressnsn  33264  gsumhashmul  33621  selvply1rhm0  34151  esplyind  34200  subfacp1lem5  35928  cvmliftlem10  36038  poimirlem9  38527