Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ccatlid | Structured version Visualization version GIF version |
Description: Concatenation of a word by the empty word on the left. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Proof shortened by AV, 1-May-2020.) |
Ref | Expression |
---|---|
ccatlid | ⊢ (𝑆 ∈ Word 𝐵 → (∅ ++ 𝑆) = 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wrd0 13185 | . . . 4 ⊢ ∅ ∈ Word 𝐵 | |
2 | ccatvalfn 13218 | . . . 4 ⊢ ((∅ ∈ Word 𝐵 ∧ 𝑆 ∈ Word 𝐵) → (∅ ++ 𝑆) Fn (0..^((#‘∅) + (#‘𝑆)))) | |
3 | 1, 2 | mpan 702 | . . 3 ⊢ (𝑆 ∈ Word 𝐵 → (∅ ++ 𝑆) Fn (0..^((#‘∅) + (#‘𝑆)))) |
4 | hash0 13019 | . . . . . . . 8 ⊢ (#‘∅) = 0 | |
5 | 4 | oveq1i 6559 | . . . . . . 7 ⊢ ((#‘∅) + (#‘𝑆)) = (0 + (#‘𝑆)) |
6 | lencl 13179 | . . . . . . . . 9 ⊢ (𝑆 ∈ Word 𝐵 → (#‘𝑆) ∈ ℕ0) | |
7 | 6 | nn0cnd 11230 | . . . . . . . 8 ⊢ (𝑆 ∈ Word 𝐵 → (#‘𝑆) ∈ ℂ) |
8 | 7 | addid2d 10116 | . . . . . . 7 ⊢ (𝑆 ∈ Word 𝐵 → (0 + (#‘𝑆)) = (#‘𝑆)) |
9 | 5, 8 | syl5eq 2656 | . . . . . 6 ⊢ (𝑆 ∈ Word 𝐵 → ((#‘∅) + (#‘𝑆)) = (#‘𝑆)) |
10 | 9 | eqcomd 2616 | . . . . 5 ⊢ (𝑆 ∈ Word 𝐵 → (#‘𝑆) = ((#‘∅) + (#‘𝑆))) |
11 | 10 | oveq2d 6565 | . . . 4 ⊢ (𝑆 ∈ Word 𝐵 → (0..^(#‘𝑆)) = (0..^((#‘∅) + (#‘𝑆)))) |
12 | 11 | fneq2d 5896 | . . 3 ⊢ (𝑆 ∈ Word 𝐵 → ((∅ ++ 𝑆) Fn (0..^(#‘𝑆)) ↔ (∅ ++ 𝑆) Fn (0..^((#‘∅) + (#‘𝑆))))) |
13 | 3, 12 | mpbird 246 | . 2 ⊢ (𝑆 ∈ Word 𝐵 → (∅ ++ 𝑆) Fn (0..^(#‘𝑆))) |
14 | wrdfn 13174 | . 2 ⊢ (𝑆 ∈ Word 𝐵 → 𝑆 Fn (0..^(#‘𝑆))) | |
15 | 4 | a1i 11 | . . . . . . 7 ⊢ (𝑆 ∈ Word 𝐵 → (#‘∅) = 0) |
16 | 15, 9 | oveq12d 6567 | . . . . . 6 ⊢ (𝑆 ∈ Word 𝐵 → ((#‘∅)..^((#‘∅) + (#‘𝑆))) = (0..^(#‘𝑆))) |
17 | 16 | eleq2d 2673 | . . . . 5 ⊢ (𝑆 ∈ Word 𝐵 → (𝑥 ∈ ((#‘∅)..^((#‘∅) + (#‘𝑆))) ↔ 𝑥 ∈ (0..^(#‘𝑆)))) |
18 | 17 | biimpar 501 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ (0..^(#‘𝑆))) → 𝑥 ∈ ((#‘∅)..^((#‘∅) + (#‘𝑆)))) |
19 | ccatval2 13215 | . . . . 5 ⊢ ((∅ ∈ Word 𝐵 ∧ 𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ ((#‘∅)..^((#‘∅) + (#‘𝑆)))) → ((∅ ++ 𝑆)‘𝑥) = (𝑆‘(𝑥 − (#‘∅)))) | |
20 | 1, 19 | mp3an1 1403 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ ((#‘∅)..^((#‘∅) + (#‘𝑆)))) → ((∅ ++ 𝑆)‘𝑥) = (𝑆‘(𝑥 − (#‘∅)))) |
21 | 18, 20 | syldan 486 | . . 3 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ (0..^(#‘𝑆))) → ((∅ ++ 𝑆)‘𝑥) = (𝑆‘(𝑥 − (#‘∅)))) |
22 | 4 | oveq2i 6560 | . . . . 5 ⊢ (𝑥 − (#‘∅)) = (𝑥 − 0) |
23 | elfzoelz 12339 | . . . . . . . 8 ⊢ (𝑥 ∈ (0..^(#‘𝑆)) → 𝑥 ∈ ℤ) | |
24 | 23 | adantl 481 | . . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ (0..^(#‘𝑆))) → 𝑥 ∈ ℤ) |
25 | 24 | zcnd 11359 | . . . . . 6 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ (0..^(#‘𝑆))) → 𝑥 ∈ ℂ) |
26 | 25 | subid1d 10260 | . . . . 5 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ (0..^(#‘𝑆))) → (𝑥 − 0) = 𝑥) |
27 | 22, 26 | syl5eq 2656 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ (0..^(#‘𝑆))) → (𝑥 − (#‘∅)) = 𝑥) |
28 | 27 | fveq2d 6107 | . . 3 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ (0..^(#‘𝑆))) → (𝑆‘(𝑥 − (#‘∅))) = (𝑆‘𝑥)) |
29 | 21, 28 | eqtrd 2644 | . 2 ⊢ ((𝑆 ∈ Word 𝐵 ∧ 𝑥 ∈ (0..^(#‘𝑆))) → ((∅ ++ 𝑆)‘𝑥) = (𝑆‘𝑥)) |
30 | 13, 14, 29 | eqfnfvd 6222 | 1 ⊢ (𝑆 ∈ Word 𝐵 → (∅ ++ 𝑆) = 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∅c0 3874 Fn wfn 5799 ‘cfv 5804 (class class class)co 6549 0cc0 9815 + caddc 9818 − cmin 10145 ℤcz 11254 ..^cfzo 12334 #chash 12979 Word cword 13146 ++ cconcat 13148 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-fzo 12335 df-hash 12980 df-word 13154 df-concat 13156 |
This theorem is referenced by: swrdccat 13344 swrdccat3a 13345 s0s1 13517 gsumccat 17201 frmdmnd 17219 frmd0 17220 efginvrel2 17963 efgcpbl2 17993 frgp0 17996 frgpnabllem1 18099 signstfvneq0 29975 elmrsubrn 30671 |
Copyright terms: Public domain | W3C validator |