Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fabex | 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 5097 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 𝐹 ∈ V) |
5 | 1, 2, 4 | mp2an 416 | 1 ⊢ 𝐹 ∈ V |
Colors of variables: wff set class |
Syntax hints: ∧ wa 102 = wceq 1284 ∈ wcel 1433 {cab 2067 Vcvv 2601 ⟶wf 4918 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 ax-un 4188 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-v 2603 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-br 3786 df-opab 3840 df-xp 4369 df-rel 4370 df-cnv 4371 df-dm 4373 df-rn 4374 df-fun 4924 df-fn 4925 df-f 4926 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |