Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > snex | Unicode version |
Description: A singleton whose element exists is a set. (Contributed by NM, 7-Aug-1994.) (Revised by Mario Carneiro, 24-May-2019.) |
Ref | Expression |
---|---|
snex.1 |
Ref | Expression |
---|---|
snex |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snex.1 | . 2 | |
2 | snexg 4108 | . 2 | |
3 | 1, 2 | ax-mp 5 | 1 |
Colors of variables: wff set class |
Syntax hints: wcel 1480 cvv 2686 csn 3527 |
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-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-v 2688 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 |
This theorem is referenced by: snelpw 4135 rext 4137 sspwb 4138 intid 4146 euabex 4147 mss 4148 exss 4149 opi1 4154 opeqsn 4174 opeqpr 4175 uniop 4177 snnex 4369 op1stb 4399 dtruex 4474 relop 4689 funopg 5157 fo1st 6055 fo2nd 6056 mapsn 6584 mapsnconst 6588 mapsncnv 6589 mapsnf1o2 6590 elixpsn 6629 ixpsnf1o 6630 ensn1 6690 mapsnen 6705 xpsnen 6715 endisj 6718 xpcomco 6720 xpassen 6724 phplem2 6747 findcard2 6783 findcard2s 6784 ac6sfi 6792 xpfi 6818 djuex 6928 0ct 6992 finomni 7012 exmidfodomrlemim 7057 djuassen 7073 nn0ex 8983 fxnn0nninf 10211 inftonninf 10214 hashxp 10572 reldvg 12817 |
Copyright terms: Public domain | W3C validator |