efgsval - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > efgsval		Structured version Visualization version GIF version

Theorem efgsval 19950

Description: Value of the auxiliary function 𝑆 defining a sequence of extensions. (Contributed by Mario Carneiro, 27-Sep-2015.)

**Hypotheses**
Ref	Expression
efgval.w	⊢ 𝑊 = ( I ‘Word (𝐼 × 2_o))
efgval.r	⊢ ∼ = ( ~_FG ‘𝐼)
efgval2.m	⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)
efgval2.t	⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
efgred.d	⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
efgred.s	⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))

**Assertion**
Ref	Expression
efgsval	⊢ (𝐹 ∈ dom 𝑆 → (𝑆‘𝐹) = (𝐹‘((♯‘𝐹) − 1)))

Distinct variable groups: 𝑦,𝑧 𝑡,𝑛,𝑣,𝑤,𝑦,𝑧,𝑚,𝑥 𝑚,𝑀 𝑥,𝑛,𝑀,𝑡,𝑣,𝑤 𝑘,𝑚,𝑡,𝑥,𝑇 𝑘,𝑛,𝑣,𝑤,𝑦,𝑧,𝑊,𝑚,𝑡,𝑥 ∼ ,𝑚,𝑡,𝑥,𝑦,𝑧 𝑚,𝐼,𝑛,𝑡,𝑣,𝑤,𝑥,𝑦,𝑧 𝐷,𝑚,𝑡 Allowed substitution hints: 𝐷(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑘, 𝑛) ∼ (𝑤, 𝑣, 𝑘, 𝑛) 𝑆(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑡, 𝑘, 𝑚, 𝑛) 𝑇(𝑦, 𝑧, 𝑤, 𝑣, 𝑛) 𝐹(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑡, 𝑘, 𝑚, 𝑛) 𝐼(𝑘) 𝑀(𝑦, 𝑧, 𝑘)

Proof of Theorem efgsval Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 23	. . . 4 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹)
2		fveq2 6885	. . . . 5 ⊢ (𝑓 = 𝐹 → (♯‘𝑓) = (♯‘𝐹))
3	2	oveq1d 7435	. . . 4 ⊢ (𝑓 = 𝐹 → ((♯‘𝑓) − 1) = ((♯‘𝐹) − 1))
4	1, 3	fveq12d 6892	. . 3 ⊢ (𝑓 = 𝐹 → (𝑓‘((♯‘𝑓) − 1)) = (𝐹‘((♯‘𝐹) − 1)))
5		efgred.s	. . . 4 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))
6		id 23	. . . . . 6 ⊢ (𝑚 = 𝑓 → 𝑚 = 𝑓)
7		fveq2 6885	. . . . . . 7 ⊢ (𝑚 = 𝑓 → (♯‘𝑚) = (♯‘𝑓))
8	7	oveq1d 7435	. . . . . 6 ⊢ (𝑚 = 𝑓 → ((♯‘𝑚) − 1) = ((♯‘𝑓) − 1))
9	6, 8	fveq12d 6892	. . . . 5 ⊢ (𝑚 = 𝑓 → (𝑚‘((♯‘𝑚) − 1)) = (𝑓‘((♯‘𝑓) − 1)))
10	9	cbvmptv 5208	. . . 4 ⊢ (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1))) = (𝑓 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑓‘((♯‘𝑓) − 1)))
11	5, 10	eqtri 2783	. . 3 ⊢ 𝑆 = (𝑓 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑓‘((♯‘𝑓) − 1)))
12		fvex 6898	. . 3 ⊢ (𝐹‘((♯‘𝐹) − 1)) ∈ V
13	4, 11, 12	fvmpt 6993	. 2 ⊢ (𝐹 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} → (𝑆‘𝐹) = (𝐹‘((♯‘𝐹) − 1)))
14		efgval.w	. . . 4 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2_o))
15		efgval.r	. . . 4 ⊢ ∼ = ( ~_FG ‘𝐼)
16		efgval2.m	. . . 4 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)
17		efgval2.t	. . . 4 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
18		efgred.d	. . . 4 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
19	14, 15, 16, 17, 18, 5	efgsf 19948	. . 3 ⊢ 𝑆:{𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))}⟶𝑊
20	19	fdmi 6721	. 2 ⊢ dom 𝑆 = {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))}
21	13, 20	eleq2s 2878	1 ⊢ (𝐹 ∈ dom 𝑆 → (𝑆‘𝐹) = (𝐹‘((♯‘𝐹) − 1)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∀wral 3076 {crab 3412 ∖ cdif 4045 ∅c0 4278 {csn 4584 ⟨cop 4834 ⟨cotp 4857 ∪ ciun 4950 ↦ cmpt 5185 I cid 5544 × cxp 5648 dom cdm 5650 ran crn 5651 ‘cfv 6538 (class class class)co 7420 ∈ cmpo 7422 1_oc1o 8472 2_oc2o 8473 0cc0 11203 1c1 11204 − cmin 11544 ...cfz 13642 ..^cfzo 13791 ♯chash 14477 Word cword 14661 splice csplice 14902 ⟨“cs2 14996 ~_FG cefg 19925

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 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-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-n0 12610 df-z 12697 df-uz 12969 df-fz 13643 df-fzo 13792 df-hash 14478 df-word 14662

This theorem is used by: efgsdmi 19951 efgsval2 19952 efgsrel 19953 efgs1b 19955 efgsp1 19956 efgsfo 19958 efgredlema 19959 efgredlemd 19963 efgredlem 19966 efgredeu 19971

W3C validator