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

Theorem pmex 8870
Description: The class of all partial functions from one set to another is a set. (Contributed by NM, 15-Nov-2007.)
Assertion
Ref Expression
pmex ((𝐴𝐶𝐵𝐷) → {𝑓 ∣ (Fun 𝑓𝑓 ⊆ (𝐴 × 𝐵))} ∈ V)
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓
Allowed substitution hints:   𝐶(𝑓)   𝐷(𝑓)

Proof of Theorem pmex
StepHypRef Expression
1 ancom 460 . . 3 ((Fun 𝑓𝑓 ⊆ (𝐴 × 𝐵)) ↔ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓))
21abbii 2807 . 2 {𝑓 ∣ (Fun 𝑓𝑓 ⊆ (𝐴 × 𝐵))} = {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)}
3 xpexg 7769 . . 3 ((𝐴𝐶𝐵𝐷) → (𝐴 × 𝐵) ∈ V)
4 abssexg 5388 . . 3 ((𝐴 × 𝐵) ∈ V → {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)} ∈ V)
53, 4syl 17 . 2 ((𝐴𝐶𝐵𝐷) → {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)} ∈ V)
62, 5eqeltrid 2843 1 ((𝐴𝐶𝐵𝐷) → {𝑓 ∣ (Fun 𝑓𝑓 ⊆ (𝐴 × 𝐵))} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2106  {cab 2712  Vcvv 3478  wss 3963   × cxp 5687  Fun wfun 6557
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-opab 5211  df-xp 5695  df-rel 5696
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator