| 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 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → 𝑆 ∈ V) |
| 3 | sseqval.2 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ Word 𝑆) | |
| 4 | 3 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → 𝑀 ∈ Word 𝑆) |
| 5 | sseqval.3 | . . . 4 ⊢ 𝑊 = (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀)))) | |
| 6 | sseqval.4 | . . . . 5 ⊢ (𝜑 → 𝐹:𝑊⟶𝑆) | |
| 7 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → 𝐹:𝑊⟶𝑆) |
| 8 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → 𝑖 ∈ (0..^(♯‘𝑀))) | |
| 9 | 2, 4, 5, 7, 8 | sseqfv1 34803 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → ((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖)) |
| 10 | 9 | ralrimiva 3160 | . 2 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖)) |
| 11 | 1, 3, 5, 6 | sseqfn 34804 | . . 3 ⊢ (𝜑 → (𝑀seqstr𝐹) Fn ℕ0) |
| 12 | wrdfn 14585 | . . . 4 ⊢ (𝑀 ∈ Word 𝑆 → 𝑀 Fn (0..^(♯‘𝑀))) | |
| 13 | 3, 12 | syl 18 | . . 3 ⊢ (𝜑 → 𝑀 Fn (0..^(♯‘𝑀))) |
| 14 | fzo0ssnn0 13794 | . . . 4 ⊢ (0..^(♯‘𝑀)) ⊆ ℕ0 | |
| 15 | 14 | a1i 11 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝑀)) ⊆ ℕ0) |
| 16 | fvreseq1 7041 | . . 3 ⊢ ((((𝑀seqstr𝐹) Fn ℕ0 ∧ 𝑀 Fn (0..^(♯‘𝑀))) ∧ (0..^(♯‘𝑀)) ⊆ ℕ0) → (((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀 ↔ ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖))) | |
| 17 | 11, 13, 15, 16 | syl21anc 851 | . 2 ⊢ (𝜑 → (((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀 ↔ ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖))) |
| 18 | 10, 17 | mpbird 260 | 1 ⊢ (𝜑 → ((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3082 Vcvv 3458 ∩ cin 3907 ⊆ wss 3908 ◡ccnv 5665 ↾ cres 5668 “ cima 5669 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7423 0cc0 11118 ℕ0cn0 12522 ℤ≥cuz 12880 ..^cfzo 13701 ♯chash 14386 Word cword 14570 seqstrcsseq 34797 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-inf2 9620 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8703 df-map 8835 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-card 9944 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-nn 12252 df-n0 12523 df-z 12610 df-uz 12881 df-fz 13554 df-fzo 13702 df-seq 14058 df-hash 14387 df-word 14571 df-lsw 14620 df-s1 14655 df-sseq 34798 |
| This theorem is used by: sseqp1 34809 |
| Copyright terms: Public domain | W3C validator |