Theorem sseqval 34756

Description: Value of the strong sequence builder function. The set 𝑊 represents here the words of length greater than or equal to the lenght of the initial sequence 𝑀. (Contributed by Thierry Arnoux, 21-Apr-2019.)

Hypotheses

Ref	Expression
sseqval.1	⊢ (𝜑 → 𝑆 ∈ V)
sseqval.2	⊢ (𝜑 → 𝑀 ∈ Word 𝑆)
sseqval.3	⊢ 𝑊 = (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀))))
sseqval.4	⊢ (𝜑 → 𝐹:𝑊⟶𝑆)

Assertion

Ref	Expression
sseqval	⊢ (𝜑 → (𝑀seqstr𝐹) = (𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})))))

Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝑀,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝑆(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem sseqval

Dummy variables 𝑓 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-sseq 34752	. . 3 ⊢ seqstr = (𝑚 ∈ V, 𝑓 ∈ V ↦ (𝑚 ∪ (lastS ∘ seq(♯‘𝑚)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝑓‘𝑥)”⟩)), (ℕ0 × {(𝑚 ++ ⟨“(𝑓‘𝑚)”⟩)})))))
2	1	a1i 11	. 2 ⊢ (𝜑 → seqstr = (𝑚 ∈ V, 𝑓 ∈ V ↦ (𝑚 ∪ (lastS ∘ seq(♯‘𝑚)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝑓‘𝑥)”⟩)), (ℕ0 × {(𝑚 ++ ⟨“(𝑓‘𝑚)”⟩)}))))))
3		simprl 782	. . 3 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → 𝑚 = 𝑀)
4	3	fveq2d 6887	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → (♯‘𝑚) = (♯‘𝑀))
5		simp1rr 1258	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → 𝑓 = 𝐹)
6	5	fveq1d 6885	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑓‘𝑥) = (𝐹‘𝑥))
7	6	s1eqd 14641	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → ⟨“(𝑓‘𝑥)”⟩ = ⟨“(𝐹‘𝑥)”⟩)
8	7	oveq2d 7428	. . . . . 6 ⊢ (((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥 ++ ⟨“(𝑓‘𝑥)”⟩) = (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩))
9	8	mpoeq3dva 7489	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → (𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝑓‘𝑥)”⟩)) = (𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)))
10		simprr 784	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → 𝑓 = 𝐹)
11	10, 3	fveq12d 6890	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → (𝑓‘𝑚) = (𝐹‘𝑀))
12	11	s1eqd 14641	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → ⟨“(𝑓‘𝑚)”⟩ = ⟨“(𝐹‘𝑀)”⟩)
13	3, 12	oveq12d 7430	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → (𝑚 ++ ⟨“(𝑓‘𝑚)”⟩) = (𝑀 ++ ⟨“(𝐹‘𝑀)”⟩))
14	13	sneqd 4602	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → {(𝑚 ++ ⟨“(𝑓‘𝑚)”⟩)} = {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})
15	14	xpeq2d 5693	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → (ℕ0 × {(𝑚 ++ ⟨“(𝑓‘𝑚)”⟩)}) = (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)}))
16	4, 9, 15	seqeq123d 14048	. . . 4 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → seq(♯‘𝑚)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝑓‘𝑥)”⟩)), (ℕ0 × {(𝑚 ++ ⟨“(𝑓‘𝑚)”⟩)})) = seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})))
17	16	coeq2d 5850	. . 3 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → (lastS ∘ seq(♯‘𝑚)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝑓‘𝑥)”⟩)), (ℕ0 × {(𝑚 ++ ⟨“(𝑓‘𝑚)”⟩)}))) = (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)}))))
18	3, 17	uneq12d 4124	. 2 ⊢ ((𝜑 ∧ (𝑚 = 𝑀 ∧ 𝑓 = 𝐹)) → (𝑚 ∪ (lastS ∘ seq(♯‘𝑚)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝑓‘𝑥)”⟩)), (ℕ0 × {(𝑚 ++ ⟨“(𝑓‘𝑚)”⟩)})))) = (𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})))))
19		sseqval.2	. . 3 ⊢ (𝜑 → 𝑀 ∈ Word 𝑆)
20		elex 3476	. . 3 ⊢ (𝑀 ∈ Word 𝑆 → 𝑀 ∈ V)
21	19, 20	syl 18	. 2 ⊢ (𝜑 → 𝑀 ∈ V)
22		sseqval.4	. . 3 ⊢ (𝜑 → 𝐹:𝑊⟶𝑆)
23		sseqval.3	. . . 4 ⊢ 𝑊 = (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀))))
24		sseqval.1	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ V)
25		wrdexg 14563	. . . . 5 ⊢ (𝑆 ∈ V → Word 𝑆 ∈ V)
26		inex1g 5289	. . . . 5 ⊢ (Word 𝑆 ∈ V → (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀)))) ∈ V)
27	24, 25, 26	3syl 19	. . . 4 ⊢ (𝜑 → (Word 𝑆 ∩ (◡♯ “ (ℤ≥‘(♯‘𝑀)))) ∈ V)
28	23, 27	eqeltrid 2867	. . 3 ⊢ (𝜑 → 𝑊 ∈ V)
29	22, 28	fexd 7227	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
30		df-lsw 14602	. . . . . 6 ⊢ lastS = (𝑥 ∈ V ↦ (𝑥‘((♯‘𝑥) − 1)))
31	30	funmpt2 6577	. . . . 5 ⊢ Fun lastS
32	31	a1i 11	. . . 4 ⊢ (𝜑 → Fun lastS)
33		seqex 14041	. . . . 5 ⊢ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})) ∈ V
34	33	a1i 11	. . . 4 ⊢ (𝜑 → seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})) ∈ V)
35		cofunexg 7947	. . . 4 ⊢ ((Fun lastS ∧ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})) ∈ V) → (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)}))) ∈ V)
36	32, 34, 35	syl2anc 595	. . 3 ⊢ (𝜑 → (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)}))) ∈ V)
37		unexg 7743	. . 3 ⊢ ((𝑀 ∈ V ∧ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)}))) ∈ V) → (𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})))) ∈ V)
38	21, 36, 37	syl2anc 595	. 2 ⊢ (𝜑 → (𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})))) ∈ V)
39	2, 18, 21, 29, 38	ovmpod 7564	1 ⊢ (𝜑 → (𝑀seqstr𝐹) = (𝑀 ∪ (lastS ∘ seq(♯‘𝑀)((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ++ ⟨“(𝐹‘𝑥)”⟩)), (ℕ0 × {(𝑀 ++ ⟨“(𝐹‘𝑀)”⟩)})))))

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ∪ cun 3904   ∩ cin 3905  {csn 4590   × cxp 5661  ^◡ccnv 5662   “ cima 5666   ∘ ccom 5667  Fun wfun 6532  ⟶wf 6534  ‘cfv 6538  (class class class)co 7412   ∈ cmpo 7414  1c1 11102   − cmin 11442  ℕ₀cn0 12505  ℤ_≥cuz 12863  seqcseq 14039  ♯chash 14368  Word cword 14552  lastSclsw 14601   ++ cconcat 14609  ⟨“cs1 14635  seq_strcsseq 34751

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-inf2 9611  ax-cnex 11157  ax-1cn 11159  ax-addcl 11161

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-map 8827  df-nn 12235  df-n0 12506  df-seq 14040  df-word 14553  df-lsw 14602  df-s1 14636  df-sseq 34752

This theorem is referenced by:  sseqfv1  34757  sseqfn  34758  sseqf  34760  sseqfv2  34762