Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > s3fv2 | Structured version Visualization version GIF version |
Description: Extract the third symbol from a length 3 string. (Contributed by Mario Carneiro, 13-Jan-2017.) |
Ref | Expression |
---|---|
s3fv2 | ⊢ (𝐶 ∈ 𝑉 → (〈“𝐴𝐵𝐶”〉‘2) = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-s3 14313 | . 2 ⊢ 〈“𝐴𝐵𝐶”〉 = (〈“𝐴𝐵”〉 ++ 〈“𝐶”〉) | |
2 | s2cli 14344 | . 2 ⊢ 〈“𝐴𝐵”〉 ∈ Word V | |
3 | s2len 14353 | . 2 ⊢ (♯‘〈“𝐴𝐵”〉) = 2 | |
4 | 1, 2, 3 | cats1fvn 14322 | 1 ⊢ (𝐶 ∈ 𝑉 → (〈“𝐴𝐵𝐶”〉‘2) = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6350 2c2 11784 〈“cs2 14305 〈“cs3 14306 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2711 ax-rep 5164 ax-sep 5177 ax-nul 5184 ax-pow 5242 ax-pr 5306 ax-un 7492 ax-cnex 10684 ax-resscn 10685 ax-1cn 10686 ax-icn 10687 ax-addcl 10688 ax-addrcl 10689 ax-mulcl 10690 ax-mulrcl 10691 ax-mulcom 10692 ax-addass 10693 ax-mulass 10694 ax-distr 10695 ax-i2m1 10696 ax-1ne0 10697 ax-1rid 10698 ax-rnegex 10699 ax-rrecex 10700 ax-cnre 10701 ax-pre-lttri 10702 ax-pre-lttrn 10703 ax-pre-ltadd 10704 ax-pre-mulgt0 10705 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2541 df-eu 2571 df-clab 2718 df-cleq 2731 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rab 3063 df-v 3402 df-sbc 3686 df-csb 3801 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4222 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-tp 4531 df-op 4533 df-uni 4807 df-int 4847 df-iun 4893 df-br 5041 df-opab 5103 df-mpt 5121 df-tr 5147 df-id 5439 df-eprel 5444 df-po 5452 df-so 5453 df-fr 5493 df-we 5495 df-xp 5541 df-rel 5542 df-cnv 5543 df-co 5544 df-dm 5545 df-rn 5546 df-res 5547 df-ima 5548 df-pred 6139 df-ord 6186 df-on 6187 df-lim 6188 df-suc 6189 df-iota 6308 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7140 df-ov 7186 df-oprab 7187 df-mpo 7188 df-om 7613 df-1st 7727 df-2nd 7728 df-wrecs 7989 df-recs 8050 df-rdg 8088 df-1o 8144 df-er 8333 df-en 8569 df-dom 8570 df-sdom 8571 df-fin 8572 df-card 9454 df-pnf 10768 df-mnf 10769 df-xr 10770 df-ltxr 10771 df-le 10772 df-sub 10963 df-neg 10964 df-nn 11730 df-2 11792 df-n0 11990 df-z 12076 df-uz 12338 df-fz 12995 df-fzo 13138 df-hash 13796 df-word 13969 df-concat 14025 df-s1 14052 df-s2 14312 df-s3 14313 |
This theorem is referenced by: s4fv2 14361 lsws3 14369 eqwrds3 14427 s3sndisj 14429 uncfval 17613 trgcgrg 26474 israg 26656 iscgra 26768 isinag 26797 isleag 26806 iseqlg 26826 2wlkdlem3 27878 2wlkond 27888 umgr2adedgwlk 27896 s3wwlks2on 27907 umgrwwlks2on 27908 elwwlks2 27917 elwspths2spth 27918 wlk2v2elem2 28106 3wlkdlem8 28117 s3rn 30808 s3f1 30809 cyc3fv2 30995 cyc3fv3 30996 circlemethhgt 32206 2cycld 32684 |
Copyright terms: Public domain | W3C validator |