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

Theorem funiun 7013
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 6460 . . 3 (Fun 𝐹𝐹 Fn dom 𝐹)
2 dffn5 6822 . . 3 (𝐹 Fn dom 𝐹𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹𝑥)))
31, 2sylbb 218 . 2 (Fun 𝐹𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹𝑥)))
4 fvex 6781 . . 3 (𝐹𝑥) ∈ V
54dfmpt 7010 . 2 (𝑥 ∈ dom 𝐹 ↦ (𝐹𝑥)) = 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹𝑥)⟩}
63, 5eqtrdi 2795 1 (Fun 𝐹𝐹 = 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹𝑥)⟩})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  {csn 4566  cop 4572   ciun 4929  cmpt 5161  dom cdm 5588  Fun wfun 6424   Fn wfn 6425  cfv 6430
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-sep 5226  ax-nul 5233  ax-pr 5355
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438
This theorem is referenced by:  funopsn  7014
  Copyright terms: Public domain W3C validator