Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ccatfv0 | Structured version Visualization version GIF version |
Description: The first symbol of a concatenation of two words is the first symbol of the first word if the first word is not empty. (Contributed by Alexander van der Vekens, 22-Sep-2018.) |
Ref | Expression |
---|---|
ccatfv0 | ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ 0 < (♯‘𝐴)) → ((𝐴 ++ 𝐵)‘0) = (𝐴‘0)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lencl 14234 | . . . . 5 ⊢ (𝐴 ∈ Word 𝑉 → (♯‘𝐴) ∈ ℕ0) | |
2 | elnnnn0b 12275 | . . . . . 6 ⊢ ((♯‘𝐴) ∈ ℕ ↔ ((♯‘𝐴) ∈ ℕ0 ∧ 0 < (♯‘𝐴))) | |
3 | 2 | biimpri 227 | . . . . 5 ⊢ (((♯‘𝐴) ∈ ℕ0 ∧ 0 < (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ) |
4 | 1, 3 | sylan 580 | . . . 4 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 0 < (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ) |
5 | lbfzo0 13425 | . . . 4 ⊢ (0 ∈ (0..^(♯‘𝐴)) ↔ (♯‘𝐴) ∈ ℕ) | |
6 | 4, 5 | sylibr 233 | . . 3 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 0 < (♯‘𝐴)) → 0 ∈ (0..^(♯‘𝐴))) |
7 | 6 | 3adant2 1130 | . 2 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ 0 < (♯‘𝐴)) → 0 ∈ (0..^(♯‘𝐴))) |
8 | ccatval1 14279 | . 2 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ 0 ∈ (0..^(♯‘𝐴))) → ((𝐴 ++ 𝐵)‘0) = (𝐴‘0)) | |
9 | 7, 8 | syld3an3 1408 | 1 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ 0 < (♯‘𝐴)) → ((𝐴 ++ 𝐵)‘0) = (𝐴‘0)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 class class class wbr 5076 ‘cfv 6435 (class class class)co 7277 0cc0 10869 < clt 11007 ℕcn 11971 ℕ0cn0 12231 ..^cfzo 13380 ♯chash 14042 Word cword 14215 ++ cconcat 14271 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5211 ax-sep 5225 ax-nul 5232 ax-pow 5290 ax-pr 5354 ax-un 7588 ax-cnex 10925 ax-resscn 10926 ax-1cn 10927 ax-icn 10928 ax-addcl 10929 ax-addrcl 10930 ax-mulcl 10931 ax-mulrcl 10932 ax-mulcom 10933 ax-addass 10934 ax-mulass 10935 ax-distr 10936 ax-i2m1 10937 ax-1ne0 10938 ax-1rid 10939 ax-rnegex 10940 ax-rrecex 10941 ax-cnre 10942 ax-pre-lttri 10943 ax-pre-lttrn 10944 ax-pre-ltadd 10945 ax-pre-mulgt0 10946 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3433 df-sbc 3718 df-csb 3834 df-dif 3891 df-un 3893 df-in 3895 df-ss 3905 df-pss 3907 df-nul 4259 df-if 4462 df-pw 4537 df-sn 4564 df-pr 4566 df-op 4570 df-uni 4842 df-int 4882 df-iun 4928 df-br 5077 df-opab 5139 df-mpt 5160 df-tr 5194 df-id 5491 df-eprel 5497 df-po 5505 df-so 5506 df-fr 5546 df-we 5548 df-xp 5597 df-rel 5598 df-cnv 5599 df-co 5600 df-dm 5601 df-rn 5602 df-res 5603 df-ima 5604 df-pred 6204 df-ord 6271 df-on 6272 df-lim 6273 df-suc 6274 df-iota 6393 df-fun 6437 df-fn 6438 df-f 6439 df-f1 6440 df-fo 6441 df-f1o 6442 df-fv 6443 df-riota 7234 df-ov 7280 df-oprab 7281 df-mpo 7282 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8095 df-wrecs 8126 df-recs 8200 df-rdg 8239 df-1o 8295 df-er 8496 df-en 8732 df-dom 8733 df-sdom 8734 df-fin 8735 df-card 9695 df-pnf 11009 df-mnf 11010 df-xr 11011 df-ltxr 11012 df-le 11013 df-sub 11205 df-neg 11206 df-nn 11972 df-n0 12232 df-z 12318 df-uz 12581 df-fz 13238 df-fzo 13381 df-hash 14043 df-word 14216 df-concat 14272 |
This theorem is referenced by: clwwlkccat 28351 clwwlkext2edg 28417 wwlksext2clwwlk 28418 clwwlknonccat 28457 numclwwlk2lem1lem 28703 |
Copyright terms: Public domain | W3C validator |