| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > efgsval2 | Structured version Visualization version GIF version | ||
| Description: Value of the auxiliary function 𝑆 defining a sequence of extensions. (Contributed by Mario Carneiro, 1-Oct-2015.) |
| Ref | Expression |
|---|---|
| efgval.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) |
| efgval.r | ⊢ ∼ = ( ~FG ‘𝐼) |
| efgval2.m | ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) |
| efgval2.t | ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) |
| efgred.d | ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) |
| efgred.s | ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1))) |
| Ref | Expression |
|---|---|
| efgsval2 | ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊 ∧ (𝐴 ++ 〈“𝐵”〉) ∈ dom 𝑆) → (𝑆‘(𝐴 ++ 〈“𝐵”〉)) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | efgval.w | . . . 4 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 2 | efgval.r | . . . 4 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 3 | efgval2.m | . . . 4 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) | |
| 4 | efgval2.t | . . . 4 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) | |
| 5 | efgred.d | . . . 4 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) | |
| 6 | efgred.s | . . . 4 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1))) | |
| 7 | 1, 2, 3, 4, 5, 6 | efgsval 19996 | . . 3 ⊢ ((𝐴 ++ 〈“𝐵”〉) ∈ dom 𝑆 → (𝑆‘(𝐴 ++ 〈“𝐵”〉)) = ((𝐴 ++ 〈“𝐵”〉)‘((♯‘(𝐴 ++ 〈“𝐵”〉)) − 1))) |
| 8 | s1cl 14790 | . . . . . . . . 9 ⊢ (𝐵 ∈ 𝑊 → 〈“𝐵”〉 ∈ Word 𝑊) | |
| 9 | ccatlen 14761 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 〈“𝐵”〉 ∈ Word 𝑊) → (♯‘(𝐴 ++ 〈“𝐵”〉)) = ((♯‘𝐴) + (♯‘〈“𝐵”〉))) | |
| 10 | 8, 9 | sylan2 605 | . . . . . . . 8 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → (♯‘(𝐴 ++ 〈“𝐵”〉)) = ((♯‘𝐴) + (♯‘〈“𝐵”〉))) |
| 11 | s1len 14794 | . . . . . . . . 9 ⊢ (♯‘〈“𝐵”〉) = 1 | |
| 12 | 11 | oveq2i 7462 | . . . . . . . 8 ⊢ ((♯‘𝐴) + (♯‘〈“𝐵”〉)) = ((♯‘𝐴) + 1) |
| 13 | 10, 12 | eqtrdi 2814 | . . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → (♯‘(𝐴 ++ 〈“𝐵”〉)) = ((♯‘𝐴) + 1)) |
| 14 | 13 | oveq1d 7466 | . . . . . 6 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → ((♯‘(𝐴 ++ 〈“𝐵”〉)) − 1) = (((♯‘𝐴) + 1) − 1)) |
| 15 | lencl 14719 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Word 𝑊 → (♯‘𝐴) ∈ ℕ0) | |
| 16 | 15 | nn0cnd 12709 | . . . . . . . . 9 ⊢ (𝐴 ∈ Word 𝑊 → (♯‘𝐴) ∈ ℂ) |
| 17 | ax-1cn 11297 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 18 | pncan 11602 | . . . . . . . . 9 ⊢ (((♯‘𝐴) ∈ ℂ ∧ 1 ∈ ℂ) → (((♯‘𝐴) + 1) − 1) = (♯‘𝐴)) | |
| 19 | 16, 17, 18 | sylancl 598 | . . . . . . . 8 ⊢ (𝐴 ∈ Word 𝑊 → (((♯‘𝐴) + 1) − 1) = (♯‘𝐴)) |
| 20 | 16 | addlidd 11550 | . . . . . . . 8 ⊢ (𝐴 ∈ Word 𝑊 → (0 + (♯‘𝐴)) = (♯‘𝐴)) |
| 21 | 19, 20 | eqtr4d 2801 | . . . . . . 7 ⊢ (𝐴 ∈ Word 𝑊 → (((♯‘𝐴) + 1) − 1) = (0 + (♯‘𝐴))) |
| 22 | 21 | adantr 486 | . . . . . 6 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → (((♯‘𝐴) + 1) − 1) = (0 + (♯‘𝐴))) |
| 23 | 14, 22 | eqtrd 2798 | . . . . 5 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → ((♯‘(𝐴 ++ 〈“𝐵”〉)) − 1) = (0 + (♯‘𝐴))) |
| 24 | 23 | fveq2d 6920 | . . . 4 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ++ 〈“𝐵”〉)‘((♯‘(𝐴 ++ 〈“𝐵”〉)) − 1)) = ((𝐴 ++ 〈“𝐵”〉)‘(0 + (♯‘𝐴)))) |
| 25 | simpl 488 | . . . . 5 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → 𝐴 ∈ Word 𝑊) | |
| 26 | 8 | adantl 487 | . . . . 5 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → 〈“𝐵”〉 ∈ Word 𝑊) |
| 27 | 1nn 12386 | . . . . . . . 8 ⊢ 1 ∈ ℕ | |
| 28 | 11, 27 | eqeltri 2860 | . . . . . . 7 ⊢ (♯‘〈“𝐵”〉) ∈ ℕ |
| 29 | lbfzo0 13874 | . . . . . . 7 ⊢ (0 ∈ (0..^(♯‘〈“𝐵”〉)) ↔ (♯‘〈“𝐵”〉) ∈ ℕ) | |
| 30 | 28, 29 | mpbir 234 | . . . . . 6 ⊢ 0 ∈ (0..^(♯‘〈“𝐵”〉)) |
| 31 | 30 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → 0 ∈ (0..^(♯‘〈“𝐵”〉))) |
| 32 | ccatval3 14765 | . . . . 5 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 〈“𝐵”〉 ∈ Word 𝑊 ∧ 0 ∈ (0..^(♯‘〈“𝐵”〉))) → ((𝐴 ++ 〈“𝐵”〉)‘(0 + (♯‘𝐴))) = (〈“𝐵”〉‘0)) | |
| 33 | 25, 26, 31, 32 | syl3anc 1399 | . . . 4 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ++ 〈“𝐵”〉)‘(0 + (♯‘𝐴))) = (〈“𝐵”〉‘0)) |
| 34 | s1fv 14800 | . . . . 5 ⊢ (𝐵 ∈ 𝑊 → (〈“𝐵”〉‘0) = 𝐵) | |
| 35 | 34 | adantl 487 | . . . 4 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → (〈“𝐵”〉‘0) = 𝐵) |
| 36 | 24, 33, 35 | 3eqtrd 2802 | . . 3 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ++ 〈“𝐵”〉)‘((♯‘(𝐴 ++ 〈“𝐵”〉)) − 1)) = 𝐵) |
| 37 | 7, 36 | sylan9eqr 2820 | . 2 ⊢ (((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ++ 〈“𝐵”〉) ∈ dom 𝑆) → (𝑆‘(𝐴 ++ 〈“𝐵”〉)) = 𝐵) |
| 38 | 37 | 3impa 1127 | 1 ⊢ ((𝐴 ∈ Word 𝑊 ∧ 𝐵 ∈ 𝑊 ∧ (𝐴 ++ 〈“𝐵”〉) ∈ dom 𝑆) → (𝑆‘(𝐴 ++ 〈“𝐵”〉)) = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {crab 3416 ∖ cdif 4048 ∅c0 4281 {csn 4588 〈cop 4840 〈cotp 4863 ∪ ciun 4956 ↦ cmpt 5192 I cid 5552 × cxp 5656 dom cdm 5658 ran crn 5659 ‘cfv 6566 (class class class)co 7451 ∈ cmpo 7453 1oc1o 8507 2oc2o 8508 ℂcc 11237 0cc0 11239 1c1 11240 + caddc 11242 − cmin 11580 ℕcn 12375 ...cfz 13679 ..^cfzo 13828 ♯chash 14515 Word cword 14699 ++ cconcat 14756 〈“cs1 14783 splice csplice 14940 〈“cs2 15034 ~FG cefg 19971 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-s1 14784 |
| This theorem is used by: efgsfo 20004 efgredlemd 20009 efgrelexlemb 20015 |
| Copyright terms: Public domain | W3C validator |