Theorem fnbrafvb 48168

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

Assertion

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

Proof of Theorem fnbrafvb

Step	Hyp	Ref	Expression
1		fndm 6634	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
2		eleq2 2850	. . . . . . . 8 ⊢ (𝐴 = dom 𝐹 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ dom 𝐹))
3	2	eqcoms 2769	. . . . . . 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 4746	. . . . . . 7 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴)
8	7	adantl 487	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴)
9		fnssresb 6653	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ {𝐵}) Fn {𝐵} ↔ {𝐵} ⊆ 𝐴))
10	9	adantr 486	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹 ↾ {𝐵}) Fn {𝐵} ↔ {𝐵} ⊆ 𝐴))
11	8, 10	mpbird 260	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹 ↾ {𝐵}) Fn {𝐵})
12		fnfun 6631	. . . . 5 ⊢ ((𝐹 ↾ {𝐵}) Fn {𝐵} → Fun (𝐹 ↾ {𝐵}))
13	11, 12	syl 18	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → Fun (𝐹 ↾ {𝐵}))
14		df-dfat 48133	. . . . 5 ⊢ (𝐹 defAt 𝐵 ↔ (𝐵 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐵})))
15		afvfundmfveq 48152	. . . . 5 ⊢ (𝐹 defAt 𝐵 → (𝐹'''𝐵) = (𝐹‘𝐵))
16	14, 15	sylbir 238	. . . 4 ⊢ ((𝐵 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐵})) → (𝐹'''𝐵) = (𝐹‘𝐵))
17	6, 13, 16	syl2anc 596	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹'''𝐵) = (𝐹‘𝐵))
18	17	eqeq1d 2763	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹'''𝐵) = 𝐶 ↔ (𝐹‘𝐵) = 𝐶))
19		fnbrfvb 6927	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶))
20	18, 19	bitrd 282	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹'''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899  {csn 4584   class class class wbr 5103  dom cdm 5651   ↾ cres 5653  Fun wfun 6525   Fn wfn 6526  ‘cfv 6531   defAt wdfat 48130  '''cafv 48131

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-11 2194  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-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  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-int 4908  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-res 5663  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539  df-aiota 48099  df-dfat 48133  df-afv 48134

This theorem is used by:  fnopafvb  48169  funbrafvb  48170  dfafn5a  48174