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

Theorem pmex 8835
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 466 . . 3 ((Fun 𝑓𝑓 ⊆ (𝐴 × 𝐵)) ↔ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓))
21abbii 2829 . 2 {𝑓 ∣ (Fun 𝑓𝑓 ⊆ (𝐴 × 𝐵))} = {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)}
3 xpexg 7753 . . 3 ((𝐴𝐶𝐵𝐷) → (𝐴 × 𝐵) ∈ V)
4 abssexg 5351 . . 3 ((𝐴 × 𝐵) ∈ V → {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)} ∈ V)
53, 4syl 18 . 2 ((𝐴𝐶𝐵𝐷) → {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)} ∈ V)
62, 5eqeltrid 2866 1 ((𝐴𝐶𝐵𝐷) → {𝑓 ∣ (Fun 𝑓𝑓 ⊆ (𝐴 × 𝐵))} ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wcel 2145  {cab 2740  Vcvv 3453  wss 3902   × cxp 5657  Fun wfun 6531
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pow 5334  ax-pr 5402  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-opab 5172  df-xp 5665  df-rel 5666
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator