Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fex2 | Unicode version |
Description: A function with bounded domain and range is a set. This version is proven without the Axiom of Replacement. (Contributed by Mario Carneiro, 24-Jun-2015.) |
Ref | Expression |
---|---|
fex2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpexg 4653 | . . 3 | |
2 | 1 | 3adant1 999 | . 2 |
3 | fssxp 5290 | . . 3 | |
4 | 3 | 3ad2ant1 1002 | . 2 |
5 | 2, 4 | ssexd 4068 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 w3a 962 wcel 1480 cvv 2686 wss 3071 cxp 4537 wf 5119 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-v 2688 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-xp 4545 df-rel 4546 df-cnv 4547 df-dm 4549 df-rn 4550 df-fun 5125 df-fn 5126 df-f 5127 |
This theorem is referenced by: elmapg 6555 f1oen2g 6649 f1dom2g 6650 dom3d 6668 mapxpen 6742 climrecvg1n 11117 cnpfval 12364 txcn 12444 blfvalps 12554 |
Copyright terms: Public domain | W3C validator |