![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > s1cl | Structured version Visualization version GIF version |
Description: A singleton word is a word. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) (Proof shortened by AV, 23-Nov-2018.) |
Ref | Expression |
---|---|
s1cl | ⊢ (𝐴 ∈ 𝐵 → 〈“𝐴”〉 ∈ Word 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | s1val 14572 | . 2 ⊢ (𝐴 ∈ 𝐵 → 〈“𝐴”〉 = {〈0, 𝐴〉}) | |
2 | snopiswrd 14497 | . 2 ⊢ (𝐴 ∈ 𝐵 → {〈0, 𝐴〉} ∈ Word 𝐵) | |
3 | 1, 2 | eqeltrd 2828 | 1 ⊢ (𝐴 ∈ 𝐵 → 〈“𝐴”〉 ∈ Word 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2099 {csn 4624 〈cop 4630 0cc0 11130 Word cword 14488 〈“cs1 14569 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-er 8718 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-nn 12235 df-n0 12495 df-z 12581 df-uz 12845 df-fz 13509 df-fzo 13652 df-word 14489 df-s1 14570 |
This theorem is referenced by: s1cld 14577 s1cli 14579 lsws1 14585 wrdl1s1 14588 ccatws1cl 14590 ccat2s1cl 14592 ccats1alpha 14593 ccats1val2 14601 lswccats1 14608 cats1un 14695 reuccatpfxs1 14721 s2prop 14882 s2eq2s1eq 14911 s3eqs2s1eq 14913 gsumws2 18785 gsumccatsn 18786 vrmdval 18800 vrmdf 18801 psgnpmtr 19456 efgsval2 19679 wwlksnext 29691 wwlksnextbi 29692 wwlksnextsurj 29698 rusgrnumwwlkb0 29769 loopclwwlkn1b 29839 clwwlkn1loopb 29840 clwwlkext2edg 29853 wwlksext2clwwlk 29854 clwwlknon1loop 29895 1ewlk 29912 1wlkdlem3 29936 numclwwlk2lem1lem 30139 numclwwlk1lem2foalem 30148 numclwwlk1lem2fo 30155 signstf0 34136 signstfvn 34137 signstfvp 34139 signstfvneq0 34140 signstfvc 34142 signsvf1 34149 signsvfn 34150 signshf 34156 upwordsing 46193 |
Copyright terms: Public domain | W3C validator |