![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > pmex | Structured version Visualization version GIF version |
Description: The class of all partial functions from one set to another is a set. (Contributed by NM, 15-Nov-2007.) |
Ref | Expression |
---|---|
pmex | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∣ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐴 × 𝐵))} ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ancom 459 | . . 3 ⊢ ((Fun 𝑓 ∧ 𝑓 ⊆ (𝐴 × 𝐵)) ↔ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)) | |
2 | 1 | abbii 2795 | . 2 ⊢ {𝑓 ∣ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐴 × 𝐵))} = {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)} |
3 | xpexg 7753 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 × 𝐵) ∈ V) | |
4 | abssexg 5382 | . . 3 ⊢ ((𝐴 × 𝐵) ∈ V → {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)} ∈ V) | |
5 | 3, 4 | syl 17 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∣ (𝑓 ⊆ (𝐴 × 𝐵) ∧ Fun 𝑓)} ∈ V) |
6 | 2, 5 | eqeltrid 2829 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∣ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐴 × 𝐵))} ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∈ wcel 2098 {cab 2702 Vcvv 3461 ⊆ wss 3944 × cxp 5676 Fun wfun 6543 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2703 df-cleq 2717 df-clel 2802 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-opab 5212 df-xp 5684 df-rel 5685 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |