Theorem fnressn 7136

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 4589	. . . . . 6 ⊢ (𝑥 = 𝐵 → {𝑥} = {𝐵})
2	1	reseq2d 5961	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝐹 ↾ {𝑥}) = (𝐹 ↾ {𝐵}))
3		fveq2 6862	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵))
4		opeq12 4830	. . . . . . 7 ⊢ ((𝑥 = 𝐵 ∧ (𝐹‘𝑥) = (𝐹‘𝐵)) → ⟨𝑥, (𝐹‘𝑥)⟩ = ⟨𝐵, (𝐹‘𝐵)⟩)
5	3, 4	mpdan 697	. . . . . 6 ⊢ (𝑥 = 𝐵 → ⟨𝑥, (𝐹‘𝑥)⟩ = ⟨𝐵, (𝐹‘𝐵)⟩)
6	5	sneqd 4591	. . . . 5 ⊢ (𝑥 = 𝐵 → {⟨𝑥, (𝐹‘𝑥)⟩} = {⟨𝐵, (𝐹‘𝐵)⟩})
7	2, 6	eqeq12d 2777	. . . 4 ⊢ (𝑥 = 𝐵 → ((𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩} ↔ (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩}))
8	7	imbi2d 342	. . 3 ⊢ (𝑥 = 𝐵 → ((𝐹 Fn 𝐴 → (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩}) ↔ (𝐹 Fn 𝐴 → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩})))
9		vex 3457	. . . . . . 7 ⊢ 𝑥 ∈ V
10	9	snss 4740	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↔ {𝑥} ⊆ 𝐴)
11		fnssres 6639	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ {𝑥} ⊆ 𝐴) → (𝐹 ↾ {𝑥}) Fn {𝑥})
12	10, 11	sylan2b 603	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 ↾ {𝑥}) Fn {𝑥})
13		dffn2 6688	. . . . . 6 ⊢ ((𝐹 ↾ {𝑥}) Fn {𝑥} ↔ (𝐹 ↾ {𝑥}):{𝑥}⟶V)
14	9	fsn2 7113	. . . . . 6 ⊢ ((𝐹 ↾ {𝑥}):{𝑥}⟶V ↔ (((𝐹 ↾ {𝑥})‘𝑥) ∈ V ∧ (𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩}))
15		fvex 6875	. . . . . . . 8 ⊢ ((𝐹 ↾ {𝑥})‘𝑥) ∈ V
16	15	biantrur 538	. . . . . . 7 ⊢ ((𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩} ↔ (((𝐹 ↾ {𝑥})‘𝑥) ∈ V ∧ (𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩}))
17		vsnid 4619	. . . . . . . . . . 11 ⊢ 𝑥 ∈ {𝑥}
18		fvres 6881	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑥} → ((𝐹 ↾ {𝑥})‘𝑥) = (𝐹‘𝑥))
19	17, 18	ax-mp 5	. . . . . . . . . 10 ⊢ ((𝐹 ↾ {𝑥})‘𝑥) = (𝐹‘𝑥)
20	19	opeq2i 4832	. . . . . . . . 9 ⊢ ⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩ = ⟨𝑥, (𝐹‘𝑥)⟩
21	20	sneqi 4590	. . . . . . . 8 ⊢ {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩} = {⟨𝑥, (𝐹‘𝑥)⟩}
22	21	eqeq2i 2774	. . . . . . 7 ⊢ ((𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩} ↔ (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩})
23	16, 22	bitr3i 279	. . . . . 6 ⊢ ((((𝐹 ↾ {𝑥})‘𝑥) ∈ V ∧ (𝐹 ↾ {𝑥}) = {⟨𝑥, ((𝐹 ↾ {𝑥})‘𝑥)⟩}) ↔ (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩})
24	13, 14, 23	3bitri 299	. . . . 5 ⊢ ((𝐹 ↾ {𝑥}) Fn {𝑥} ↔ (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩})
25	12, 24	sylib 220	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩})
26	25	expcom 417	. . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐹 Fn 𝐴 → (𝐹 ↾ {𝑥}) = {⟨𝑥, (𝐹‘𝑥)⟩}))
27	8, 26	vtoclga 3540	. 2 ⊢ (𝐵 ∈ 𝐴 → (𝐹 Fn 𝐴 → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩}))
28	27	impcom 411	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹 ↾ {𝐵}) = {⟨𝐵, (𝐹‘𝐵)⟩})

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1559   ∈ wcel 2141  Vcvv 3453   ⊆ wss 3902  {csn 4579  ⟨cop 4585   ↾ cres 5645   Fn wfn 6511  ⟶wf 6512  ‘cfv 6516

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524

This theorem is referenced by:  funressn  7137  fressnfv  7138  fnsnsplit  7163  canthp1lem2  10605  fseq1p1m1  13597  resunimafz0  14452  dprd2da  20075  dmdprdpr  20082  dprdpr  20083  dpjlem  20084  pgpfaclem1  20114  islindf4  21878  xpstopnlem1  23857  ptcmpfi  23861  nosupbnd2lem1  27767  noinfbnd2lem1  27782  rnressnsn  32840  gsumhashmul  33208  selvply1rhm0  33784  esplyind  33833  subfacp1lem5  35495  cvmliftlem10  35605  poimirlem9  38089