![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wlkdlem1 | Structured version Visualization version GIF version |
Description: Lemma 1 for wlkd 27476. (Contributed by AV, 7-Feb-2021.) |
Ref | Expression |
---|---|
wlkd.p | ⊢ (𝜑 → 𝑃 ∈ Word V) |
wlkd.f | ⊢ (𝜑 → 𝐹 ∈ Word V) |
wlkd.l | ⊢ (𝜑 → (♯‘𝑃) = ((♯‘𝐹) + 1)) |
wlkdlem1.v | ⊢ (𝜑 → ∀𝑘 ∈ (0...(♯‘𝐹))(𝑃‘𝑘) ∈ 𝑉) |
Ref | Expression |
---|---|
wlkdlem1 | ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶𝑉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wlkd.p | . . 3 ⊢ (𝜑 → 𝑃 ∈ Word V) | |
2 | wrdf 13862 | . . 3 ⊢ (𝑃 ∈ Word V → 𝑃:(0..^(♯‘𝑃))⟶V) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝜑 → 𝑃:(0..^(♯‘𝑃))⟶V) |
4 | wlkd.l | . . . . . 6 ⊢ (𝜑 → (♯‘𝑃) = ((♯‘𝐹) + 1)) | |
5 | 4 | oveq2d 7151 | . . . . 5 ⊢ (𝜑 → (0..^(♯‘𝑃)) = (0..^((♯‘𝐹) + 1))) |
6 | wlkd.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ Word V) | |
7 | lencl 13876 | . . . . . . . 8 ⊢ (𝐹 ∈ Word V → (♯‘𝐹) ∈ ℕ0) | |
8 | 6, 7 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (♯‘𝐹) ∈ ℕ0) |
9 | 8 | nn0zd 12073 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐹) ∈ ℤ) |
10 | fzval3 13101 | . . . . . 6 ⊢ ((♯‘𝐹) ∈ ℤ → (0...(♯‘𝐹)) = (0..^((♯‘𝐹) + 1))) | |
11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝜑 → (0...(♯‘𝐹)) = (0..^((♯‘𝐹) + 1))) |
12 | 5, 11 | eqtr4d 2836 | . . . 4 ⊢ (𝜑 → (0..^(♯‘𝑃)) = (0...(♯‘𝐹))) |
13 | 12 | feq2d 6473 | . . 3 ⊢ (𝜑 → (𝑃:(0..^(♯‘𝑃))⟶V ↔ 𝑃:(0...(♯‘𝐹))⟶V)) |
14 | ssv 3939 | . . . 4 ⊢ 𝑉 ⊆ V | |
15 | wlkdlem1.v | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ (0...(♯‘𝐹))(𝑃‘𝑘) ∈ 𝑉) | |
16 | frnssb 6862 | . . . 4 ⊢ ((𝑉 ⊆ V ∧ ∀𝑘 ∈ (0...(♯‘𝐹))(𝑃‘𝑘) ∈ 𝑉) → (𝑃:(0...(♯‘𝐹))⟶V ↔ 𝑃:(0...(♯‘𝐹))⟶𝑉)) | |
17 | 14, 15, 16 | sylancr 590 | . . 3 ⊢ (𝜑 → (𝑃:(0...(♯‘𝐹))⟶V ↔ 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
18 | 13, 17 | bitrd 282 | . 2 ⊢ (𝜑 → (𝑃:(0..^(♯‘𝑃))⟶V ↔ 𝑃:(0...(♯‘𝐹))⟶𝑉)) |
19 | 3, 18 | mpbid 235 | 1 ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶𝑉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 = wceq 1538 ∈ wcel 2111 ∀wral 3106 Vcvv 3441 ⊆ wss 3881 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 + caddc 10529 ℕ0cn0 11885 ℤcz 11969 ...cfz 12885 ..^cfzo 13028 ♯chash 13686 Word cword 13857 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 |
This theorem is referenced by: wlkd 27476 |
Copyright terms: Public domain | W3C validator |