Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > sseqfv1 | Structured version Visualization version GIF version |
Description: Value of the strong sequence builder function at one of its initial values. (Contributed by Thierry Arnoux, 21-Apr-2019.) |
Ref | Expression |
---|---|
sseqval.1 | ⊢ (𝜑 → 𝑆 ∈ V) |
sseqval.2 | ⊢ (𝜑 → 𝑀 ∈ Word 𝑆) |
sseqval.3 | ⊢ 𝑊 = (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀)))) |
sseqval.4 | ⊢ (𝜑 → 𝐹:𝑊⟶𝑆) |
sseqfv1.4 | ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝑀))) |
Ref | Expression |
---|---|
sseqfv1 | ⊢ (𝜑 → ((𝑀seqstr𝐹)‘𝑁) = (𝑀‘𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sseqval.1 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) | |
2 | sseqval.2 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ Word 𝑆) | |
3 | sseqval.3 | . . . 4 ⊢ 𝑊 = (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀)))) | |
4 | sseqval.4 | . . . 4 ⊢ (𝜑 → 𝐹:𝑊⟶𝑆) | |
5 | 1, 2, 3, 4 | sseqval 31917 | . . 3 ⊢ (𝜑 → (𝑀seqstr𝐹) = (𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)}))))) |
6 | 5 | fveq1d 6670 | . 2 ⊢ (𝜑 → ((𝑀seqstr𝐹)‘𝑁) = ((𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)}))))‘𝑁)) |
7 | wrdfn 13962 | . . . 4 ⊢ (𝑀 ∈ Word 𝑆 → 𝑀 Fn (0..^(♯‘𝑀))) | |
8 | 2, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝑀 Fn (0..^(♯‘𝑀))) |
9 | fvex 6681 | . . . . . 6 ⊢ (𝑥‘((♯‘𝑥) − 1)) ∈ V | |
10 | df-lsw 13997 | . . . . . 6 ⊢ lastS = (𝑥 ∈ V ↦ (𝑥‘((♯‘𝑥) − 1))) | |
11 | 9, 10 | fnmpti 6474 | . . . . 5 ⊢ lastS Fn V |
12 | 11 | a1i 11 | . . . 4 ⊢ (𝜑 → lastS Fn V) |
13 | lencl 13967 | . . . . . . 7 ⊢ (𝑀 ∈ Word 𝑆 → (♯‘𝑀) ∈ ℕ0) | |
14 | 2, 13 | syl 17 | . . . . . 6 ⊢ (𝜑 → (♯‘𝑀) ∈ ℕ0) |
15 | 14 | nn0zd 12159 | . . . . 5 ⊢ (𝜑 → (♯‘𝑀) ∈ ℤ) |
16 | seqfn 13465 | . . . . 5 ⊢ ((♯‘𝑀) ∈ ℤ → seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)})) Fn (ℤ≥‘(♯‘𝑀))) | |
17 | 15, 16 | syl 17 | . . . 4 ⊢ (𝜑 → seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)})) Fn (ℤ≥‘(♯‘𝑀))) |
18 | ssv 3899 | . . . . 5 ⊢ ran seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)})) ⊆ V | |
19 | 18 | a1i 11 | . . . 4 ⊢ (𝜑 → ran seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)})) ⊆ V) |
20 | fnco 6447 | . . . 4 ⊢ ((lastS Fn V ∧ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)})) Fn (ℤ≥‘(♯‘𝑀)) ∧ ran seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)})) ⊆ V) → (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)}))) Fn (ℤ≥‘(♯‘𝑀))) | |
21 | 12, 17, 19, 20 | syl3anc 1372 | . . 3 ⊢ (𝜑 → (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)}))) Fn (ℤ≥‘(♯‘𝑀))) |
22 | fzouzdisj 13157 | . . . 4 ⊢ ((0..^(♯‘𝑀)) ∩ (ℤ≥‘(♯‘𝑀))) = ∅ | |
23 | 22 | a1i 11 | . . 3 ⊢ (𝜑 → ((0..^(♯‘𝑀)) ∩ (ℤ≥‘(♯‘𝑀))) = ∅) |
24 | sseqfv1.4 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝑀))) | |
25 | fvun1 6753 | . . 3 ⊢ ((𝑀 Fn (0..^(♯‘𝑀)) ∧ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)}))) Fn (ℤ≥‘(♯‘𝑀)) ∧ (((0..^(♯‘𝑀)) ∩ (ℤ≥‘(♯‘𝑀))) = ∅ ∧ 𝑁 ∈ (0..^(♯‘𝑀)))) → ((𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)}))))‘𝑁) = (𝑀‘𝑁)) | |
26 | 8, 21, 23, 24, 25 | syl112anc 1375 | . 2 ⊢ (𝜑 → ((𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ 〈“(𝐹‘𝑥)”〉)), (ℕ0 × {(𝑀 ++ 〈“(𝐹‘𝑀)”〉)}))))‘𝑁) = (𝑀‘𝑁)) |
27 | 6, 26 | eqtrd 2773 | 1 ⊢ (𝜑 → ((𝑀seqstr𝐹)‘𝑁) = (𝑀‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2113 Vcvv 3397 ∪ cun 3839 ∩ cin 3840 ⊆ wss 3841 ∅c0 4209 {csn 4513 × cxp 5517 ◡ccnv 5518 ran crn 5520 “ cima 5522 ∘ ccom 5523 Fn wfn 6328 ⟶wf 6329 ‘cfv 6333 (class class class)co 7164 ∈ cmpo 7166 0cc0 10608 1c1 10609 − cmin 10941 ℕ0cn0 11969 ℤcz 12055 ℤ≥cuz 12317 ..^cfzo 13117 seqcseq 13453 ♯chash 13775 Word cword 13948 lastSclsw 13996 ++ cconcat 14004 〈“cs1 14031 seqstrcsseq 31912 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1916 ax-6 1974 ax-7 2019 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2161 ax-12 2178 ax-ext 2710 ax-rep 5151 ax-sep 5164 ax-nul 5171 ax-pow 5229 ax-pr 5293 ax-un 7473 ax-inf2 9170 ax-cnex 10664 ax-resscn 10665 ax-1cn 10666 ax-icn 10667 ax-addcl 10668 ax-addrcl 10669 ax-mulcl 10670 ax-mulrcl 10671 ax-mulcom 10672 ax-addass 10673 ax-mulass 10674 ax-distr 10675 ax-i2m1 10676 ax-1ne0 10677 ax-1rid 10678 ax-rnegex 10679 ax-rrecex 10680 ax-cnre 10681 ax-pre-lttri 10682 ax-pre-lttrn 10683 ax-pre-ltadd 10684 ax-pre-mulgt0 10685 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-nel 3039 df-ral 3058 df-rex 3059 df-reu 3060 df-rab 3062 df-v 3399 df-sbc 3680 df-csb 3789 df-dif 3844 df-un 3846 df-in 3848 df-ss 3858 df-pss 3860 df-nul 4210 df-if 4412 df-pw 4487 df-sn 4514 df-pr 4516 df-tp 4518 df-op 4520 df-uni 4794 df-int 4834 df-iun 4880 df-br 5028 df-opab 5090 df-mpt 5108 df-tr 5134 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 6123 df-ord 6169 df-on 6170 df-lim 6171 df-suc 6172 df-iota 6291 df-fun 6335 df-fn 6336 df-f 6337 df-f1 6338 df-fo 6339 df-f1o 6340 df-fv 6341 df-riota 7121 df-ov 7167 df-oprab 7168 df-mpo 7169 df-om 7594 df-1st 7707 df-2nd 7708 df-wrecs 7969 df-recs 8030 df-rdg 8068 df-1o 8124 df-er 8313 df-map 8432 df-en 8549 df-dom 8550 df-sdom 8551 df-fin 8552 df-card 9434 df-pnf 10748 df-mnf 10749 df-xr 10750 df-ltxr 10751 df-le 10752 df-sub 10943 df-neg 10944 df-nn 11710 df-n0 11970 df-z 12056 df-uz 12318 df-fz 12975 df-fzo 13118 df-seq 13454 df-hash 13776 df-word 13949 df-lsw 13997 df-s1 14032 df-sseq 31913 |
This theorem is referenced by: sseqfres 31922 fib0 31928 fib1 31929 |
Copyright terms: Public domain | W3C validator |