MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  funiun Structured version   Visualization version   GIF version

Theorem funiun 6900
Description: A function is a union of singletons of ordered pairs indexed by its domain. (Contributed by AV, 18-Sep-2020.)
Assertion
Ref Expression
funiun (Fun 𝐹𝐹 = 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹𝑥)⟩})
Distinct variable group:   𝑥,𝐹

Proof of Theorem funiun
StepHypRef Expression
1 funfn 6365 . . 3 (Fun 𝐹𝐹 Fn dom 𝐹)
2 dffn5 6712 . . 3 (𝐹 Fn dom 𝐹𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹𝑥)))
31, 2sylbb 222 . 2 (Fun 𝐹𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹𝑥)))
4 fvex 6671 . . 3 (𝐹𝑥) ∈ V
54dfmpt 6897 . 2 (𝑥 ∈ dom 𝐹 ↦ (𝐹𝑥)) = 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹𝑥)⟩}
63, 5eqtrdi 2809 1 (Fun 𝐹𝐹 = 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹𝑥)⟩})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1538  {csn 4522  cop 4528   ciun 4883  cmpt 5112  dom cdm 5524  Fun wfun 6329   Fn wfn 6330  cfv 6335
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-sep 5169  ax-nul 5176  ax-pr 5298
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-reu 3077  df-v 3411  df-sbc 3697  df-csb 3806  df-dif 3861  df-un 3863  df-in 3865  df-ss 3875  df-nul 4226  df-if 4421  df-sn 4523  df-pr 4525  df-op 4529  df-uni 4799  df-iun 4885  df-br 5033  df-opab 5095  df-mpt 5113  df-id 5430  df-xp 5530  df-rel 5531  df-cnv 5532  df-co 5533  df-dm 5534  df-rn 5535  df-iota 6294  df-fun 6337  df-fn 6338  df-f 6339  df-f1 6340  df-fo 6341  df-f1o 6342  df-fv 6343
This theorem is referenced by:  funopsn  6901
  Copyright terms: Public domain W3C validator