| 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 34554 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → ((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖)) |
| 10 | 9 | ralrimiva 3130 | . 2 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖)) |
| 11 | 1, 3, 5, 6 | sseqfn 34555 | . . 3 ⊢ (𝜑 → (𝑀seqstr𝐹) Fn ℕ0) |
| 12 | wrdfn 14479 | . . . 4 ⊢ (𝑀 ∈ Word 𝑆 → 𝑀 Fn (0..^(♯‘𝑀))) | |
| 13 | 3, 12 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 Fn (0..^(♯‘𝑀))) |
| 14 | fzo0ssnn0 13690 | . . . 4 ⊢ (0..^(♯‘𝑀)) ⊆ ℕ0 | |
| 15 | 14 | a1i 11 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝑀)) ⊆ ℕ0) |
| 16 | fvreseq1 6983 | . . 3 ⊢ ((((𝑀seqstr𝐹) Fn ℕ0 ∧ 𝑀 Fn (0..^(♯‘𝑀))) ∧ (0..^(♯‘𝑀)) ⊆ ℕ0) → (((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀 ↔ ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖))) | |
| 17 | 11, 13, 15, 16 | syl21anc 838 | . 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 1542 ∈ wcel 2114 ∀wral 3052 Vcvv 3430 ∩ cin 3889 ⊆ wss 3890 ◡ccnv 5621 ↾ cres 5624 “ cima 5625 Fn wfn 6485 ⟶wf 6486 ‘cfv 6490 (class class class)co 7358 0cc0 11027 ℕ0cn0 12426 ℤ≥cuz 12777 ..^cfzo 13597 ♯chash 14281 Word cword 14464 seqstrcsseq 34548 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-inf2 9551 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-er 8634 df-map 8766 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-card 9852 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-n0 12427 df-z 12514 df-uz 12778 df-fz 13451 df-fzo 13598 df-seq 13953 df-hash 14282 df-word 14465 df-lsw 14514 df-s1 14548 df-sseq 34549 |
| This theorem is referenced by: sseqp1 34560 |
| Copyright terms: Public domain | W3C validator |