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 5385 | . 2 |
5 | 1, 2, 4 | mp2an 424 | 1 |
Colors of variables: wff set class |
Syntax hints: wa 103 wceq 1348 wcel 2141 cab 2156 cvv 2730 wf 5194 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-v 2732 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-opab 4051 df-xp 4617 df-rel 4618 df-cnv 4619 df-dm 4621 df-rn 4622 df-fun 5200 df-fn 5201 df-f 5202 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |