Theorem funfvdm 5549

Description: A simplified expression for the value of a function when we know it's a function. (Contributed by Jim Kingdon, 1-Jan-2019.)

Assertion

Ref	Expression
funfvdm	⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐹‘𝐴) = ∪ (𝐹 “ {𝐴}))

Proof of Theorem funfvdm

Step	Hyp	Ref	Expression
1		funfvex 5503	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐹‘𝐴) ∈ V)
2		unisng 3806	. . 3 ⊢ ((𝐹‘𝐴) ∈ V → ∪ {(𝐹‘𝐴)} = (𝐹‘𝐴))
3	1, 2	syl 14	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ∪ {(𝐹‘𝐴)} = (𝐹‘𝐴))
4		eqid 2165	. . . . 5 ⊢ dom 𝐹 = dom 𝐹
5		df-fn 5191	. . . . 5 ⊢ (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹))
6	4, 5	mpbiran2 931	. . . 4 ⊢ (𝐹 Fn dom 𝐹 ↔ Fun 𝐹)
7		fnsnfv 5545	. . . 4 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴}))
8	6, 7	sylanbr 283	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴}))
9	8	unieqd 3800	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ∪ {(𝐹‘𝐴)} = ∪ (𝐹 “ {𝐴}))
10	3, 9	eqtr3d 2200	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐹‘𝐴) = ∪ (𝐹 “ {𝐴}))

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1343   ∈ wcel 2136  Vcvv 2726  {csn 3576  ∪ cuni 3789  dom cdm 4604   “ cima 4607  Fun wfun 5182   Fn wfn 5183  ‘cfv 5188

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-fv 5196

This theorem is referenced by:  funfvdm2  5550  fvun1  5552