![]() |
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 28818. (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 28812 | . 2 ⊢ ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (♯‘𝑃)) → (♯‘𝐹) = ((♯‘𝑃) − 1)) |
3 | wrdf 14406 | . . . 4 ⊢ (𝑃 ∈ Word 𝑉 → 𝑃:(0..^(♯‘𝑃))⟶𝑉) | |
4 | lencl 14420 | . . . 4 ⊢ (𝑃 ∈ Word 𝑉 → (♯‘𝑃) ∈ ℕ0) | |
5 | nn0z 12523 | . . . . . . . . 9 ⊢ ((♯‘𝑃) ∈ ℕ0 → (♯‘𝑃) ∈ ℤ) | |
6 | fzoval 13572 | . . . . . . . . 9 ⊢ ((♯‘𝑃) ∈ ℤ → (0..^(♯‘𝑃)) = (0...((♯‘𝑃) − 1))) | |
7 | 5, 6 | syl 17 | . . . . . . . 8 ⊢ ((♯‘𝑃) ∈ ℕ0 → (0..^(♯‘𝑃)) = (0...((♯‘𝑃) − 1))) |
8 | oveq2 7364 | . . . . . . . . 9 ⊢ (((♯‘𝑃) − 1) = (♯‘𝐹) → (0...((♯‘𝑃) − 1)) = (0...(♯‘𝐹))) | |
9 | 8 | eqcoms 2744 | . . . . . . . 8 ⊢ ((♯‘𝐹) = ((♯‘𝑃) − 1) → (0...((♯‘𝑃) − 1)) = (0...(♯‘𝐹))) |
10 | 7, 9 | sylan9eq 2796 | . . . . . . 7 ⊢ (((♯‘𝑃) ∈ ℕ0 ∧ (♯‘𝐹) = ((♯‘𝑃) − 1)) → (0..^(♯‘𝑃)) = (0...(♯‘𝐹))) |
11 | 10 | feq2d 6654 | . . . . . 6 ⊢ (((♯‘𝑃) ∈ ℕ0 ∧ (♯‘𝐹) = ((♯‘𝑃) − 1)) → (𝑃:(0..^(♯‘𝑃))⟶𝑉 ↔ 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
12 | 11 | biimpcd 248 | . . . . 5 ⊢ (𝑃:(0..^(♯‘𝑃))⟶𝑉 → (((♯‘𝑃) ∈ ℕ0 ∧ (♯‘𝐹) = ((♯‘𝑃) − 1)) → 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
13 | 12 | expd 416 | . . . 4 ⊢ (𝑃:(0..^(♯‘𝑃))⟶𝑉 → ((♯‘𝑃) ∈ ℕ0 → ((♯‘𝐹) = ((♯‘𝑃) − 1) → 𝑃:(0...(♯‘𝐹))⟶𝑉))) |
14 | 3, 4, 13 | sylc 65 | . . 3 ⊢ (𝑃 ∈ Word 𝑉 → ((♯‘𝐹) = ((♯‘𝑃) − 1) → 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
15 | 14 | adantr 481 | . 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 396 = wceq 1541 ∈ wcel 2106 {cpr 4588 class class class wbr 5105 ↦ cmpt 5188 ◡ccnv 5632 ⟶wf 6492 ‘cfv 6496 (class class class)co 7356 0cc0 11050 1c1 11051 + caddc 11053 ≤ cle 11189 − cmin 11384 ℕ0cn0 12412 ℤcz 12498 ...cfz 13423 ..^cfzo 13566 ♯chash 14229 Word cword 14401 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7671 ax-cnex 11106 ax-resscn 11107 ax-1cn 11108 ax-icn 11109 ax-addcl 11110 ax-addrcl 11111 ax-mulcl 11112 ax-mulrcl 11113 ax-mulcom 11114 ax-addass 11115 ax-mulass 11116 ax-distr 11117 ax-i2m1 11118 ax-1ne0 11119 ax-1rid 11120 ax-rnegex 11121 ax-rrecex 11122 ax-cnre 11123 ax-pre-lttri 11124 ax-pre-lttrn 11125 ax-pre-ltadd 11126 ax-pre-mulgt0 11127 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7312 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7802 df-1st 7920 df-2nd 7921 df-frecs 8211 df-wrecs 8242 df-recs 8316 df-rdg 8355 df-1o 8411 df-er 8647 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-card 9874 df-pnf 11190 df-mnf 11191 df-xr 11192 df-ltxr 11193 df-le 11194 df-sub 11386 df-neg 11387 df-nn 12153 df-n0 12413 df-z 12499 df-uz 12763 df-fz 13424 df-fzo 13567 df-hash 14230 df-word 14402 |
This theorem is referenced by: wlkiswwlks2lem6 28817 |
Copyright terms: Public domain | W3C validator |