Theorem funfvdm 5697

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 5644	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐹‘𝐴) ∈ V)
2		unisng 3905	. . 3 ⊢ ((𝐹‘𝐴) ∈ V → ∪ {(𝐹‘𝐴)} = (𝐹‘𝐴))
3	1, 2	syl 14	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ∪ {(𝐹‘𝐴)} = (𝐹‘𝐴))
4		eqid 2229	. . . . 5 ⊢ dom 𝐹 = dom 𝐹
5		df-fn 5321	. . . . 5 ⊢ (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹))
6	4, 5	mpbiran2 947	. . . 4 ⊢ (𝐹 Fn dom 𝐹 ↔ Fun 𝐹)
7		fnsnfv 5693	. . . 4 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴}))
8	6, 7	sylanbr 285	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴}))
9	8	unieqd 3899	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ∪ {(𝐹‘𝐴)} = ∪ (𝐹 “ {𝐴}))
10	3, 9	eqtr3d 2264	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐹‘𝐴) = ∪ (𝐹 “ {𝐴}))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1395   ∈ wcel 2200  Vcvv 2799  {csn 3666  ∪ cuni 3888  dom cdm 4719   “ cima 4722  Fun wfun 5312   Fn wfn 5313  ‘cfv 5318

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-fv 5326

This theorem is referenced by:  funfvdm2  5698  fvun1  5700