![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > snex | GIF 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 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
snex | ⊢ {𝐴} ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snex.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | snexg 4116 | . 2 ⊢ (𝐴 ∈ V → {𝐴} ∈ V) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ {𝐴} ∈ V |
Colors of variables: wff set class |
Syntax hints: ∈ wcel 1481 Vcvv 2689 {csn 3532 |
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 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 |
This theorem depends on definitions: df-bi 116 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-v 2691 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 |
This theorem is referenced by: snelpw 4143 rext 4145 sspwb 4146 intid 4154 euabex 4155 mss 4156 exss 4157 opi1 4162 opeqsn 4182 opeqpr 4183 uniop 4185 snnex 4377 op1stb 4407 dtruex 4482 relop 4697 funopg 5165 fo1st 6063 fo2nd 6064 mapsn 6592 mapsnconst 6596 mapsncnv 6597 mapsnf1o2 6598 elixpsn 6637 ixpsnf1o 6638 ensn1 6698 mapsnen 6713 xpsnen 6723 endisj 6726 xpcomco 6728 xpassen 6732 phplem2 6755 findcard2 6791 findcard2s 6792 ac6sfi 6800 xpfi 6826 djuex 6936 0ct 7000 finomni 7020 exmidfodomrlemim 7074 djuassen 7090 cc2lem 7098 nn0ex 9007 fxnn0nninf 10242 inftonninf 10245 hashxp 10604 reldvg 12856 |
Copyright terms: Public domain | W3C validator |