Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fabex | Unicode version |
Description: Existence of a set of functions. (Contributed by NM, 3-Dec-2007.) |
Ref | Expression |
---|---|
fabex.1 | |
fabex.2 | |
fabex.3 |
Ref | Expression |
---|---|
fabex |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fabex.1 | . 2 | |
2 | fabex.2 | . 2 | |
3 | fabex.3 | . . 3 | |
4 | 3 | fabexg 5280 | . 2 |
5 | 1, 2, 4 | mp2an 422 | 1 |
Colors of variables: wff set class |
Syntax hints: wa 103 wceq 1316 wcel 1465 cab 2103 cvv 2660 wf 5089 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-un 4325 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ral 2398 df-rex 2399 df-v 2662 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-xp 4515 df-rel 4516 df-cnv 4517 df-dm 4519 df-rn 4520 df-fun 5095 df-fn 5096 df-f 5097 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |