Theorem fnbrafvb 47932

Description: Equivalence of function value and binary relation, analogous to fnbrfvb 6938. (Contributed by Alexander van der Vekens, 25-May-2017.)

Assertion

Ref	Expression
fnbrafvb	⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹'''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶))

Proof of Theorem fnbrafvb

Step	Hyp	Ref	Expression
1		fndm 6645	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
2		eleq2 2855	. . . . . . . 8 ⊢ (𝐴 = dom 𝐹 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ dom 𝐹))
3	2	eqcoms 2774	. . . . . . 7 ⊢ (dom 𝐹 = 𝐴 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ dom 𝐹))
4	3	biimpd 232	. . . . . 6 ⊢ (dom 𝐹 = 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ∈ dom 𝐹))
5	1, 4	syl 18	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ∈ dom 𝐹))
6	5	imp 412	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ dom 𝐹)
7		snssi 4756	. . . . . . 7 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴)
8	7	adantl 487	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴)
9		fnssresb 6664	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ {𝐵}) Fn {𝐵} ↔ {𝐵} ⊆ 𝐴))
10	9	adantr 486	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹 ↾ {𝐵}) Fn {𝐵} ↔ {𝐵} ⊆ 𝐴))
11	8, 10	mpbird 260	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹 ↾ {𝐵}) Fn {𝐵})
12		fnfun 6642	. . . . 5 ⊢ ((𝐹 ↾ {𝐵}) Fn {𝐵} → Fun (𝐹 ↾ {𝐵}))
13	11, 12	syl 18	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → Fun (𝐹 ↾ {𝐵}))
14		df-dfat 47897	. . . . 5 ⊢ (𝐹 defAt 𝐵 ↔ (𝐵 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐵})))
15		afvfundmfveq 47916	. . . . 5 ⊢ (𝐹 defAt 𝐵 → (𝐹'''𝐵) = (𝐹‘𝐵))
16	14, 15	sylbir 238	. . . 4 ⊢ ((𝐵 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐵})) → (𝐹'''𝐵) = (𝐹‘𝐵))
17	6, 13, 16	syl2anc 596	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹'''𝐵) = (𝐹‘𝐵))
18	17	eqeq1d 2768	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹'''𝐵) = 𝐶 ↔ (𝐹‘𝐵) = 𝐶))
19		fnbrfvb 6938	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶))
20	18, 19	bitrd 282	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹'''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ⊆ wss 3908  {csn 4594   class class class wbr 5114  dom cdm 5666   ↾ cres 5668  Fun wfun 6537   Fn wfn 6538  ‘cfv 6543   defAt wdfat 47894  '''cafv 47895

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-res 5678  df-iota 6499  df-fun 6545  df-fn 6546  df-fv 6551  df-aiota 47863  df-dfat 47897  df-afv 47898

This theorem is used by:  fnopafvb  47933  funbrafvb  47934  dfafn5a  47938