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 32256 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^(♯‘𝑀))) → ((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖)) |
10 | 9 | ralrimiva 3107 | . 2 ⊢ (𝜑 → ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖)) |
11 | 1, 3, 5, 6 | sseqfn 32257 | . . 3 ⊢ (𝜑 → (𝑀seqstr𝐹) Fn ℕ0) |
12 | wrdfn 14159 | . . . 4 ⊢ (𝑀 ∈ Word 𝑆 → 𝑀 Fn (0..^(♯‘𝑀))) | |
13 | 3, 12 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 Fn (0..^(♯‘𝑀))) |
14 | fzo0ssnn0 13396 | . . . 4 ⊢ (0..^(♯‘𝑀)) ⊆ ℕ0 | |
15 | 14 | a1i 11 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝑀)) ⊆ ℕ0) |
16 | fvreseq1 6898 | . . 3 ⊢ ((((𝑀seqstr𝐹) Fn ℕ0 ∧ 𝑀 Fn (0..^(♯‘𝑀))) ∧ (0..^(♯‘𝑀)) ⊆ ℕ0) → (((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀 ↔ ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖))) | |
17 | 11, 13, 15, 16 | syl21anc 834 | . 2 ⊢ (𝜑 → (((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀 ↔ ∀𝑖 ∈ (0..^(♯‘𝑀))((𝑀seqstr𝐹)‘𝑖) = (𝑀‘𝑖))) |
18 | 10, 17 | mpbird 256 | 1 ⊢ (𝜑 → ((𝑀seqstr𝐹) ↾ (0..^(♯‘𝑀))) = 𝑀) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 Vcvv 3422 ∩ cin 3882 ⊆ wss 3883 ◡ccnv 5579 ↾ cres 5582 “ cima 5583 Fn wfn 6413 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 0cc0 10802 ℕ0cn0 12163 ℤ≥cuz 12511 ..^cfzo 13311 ♯chash 13972 Word cword 14145 seqstrcsseq 32250 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-fz 13169 df-fzo 13312 df-seq 13650 df-hash 13973 df-word 14146 df-lsw 14194 df-s1 14229 df-sseq 32251 |
This theorem is referenced by: sseqp1 32262 |
Copyright terms: Public domain | W3C validator |