| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > repsw3 | Structured version Visualization version GIF version | ||
| Description: The "repeated symbol word" of length three. (Contributed by AV, 6-Nov-2018.) |
| Ref | Expression |
|---|---|
| repsw3 | ⊢ (𝑆 ∈ 𝑉 → (𝑆 repeatS 3) = 〈“𝑆𝑆𝑆”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-s3 14855 | . 2 ⊢ 〈“𝑆𝑆𝑆”〉 = (〈“𝑆𝑆”〉 ++ 〈“𝑆”〉) | |
| 2 | 2nn0 12491 | . . . 4 ⊢ 2 ∈ ℕ0 | |
| 3 | 1nn0 12490 | . . . 4 ⊢ 1 ∈ ℕ0 | |
| 4 | repswccat 14792 | . . . 4 ⊢ ((𝑆 ∈ 𝑉 ∧ 2 ∈ ℕ0 ∧ 1 ∈ ℕ0) → ((𝑆 repeatS 2) ++ (𝑆 repeatS 1)) = (𝑆 repeatS (2 + 1))) | |
| 5 | 2, 3, 4 | mp3an23 1473 | . . 3 ⊢ (𝑆 ∈ 𝑉 → ((𝑆 repeatS 2) ++ (𝑆 repeatS 1)) = (𝑆 repeatS (2 + 1))) |
| 6 | repsw2 14956 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (𝑆 repeatS 2) = 〈“𝑆𝑆”〉) | |
| 7 | repsw1 14789 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (𝑆 repeatS 1) = 〈“𝑆”〉) | |
| 8 | 6, 7 | oveq12d 7408 | . . 3 ⊢ (𝑆 ∈ 𝑉 → ((𝑆 repeatS 2) ++ (𝑆 repeatS 1)) = (〈“𝑆𝑆”〉 ++ 〈“𝑆”〉)) |
| 9 | 2p1e3 12352 | . . . . 5 ⊢ (2 + 1) = 3 | |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (2 + 1) = 3) |
| 11 | 10 | oveq2d 7406 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (𝑆 repeatS (2 + 1)) = (𝑆 repeatS 3)) |
| 12 | 5, 8, 11 | 3eqtr3d 2804 | . 2 ⊢ (𝑆 ∈ 𝑉 → (〈“𝑆𝑆”〉 ++ 〈“𝑆”〉) = (𝑆 repeatS 3)) |
| 13 | 1, 12 | eqtr2id 2809 | 1 ⊢ (𝑆 ∈ 𝑉 → (𝑆 repeatS 3) = 〈“𝑆𝑆𝑆”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 (class class class)co 7390 1c1 11067 + caddc 11069 2c2 12265 3c3 12266 ℕ0cn0 12474 ++ cconcat 14576 〈“cs1 14602 repeatS creps 14774 〈“cs2 14847 〈“cs3 14848 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 ax-cnex 11122 ax-resscn 11123 ax-1cn 11124 ax-icn 11125 ax-addcl 11126 ax-addrcl 11127 ax-mulcl 11128 ax-mulrcl 11129 ax-mulcom 11130 ax-addass 11131 ax-mulass 11132 ax-distr 11133 ax-i2m1 11134 ax-1ne0 11135 ax-1rid 11136 ax-rnegex 11137 ax-rrecex 11138 ax-cnre 11139 ax-pre-lttri 11140 ax-pre-lttrn 11141 ax-pre-ltadd 11142 ax-pre-mulgt0 11143 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-er 8671 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-card 9890 df-pnf 11211 df-mnf 11212 df-xr 11213 df-ltxr 11214 df-le 11215 df-sub 11409 df-neg 11410 df-nn 12204 df-2 12273 df-3 12274 df-n0 12475 df-z 12562 df-uz 12833 df-fz 13506 df-fzo 13653 df-hash 14337 df-concat 14577 df-s1 14603 df-reps 14775 df-s2 14854 df-s3 14855 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |