| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sseqfres | Structured version Visualization version GIF version | ||
| Description: The first elements in the strong recursive sequence are the sequence initializer. (Contributed by Thierry Arnoux, 23-Apr-2019.) |
| Ref | Expression |
|---|---|
| sseqval.1 | ⊢ (𝜑 → 𝑆 ∈ V) |
| sseqval.2 | ⊢ (𝜑 → 𝑀 ∈ Word 𝑆) |
| sseqval.3 | ⊢ 𝑊 = (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀)))) |
| sseqval.4 | ⊢ (𝜑 → 𝐹:𝑊⟶𝑆) |
| Ref | Expression |
|---|---|
| sseqfres | ⊢ (𝜑 → ((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseqval.1 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ V) | |
| 2 | 1 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → 𝑆 ∈ V) |
| 3 | sseqval.2 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ Word 𝑆) | |
| 4 | 3 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → 𝑀 ∈ Word 𝑆) |
| 5 | sseqval.3 | . . . 4 ⊢ 𝑊 = (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀)))) | |
| 6 | sseqval.4 | . . . . 5 ⊢ (𝜑 → 𝐹:𝑊⟶𝑆) | |
| 7 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → 𝐹:𝑊⟶𝑆) |
| 8 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → 𝑖 ∈ (0..^(♯‘𝑀))) | |
| 9 | 2, 4, 5, 7, 8 | sseqfv1 34387 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → ((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖)) |
| 10 | 9 | ralrimiva 3126 | . 2 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖)) |
| 11 | 1, 3, 5, 6 | sseqfn 34388 | . . 3 ⊢ (𝜑 → (𝑀seqstr𝐹) Fn ℕ0) |
| 12 | wrdfn 14500 | . . . 4 ⊢ (𝑀 ∈ Word 𝑆 → 𝑀 Fn (0..^(♯‘𝑀))) | |
| 13 | 3, 12 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 Fn (0..^(♯‘𝑀))) |
| 14 | fzo0ssnn0 13714 | . . . 4 ⊢ (0..^(♯‘𝑀)) ⊆ ℕ0 | |
| 15 | 14 | a1i 11 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝑀)) ⊆ ℕ0) |
| 16 | fvreseq1 7014 | . . 3 ⊢ ((((𝑀seqstr𝐹) Fn ℕ0 ∧ 𝑀 Fn (0..^(♯‘𝑀))) ∧ (0..^(♯‘𝑀)) ⊆ ℕ0) → (((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀 ↔ ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖))) | |
| 17 | 11, 13, 15, 16 | syl21anc 837 | . 2 ⊢ (𝜑 → (((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀 ↔ ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖))) |
| 18 | 10, 17 | mpbird 257 | 1 ⊢ (𝜑 → ((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3045 Vcvv 3450 ∩ cin 3916 ⊆ wss 3917 ◡ccnv 5640 ↾ cres 5643 “ cima 5644 Fn wfn 6509 ⟶wf 6510 ‘cfv 6514 (class class class)co 7390 0cc0 11075 ℕ0cn0 12449 ℤ≥cuz 12800 ..^cfzo 13622 ♯chash 14302 Word cword 14485 seqstrcsseq 34381 |
| 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 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-inf2 9601 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| 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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9899 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-n0 12450 df-z 12537 df-uz 12801 df-fz 13476 df-fzo 13623 df-seq 13974 df-hash 14303 df-word 14486 df-lsw 14535 df-s1 14568 df-sseq 34382 |
| This theorem is referenced by: sseqp1 34393 |
| Copyright terms: Public domain | W3C validator |