| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wlkiswwlks2lem3 | Structured version Visualization version GIF version | ||
| Description: Lemma 3 for wlkiswwlks2 29874. (Contributed by Alexander van der Vekens, 20-Jul-2018.) |
| Ref | Expression |
|---|---|
| wlkiswwlks2lem.f | ⊢ 𝐹 = (𝑥 ∈ (0..^((♯‘𝑃) − 1)) ↦ (◡𝐸‘{(𝑃‘𝑥), (𝑃‘(𝑥 + 1))})) |
| Ref | Expression |
|---|---|
| wlkiswwlks2lem3 | ⊢ ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (♯‘𝑃)) → 𝑃:(0...(♯‘𝐹))⟶𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wlkiswwlks2lem.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ (0..^((♯‘𝑃) − 1)) ↦ (◡𝐸‘{(𝑃‘𝑥), (𝑃‘(𝑥 + 1))})) | |
| 2 | 1 | wlkiswwlks2lem1 29868 | . 2 ⊢ ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (♯‘𝑃)) → (♯‘𝐹) = ((♯‘𝑃) − 1)) |
| 3 | wrdf 14432 | . . . 4 ⊢ (𝑃 ∈ Word 𝑉 → 𝑃:(0..^(♯‘𝑃))⟶𝑉) | |
| 4 | lencl 14447 | . . . 4 ⊢ (𝑃 ∈ Word 𝑉 → (♯‘𝑃) ∈ ℕ0) | |
| 5 | nn0z 12503 | . . . . . . . . 9 ⊢ ((♯‘𝑃) ∈ ℕ0 → (♯‘𝑃) ∈ ℤ) | |
| 6 | fzoval 13567 | . . . . . . . . 9 ⊢ ((♯‘𝑃) ∈ ℤ → (0..^(♯‘𝑃)) = (0...((♯‘𝑃) − 1))) | |
| 7 | 5, 6 | syl 17 | . . . . . . . 8 ⊢ ((♯‘𝑃) ∈ ℕ0 → (0..^(♯‘𝑃)) = (0...((♯‘𝑃) − 1))) |
| 8 | oveq2 7363 | . . . . . . . . 9 ⊢ (((♯‘𝑃) − 1) = (♯‘𝐹) → (0...((♯‘𝑃) − 1)) = (0...(♯‘𝐹))) | |
| 9 | 8 | eqcoms 2741 | . . . . . . . 8 ⊢ ((♯‘𝐹) = ((♯‘𝑃) − 1) → (0...((♯‘𝑃) − 1)) = (0...(♯‘𝐹))) |
| 10 | 7, 9 | sylan9eq 2788 | . . . . . . 7 ⊢ (((♯‘𝑃) ∈ ℕ0 ∧ (♯‘𝐹) = ((♯‘𝑃) − 1)) → (0..^(♯‘𝑃)) = (0...(♯‘𝐹))) |
| 11 | 10 | feq2d 6643 | . . . . . 6 ⊢ (((♯‘𝑃) ∈ ℕ0 ∧ (♯‘𝐹) = ((♯‘𝑃) − 1)) → (𝑃:(0..^(♯‘𝑃))⟶𝑉 ↔ 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
| 12 | 11 | biimpcd 249 | . . . . 5 ⊢ (𝑃:(0..^(♯‘𝑃))⟶𝑉 → (((♯‘𝑃) ∈ ℕ0 ∧ (♯‘𝐹) = ((♯‘𝑃) − 1)) → 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
| 13 | 12 | expd 415 | . . . 4 ⊢ (𝑃:(0..^(♯‘𝑃))⟶𝑉 → ((♯‘𝑃) ∈ ℕ0 → ((♯‘𝐹) = ((♯‘𝑃) − 1) → 𝑃:(0...(♯‘𝐹))⟶𝑉))) |
| 14 | 3, 4, 13 | sylc 65 | . . 3 ⊢ (𝑃 ∈ Word 𝑉 → ((♯‘𝐹) = ((♯‘𝑃) − 1) → 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
| 15 | 14 | adantr 480 | . 2 ⊢ ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (♯‘𝑃)) → ((♯‘𝐹) = ((♯‘𝑃) − 1) → 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
| 16 | 2, 15 | mpd 15 | 1 ⊢ ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (♯‘𝑃)) → 𝑃:(0...(♯‘𝐹))⟶𝑉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {cpr 4579 class class class wbr 5095 ↦ cmpt 5176 ◡ccnv 5620 ⟶wf 6485 ‘cfv 6489 (class class class)co 7355 0cc0 11017 1c1 11018 + caddc 11020 ≤ cle 11158 − cmin 11355 ℕ0cn0 12392 ℤcz 12479 ...cfz 13414 ..^cfzo 13561 ♯chash 14244 Word cword 14427 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-er 8631 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-card 9843 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-nn 12137 df-n0 12393 df-z 12480 df-uz 12743 df-fz 13415 df-fzo 13562 df-hash 14245 df-word 14428 |
| This theorem is referenced by: wlkiswwlks2lem6 29873 |
| Copyright terms: Public domain | W3C validator |