Theorem afvres 48515

Description: The value of a restricted function, analogous to fvres 6935. (Contributed by Alexander van der Vekens, 22-Jul-2017.)

Assertion

Ref	Expression
afvres	⊢ (𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵)'''𝐴) = (𝐹'''𝐴))

Proof of Theorem afvres

Step	Hyp	Ref	Expression
1		elin 4096	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝐵 ∩ dom 𝐹) ↔ (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ dom 𝐹))
2	1	biimpri 231	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ dom 𝐹) → 𝐴 ∈ (𝐵 ∩ dom 𝐹))
3		dmres 6020	. . . . . . . 8 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
4	2, 3	eleqtrrdi 2875	. . . . . . 7 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ dom 𝐹) → 𝐴 ∈ dom (𝐹 ↾ 𝐵))
5	4	ex 418	. . . . . 6 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ dom 𝐹 → 𝐴 ∈ dom (𝐹 ↾ 𝐵)))
6		snssi 4748	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵)
7	6	resabs1d 6016	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵) ↾ {𝐴}) = (𝐹 ↾ {𝐴}))
8	7	eqcomd 2769	. . . . . . . 8 ⊢ (𝐴 ∈ 𝐵 → (𝐹 ↾ {𝐴}) = ((𝐹 ↾ 𝐵) ↾ {𝐴}))
9	8	funeqd 6589	. . . . . . 7 ⊢ (𝐴 ∈ 𝐵 → (Fun (𝐹 ↾ {𝐴}) ↔ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴})))
10	9	biimpd 232	. . . . . 6 ⊢ (𝐴 ∈ 𝐵 → (Fun (𝐹 ↾ {𝐴}) → Fun ((𝐹 ↾ 𝐵) ↾ {𝐴})))
11	5, 10	anim12d 621	. . . . 5 ⊢ (𝐴 ∈ 𝐵 → ((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) → (𝐴 ∈ dom (𝐹 ↾ 𝐵) ∧ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴}))))
12	11	impcom 413	. . . 4 ⊢ (((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → (𝐴 ∈ dom (𝐹 ↾ 𝐵) ∧ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴})))
13		df-dfat 48463	. . . . 5 ⊢ ((𝐹 ↾ 𝐵) defAt 𝐴 ↔ (𝐴 ∈ dom (𝐹 ↾ 𝐵) ∧ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴})))
14		afvfundmfveq 48481	. . . . 5 ⊢ ((𝐹 ↾ 𝐵) defAt 𝐴 → ((𝐹 ↾ 𝐵)'''𝐴) = ((𝐹 ↾ 𝐵)‘𝐴))
15	13, 14	sylbir 238	. . . 4 ⊢ ((𝐴 ∈ dom (𝐹 ↾ 𝐵) ∧ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴})) → ((𝐹 ↾ 𝐵)'''𝐴) = ((𝐹 ↾ 𝐵)‘𝐴))
16	12, 15	syl 18	. . 3 ⊢ (((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → ((𝐹 ↾ 𝐵)'''𝐴) = ((𝐹 ↾ 𝐵)‘𝐴))
17		fvres 6935	. . . 4 ⊢ (𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝐴) = (𝐹‘𝐴))
18	17	adantl 487	. . 3 ⊢ (((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → ((𝐹 ↾ 𝐵)‘𝐴) = (𝐹‘𝐴))
19		df-dfat 48463	. . . . . 6 ⊢ (𝐹 defAt 𝐴 ↔ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})))
20		afvfundmfveq 48481	. . . . . 6 ⊢ (𝐹 defAt 𝐴 → (𝐹'''𝐴) = (𝐹‘𝐴))
21	19, 20	sylbir 238	. . . . 5 ⊢ ((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) → (𝐹'''𝐴) = (𝐹‘𝐴))
22	21	eqcomd 2769	. . . 4 ⊢ ((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) → (𝐹‘𝐴) = (𝐹'''𝐴))
23	22	adantr 486	. . 3 ⊢ (((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → (𝐹‘𝐴) = (𝐹'''𝐴))
24	16, 18, 23	3eqtrd 2802	. 2 ⊢ (((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → ((𝐹 ↾ 𝐵)'''𝐴) = (𝐹'''𝐴))
25		pm3.4 822	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ 𝐵 → 𝐴 ∈ dom 𝐹))
26	1, 25	sylbi 220	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝐵 ∩ dom 𝐹) → (𝐴 ∈ 𝐵 → 𝐴 ∈ dom 𝐹))
27	26, 3	eleq2s 2882	. . . . . . . 8 ⊢ (𝐴 ∈ dom (𝐹 ↾ 𝐵) → (𝐴 ∈ 𝐵 → 𝐴 ∈ dom 𝐹))
28	27	com12 33	. . . . . . 7 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ dom (𝐹 ↾ 𝐵) → 𝐴 ∈ dom 𝐹))
29	7	funeqd 6589	. . . . . . . 8 ⊢ (𝐴 ∈ 𝐵 → (Fun ((𝐹 ↾ 𝐵) ↾ {𝐴}) ↔ Fun (𝐹 ↾ {𝐴})))
30	29	biimpd 232	. . . . . . 7 ⊢ (𝐴 ∈ 𝐵 → (Fun ((𝐹 ↾ 𝐵) ↾ {𝐴}) → Fun (𝐹 ↾ {𝐴})))
31	28, 30	anim12d 621	. . . . . 6 ⊢ (𝐴 ∈ 𝐵 → ((𝐴 ∈ dom (𝐹 ↾ 𝐵) ∧ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴})) → (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴}))))
32	31	con3d 153	. . . . 5 ⊢ (𝐴 ∈ 𝐵 → (¬ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) → ¬ (𝐴 ∈ dom (𝐹 ↾ 𝐵) ∧ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴}))))
33	32	impcom 413	. . . 4 ⊢ ((¬ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → ¬ (𝐴 ∈ dom (𝐹 ↾ 𝐵) ∧ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴})))
34		afvnfundmuv 48482	. . . . 5 ⊢ (¬ (𝐹 ↾ 𝐵) defAt 𝐴 → ((𝐹 ↾ 𝐵)'''𝐴) = V)
35	13, 34	sylnbir 334	. . . 4 ⊢ (¬ (𝐴 ∈ dom (𝐹 ↾ 𝐵) ∧ Fun ((𝐹 ↾ 𝐵) ↾ {𝐴})) → ((𝐹 ↾ 𝐵)'''𝐴) = V)
36	33, 35	syl 18	. . 3 ⊢ ((¬ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → ((𝐹 ↾ 𝐵)'''𝐴) = V)
37		afvnfundmuv 48482	. . . . . 6 ⊢ (¬ 𝐹 defAt 𝐴 → (𝐹'''𝐴) = V)
38	19, 37	sylnbir 334	. . . . 5 ⊢ (¬ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) → (𝐹'''𝐴) = V)
39	38	eqcomd 2769	. . . 4 ⊢ (¬ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) → V = (𝐹'''𝐴))
40	39	adantr 486	. . 3 ⊢ ((¬ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → V = (𝐹'''𝐴))
41	36, 40	eqtrd 2798	. 2 ⊢ ((¬ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ∧ 𝐴 ∈ 𝐵) → ((𝐹 ↾ 𝐵)'''𝐴) = (𝐹'''𝐴))
42	24, 41	pm2.61ian 824	1 ⊢ (𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵)'''𝐴) = (𝐹'''𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092  {csn 4588  dom cdm 5658   ↾ cres 5660  Fun wfun 6560  ‘cfv 6566   defAt wdfat 48460  '''cafv 48461

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-res 5670  df-iota 6520  df-fun 6568  df-fv 6574  df-aiota 48428  df-dfat 48463  df-afv 48464

This theorem is used by: (None)