![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fabex | Structured version Visualization version GIF version |
Description: Existence of a set of functions. (Contributed by NM, 3-Dec-2007.) |
Ref | Expression |
---|---|
fabex.1 | ⊢ 𝐴 ∈ V |
fabex.2 | ⊢ 𝐵 ∈ V |
fabex.3 | ⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} |
Ref | Expression |
---|---|
fabex | ⊢ 𝐹 ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fabex.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | fabex.2 | . 2 ⊢ 𝐵 ∈ V | |
3 | fabex.3 | . . 3 ⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} | |
4 | 3 | fabexg 7621 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 𝐹 ∈ V) |
5 | 1, 2, 4 | mp2an 691 | 1 ⊢ 𝐹 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 399 = wceq 1538 ∈ wcel 2111 {cab 2776 Vcvv 3441 ⟶wf 6320 |
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 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-xp 5525 df-rel 5526 df-cnv 5527 df-dm 5529 df-rn 5530 df-fun 6326 df-fn 6327 df-f 6328 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |