Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ccat2s1p2OLD | Structured version Visualization version GIF version |
Description: Obsolete version of ccat2s1p2 13986 as of 20-Jan-2024. Extract the second of two concatenated singleton words. (Contributed by Alexander van der Vekens, 22-Sep-2018.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
ccat2s1p2OLD | ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = 𝑌) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | s1cl 13956 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → 〈“𝑋”〉 ∈ Word 𝑉) | |
2 | 1 | adantr 483 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 〈“𝑋”〉 ∈ Word 𝑉) |
3 | s1cl 13956 | . . . 4 ⊢ (𝑌 ∈ 𝑉 → 〈“𝑌”〉 ∈ Word 𝑉) | |
4 | 3 | adantl 484 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 〈“𝑌”〉 ∈ Word 𝑉) |
5 | 1z 12013 | . . . . . 6 ⊢ 1 ∈ ℤ | |
6 | 2z 12015 | . . . . . 6 ⊢ 2 ∈ ℤ | |
7 | 1lt2 11809 | . . . . . 6 ⊢ 1 < 2 | |
8 | fzolb 13045 | . . . . . 6 ⊢ (1 ∈ (1..^2) ↔ (1 ∈ ℤ ∧ 2 ∈ ℤ ∧ 1 < 2)) | |
9 | 5, 6, 7, 8 | mpbir3an 1337 | . . . . 5 ⊢ 1 ∈ (1..^2) |
10 | s1len 13960 | . . . . . 6 ⊢ (♯‘〈“𝑋”〉) = 1 | |
11 | s1len 13960 | . . . . . . . 8 ⊢ (♯‘〈“𝑌”〉) = 1 | |
12 | 10, 11 | oveq12i 7168 | . . . . . . 7 ⊢ ((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉)) = (1 + 1) |
13 | 1p1e2 11763 | . . . . . . 7 ⊢ (1 + 1) = 2 | |
14 | 12, 13 | eqtri 2844 | . . . . . 6 ⊢ ((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉)) = 2 |
15 | 10, 14 | oveq12i 7168 | . . . . 5 ⊢ ((♯‘〈“𝑋”〉)..^((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉))) = (1..^2) |
16 | 9, 15 | eleqtrri 2912 | . . . 4 ⊢ 1 ∈ ((♯‘〈“𝑋”〉)..^((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉))) |
17 | 16 | a1i 11 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 1 ∈ ((♯‘〈“𝑋”〉)..^((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉)))) |
18 | ccatval2 13932 | . . 3 ⊢ ((〈“𝑋”〉 ∈ Word 𝑉 ∧ 〈“𝑌”〉 ∈ Word 𝑉 ∧ 1 ∈ ((♯‘〈“𝑋”〉)..^((♯‘〈“𝑋”〉) + (♯‘〈“𝑌”〉)))) → ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = (〈“𝑌”〉‘(1 − (♯‘〈“𝑋”〉)))) | |
19 | 2, 4, 17, 18 | syl3anc 1367 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = (〈“𝑌”〉‘(1 − (♯‘〈“𝑋”〉)))) |
20 | 10 | oveq2i 7167 | . . . . . . 7 ⊢ (1 − (♯‘〈“𝑋”〉)) = (1 − 1) |
21 | 1m1e0 11710 | . . . . . . 7 ⊢ (1 − 1) = 0 | |
22 | 20, 21 | eqtri 2844 | . . . . . 6 ⊢ (1 − (♯‘〈“𝑋”〉)) = 0 |
23 | 22 | a1i 11 | . . . . 5 ⊢ (𝑌 ∈ 𝑉 → (1 − (♯‘〈“𝑋”〉)) = 0) |
24 | 23 | fveq2d 6674 | . . . 4 ⊢ (𝑌 ∈ 𝑉 → (〈“𝑌”〉‘(1 − (♯‘〈“𝑋”〉))) = (〈“𝑌”〉‘0)) |
25 | s1fv 13964 | . . . 4 ⊢ (𝑌 ∈ 𝑉 → (〈“𝑌”〉‘0) = 𝑌) | |
26 | 24, 25 | eqtrd 2856 | . . 3 ⊢ (𝑌 ∈ 𝑉 → (〈“𝑌”〉‘(1 − (♯‘〈“𝑋”〉))) = 𝑌) |
27 | 26 | adantl 484 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (〈“𝑌”〉‘(1 − (♯‘〈“𝑋”〉))) = 𝑌) |
28 | 19, 27 | eqtrd 2856 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((〈“𝑋”〉 ++ 〈“𝑌”〉)‘1) = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 0cc0 10537 1c1 10538 + caddc 10540 < clt 10675 − cmin 10870 2c2 11693 ℤcz 11982 ..^cfzo 13034 ♯chash 13691 Word cword 13862 ++ cconcat 13922 〈“cs1 13949 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-card 9368 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-n0 11899 df-z 11983 df-uz 12245 df-fz 12894 df-fzo 13035 df-hash 13692 df-word 13863 df-concat 13923 df-s1 13950 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |