| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1wlkdlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for 1wlkd 30127. (Contributed by AV, 22-Jan-2021.) |
| Ref | Expression |
|---|---|
| 1wlkd.p | ⊢ 𝑃 = 〈“𝑋𝑌”〉 |
| 1wlkd.f | ⊢ 𝐹 = 〈“𝐽”〉 |
| 1wlkd.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| 1wlkd.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| 1wlkdlem1 | ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1wlkd.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 2 | 1wlkd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 3 | 1, 2 | s2cld 14895 | . . 3 ⊢ (𝜑 → 〈“𝑋𝑌”〉 ∈ Word 𝑉) |
| 4 | wrdf 14541 | . . . 4 ⊢ (〈“𝑋𝑌”〉 ∈ Word 𝑉 → 〈“𝑋𝑌”〉:(0..^(♯‘〈“𝑋𝑌”〉))⟶𝑉) | |
| 5 | 1z 12627 | . . . . . . . 8 ⊢ 1 ∈ ℤ | |
| 6 | fzval3 13755 | . . . . . . . 8 ⊢ (1 ∈ ℤ → (0...1) = (0..^(1 + 1))) | |
| 7 | 5, 6 | ax-mp 5 | . . . . . . 7 ⊢ (0...1) = (0..^(1 + 1)) |
| 8 | 1wlkd.f | . . . . . . . . . 10 ⊢ 𝐹 = 〈“𝐽”〉 | |
| 9 | 8 | fveq2i 6884 | . . . . . . . . 9 ⊢ (♯‘𝐹) = (♯‘〈“𝐽”〉) |
| 10 | s1len 14629 | . . . . . . . . 9 ⊢ (♯‘〈“𝐽”〉) = 1 | |
| 11 | 9, 10 | eqtri 2759 | . . . . . . . 8 ⊢ (♯‘𝐹) = 1 |
| 12 | 11 | oveq2i 7421 | . . . . . . 7 ⊢ (0...(♯‘𝐹)) = (0...1) |
| 13 | s2len 14913 | . . . . . . . . 9 ⊢ (♯‘〈“𝑋𝑌”〉) = 2 | |
| 14 | df-2 12308 | . . . . . . . . 9 ⊢ 2 = (1 + 1) | |
| 15 | 13, 14 | eqtri 2759 | . . . . . . . 8 ⊢ (♯‘〈“𝑋𝑌”〉) = (1 + 1) |
| 16 | 15 | oveq2i 7421 | . . . . . . 7 ⊢ (0..^(♯‘〈“𝑋𝑌”〉)) = (0..^(1 + 1)) |
| 17 | 7, 12, 16 | 3eqtr4i 2769 | . . . . . 6 ⊢ (0...(♯‘𝐹)) = (0..^(♯‘〈“𝑋𝑌”〉)) |
| 18 | 17 | a1i 11 | . . . . 5 ⊢ (〈“𝑋𝑌”〉 ∈ Word 𝑉 → (0...(♯‘𝐹)) = (0..^(♯‘〈“𝑋𝑌”〉))) |
| 19 | 18 | feq2d 6697 | . . . 4 ⊢ (〈“𝑋𝑌”〉 ∈ Word 𝑉 → (〈“𝑋𝑌”〉:(0...(♯‘𝐹))⟶𝑉 ↔ 〈“𝑋𝑌”〉:(0..^(♯‘〈“𝑋𝑌”〉))⟶𝑉)) |
| 20 | 4, 19 | mpbird 257 | . . 3 ⊢ (〈“𝑋𝑌”〉 ∈ Word 𝑉 → 〈“𝑋𝑌”〉:(0...(♯‘𝐹))⟶𝑉) |
| 21 | 3, 20 | syl 17 | . 2 ⊢ (𝜑 → 〈“𝑋𝑌”〉:(0...(♯‘𝐹))⟶𝑉) |
| 22 | 1wlkd.p | . . 3 ⊢ 𝑃 = 〈“𝑋𝑌”〉 | |
| 23 | 22 | feq1i 6702 | . 2 ⊢ (𝑃:(0...(♯‘𝐹))⟶𝑉 ↔ 〈“𝑋𝑌”〉:(0...(♯‘𝐹))⟶𝑉) |
| 24 | 21, 23 | sylibr 234 | 1 ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶𝑉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 0cc0 11134 1c1 11135 + caddc 11137 2c2 12300 ℤcz 12593 ...cfz 13529 ..^cfzo 13676 ♯chash 14353 Word cword 14536 〈“cs1 14618 〈“cs2 14865 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-card 9958 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-nn 12246 df-2 12308 df-n0 12507 df-z 12594 df-uz 12858 df-fz 13530 df-fzo 13677 df-hash 14354 df-word 14537 df-concat 14594 df-s1 14619 df-s2 14872 |
| This theorem is referenced by: 1wlkd 30127 |
| Copyright terms: Public domain | W3C validator |