Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > efgredlemf | Structured version Visualization version GIF version |
Description: Lemma for efgredleme 18156. (Contributed by Mario Carneiro, 4-Jun-2016.) |
Ref | Expression |
---|---|
efgval.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2𝑜)) |
efgval.r | ⊢ ∼ = ( ~FG ‘𝐼) |
efgval2.m | ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2𝑜 ↦ 〈𝑦, (1𝑜 ∖ 𝑧)〉) |
efgval2.t | ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(#‘𝑣)), 𝑤 ∈ (𝐼 × 2𝑜) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) |
efgred.d | ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) |
efgred.s | ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(#‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((#‘𝑚) − 1))) |
efgredlem.1 | ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((#‘(𝑆‘𝑎)) < (#‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0)))) |
efgredlem.2 | ⊢ (𝜑 → 𝐴 ∈ dom 𝑆) |
efgredlem.3 | ⊢ (𝜑 → 𝐵 ∈ dom 𝑆) |
efgredlem.4 | ⊢ (𝜑 → (𝑆‘𝐴) = (𝑆‘𝐵)) |
efgredlem.5 | ⊢ (𝜑 → ¬ (𝐴‘0) = (𝐵‘0)) |
efgredlemb.k | ⊢ 𝐾 = (((#‘𝐴) − 1) − 1) |
efgredlemb.l | ⊢ 𝐿 = (((#‘𝐵) − 1) − 1) |
Ref | Expression |
---|---|
efgredlemf | ⊢ (𝜑 → ((𝐴‘𝐾) ∈ 𝑊 ∧ (𝐵‘𝐿) ∈ 𝑊)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | efgredlem.2 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ dom 𝑆) | |
2 | efgval.w | . . . . . . . 8 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2𝑜)) | |
3 | efgval.r | . . . . . . . 8 ⊢ ∼ = ( ~FG ‘𝐼) | |
4 | efgval2.m | . . . . . . . 8 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2𝑜 ↦ 〈𝑦, (1𝑜 ∖ 𝑧)〉) | |
5 | efgval2.t | . . . . . . . 8 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(#‘𝑣)), 𝑤 ∈ (𝐼 × 2𝑜) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) | |
6 | efgred.d | . . . . . . . 8 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) | |
7 | efgred.s | . . . . . . . 8 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(#‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((#‘𝑚) − 1))) | |
8 | 2, 3, 4, 5, 6, 7 | efgsdm 18143 | . . . . . . 7 ⊢ (𝐴 ∈ dom 𝑆 ↔ (𝐴 ∈ (Word 𝑊 ∖ {∅}) ∧ (𝐴‘0) ∈ 𝐷 ∧ ∀𝑖 ∈ (1..^(#‘𝐴))(𝐴‘𝑖) ∈ ran (𝑇‘(𝐴‘(𝑖 − 1))))) |
9 | 8 | simp1bi 1076 | . . . . . 6 ⊢ (𝐴 ∈ dom 𝑆 → 𝐴 ∈ (Word 𝑊 ∖ {∅})) |
10 | 1, 9 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ (Word 𝑊 ∖ {∅})) |
11 | 10 | eldifad 3586 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Word 𝑊) |
12 | wrdf 13310 | . . . 4 ⊢ (𝐴 ∈ Word 𝑊 → 𝐴:(0..^(#‘𝐴))⟶𝑊) | |
13 | 11, 12 | syl 17 | . . 3 ⊢ (𝜑 → 𝐴:(0..^(#‘𝐴))⟶𝑊) |
14 | fzossfz 12488 | . . . . 5 ⊢ (0..^((#‘𝐴) − 1)) ⊆ (0...((#‘𝐴) − 1)) | |
15 | lencl 13324 | . . . . . . . 8 ⊢ (𝐴 ∈ Word 𝑊 → (#‘𝐴) ∈ ℕ0) | |
16 | 11, 15 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (#‘𝐴) ∈ ℕ0) |
17 | 16 | nn0zd 11480 | . . . . . 6 ⊢ (𝜑 → (#‘𝐴) ∈ ℤ) |
18 | fzoval 12471 | . . . . . 6 ⊢ ((#‘𝐴) ∈ ℤ → (0..^(#‘𝐴)) = (0...((#‘𝐴) − 1))) | |
19 | 17, 18 | syl 17 | . . . . 5 ⊢ (𝜑 → (0..^(#‘𝐴)) = (0...((#‘𝐴) − 1))) |
20 | 14, 19 | syl5sseqr 3654 | . . . 4 ⊢ (𝜑 → (0..^((#‘𝐴) − 1)) ⊆ (0..^(#‘𝐴))) |
21 | efgredlemb.k | . . . . 5 ⊢ 𝐾 = (((#‘𝐴) − 1) − 1) | |
22 | efgredlem.1 | . . . . . . . 8 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((#‘(𝑆‘𝑎)) < (#‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0)))) | |
23 | efgredlem.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ dom 𝑆) | |
24 | efgredlem.4 | . . . . . . . 8 ⊢ (𝜑 → (𝑆‘𝐴) = (𝑆‘𝐵)) | |
25 | efgredlem.5 | . . . . . . . 8 ⊢ (𝜑 → ¬ (𝐴‘0) = (𝐵‘0)) | |
26 | 2, 3, 4, 5, 6, 7, 22, 1, 23, 24, 25 | efgredlema 18153 | . . . . . . 7 ⊢ (𝜑 → (((#‘𝐴) − 1) ∈ ℕ ∧ ((#‘𝐵) − 1) ∈ ℕ)) |
27 | 26 | simpld 475 | . . . . . 6 ⊢ (𝜑 → ((#‘𝐴) − 1) ∈ ℕ) |
28 | fzo0end 12560 | . . . . . 6 ⊢ (((#‘𝐴) − 1) ∈ ℕ → (((#‘𝐴) − 1) − 1) ∈ (0..^((#‘𝐴) − 1))) | |
29 | 27, 28 | syl 17 | . . . . 5 ⊢ (𝜑 → (((#‘𝐴) − 1) − 1) ∈ (0..^((#‘𝐴) − 1))) |
30 | 21, 29 | syl5eqel 2705 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ (0..^((#‘𝐴) − 1))) |
31 | 20, 30 | sseldd 3604 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (0..^(#‘𝐴))) |
32 | 13, 31 | ffvelrnd 6360 | . 2 ⊢ (𝜑 → (𝐴‘𝐾) ∈ 𝑊) |
33 | 2, 3, 4, 5, 6, 7 | efgsdm 18143 | . . . . . . 7 ⊢ (𝐵 ∈ dom 𝑆 ↔ (𝐵 ∈ (Word 𝑊 ∖ {∅}) ∧ (𝐵‘0) ∈ 𝐷 ∧ ∀𝑖 ∈ (1..^(#‘𝐵))(𝐵‘𝑖) ∈ ran (𝑇‘(𝐵‘(𝑖 − 1))))) |
34 | 33 | simp1bi 1076 | . . . . . 6 ⊢ (𝐵 ∈ dom 𝑆 → 𝐵 ∈ (Word 𝑊 ∖ {∅})) |
35 | 23, 34 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ (Word 𝑊 ∖ {∅})) |
36 | 35 | eldifad 3586 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ Word 𝑊) |
37 | wrdf 13310 | . . . 4 ⊢ (𝐵 ∈ Word 𝑊 → 𝐵:(0..^(#‘𝐵))⟶𝑊) | |
38 | 36, 37 | syl 17 | . . 3 ⊢ (𝜑 → 𝐵:(0..^(#‘𝐵))⟶𝑊) |
39 | fzossfz 12488 | . . . . 5 ⊢ (0..^((#‘𝐵) − 1)) ⊆ (0...((#‘𝐵) − 1)) | |
40 | lencl 13324 | . . . . . . . 8 ⊢ (𝐵 ∈ Word 𝑊 → (#‘𝐵) ∈ ℕ0) | |
41 | 36, 40 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (#‘𝐵) ∈ ℕ0) |
42 | 41 | nn0zd 11480 | . . . . . 6 ⊢ (𝜑 → (#‘𝐵) ∈ ℤ) |
43 | fzoval 12471 | . . . . . 6 ⊢ ((#‘𝐵) ∈ ℤ → (0..^(#‘𝐵)) = (0...((#‘𝐵) − 1))) | |
44 | 42, 43 | syl 17 | . . . . 5 ⊢ (𝜑 → (0..^(#‘𝐵)) = (0...((#‘𝐵) − 1))) |
45 | 39, 44 | syl5sseqr 3654 | . . . 4 ⊢ (𝜑 → (0..^((#‘𝐵) − 1)) ⊆ (0..^(#‘𝐵))) |
46 | efgredlemb.l | . . . . 5 ⊢ 𝐿 = (((#‘𝐵) − 1) − 1) | |
47 | 26 | simprd 479 | . . . . . 6 ⊢ (𝜑 → ((#‘𝐵) − 1) ∈ ℕ) |
48 | fzo0end 12560 | . . . . . 6 ⊢ (((#‘𝐵) − 1) ∈ ℕ → (((#‘𝐵) − 1) − 1) ∈ (0..^((#‘𝐵) − 1))) | |
49 | 47, 48 | syl 17 | . . . . 5 ⊢ (𝜑 → (((#‘𝐵) − 1) − 1) ∈ (0..^((#‘𝐵) − 1))) |
50 | 46, 49 | syl5eqel 2705 | . . . 4 ⊢ (𝜑 → 𝐿 ∈ (0..^((#‘𝐵) − 1))) |
51 | 45, 50 | sseldd 3604 | . . 3 ⊢ (𝜑 → 𝐿 ∈ (0..^(#‘𝐵))) |
52 | 38, 51 | ffvelrnd 6360 | . 2 ⊢ (𝜑 → (𝐵‘𝐿) ∈ 𝑊) |
53 | 32, 52 | jca 554 | 1 ⊢ (𝜑 → ((𝐴‘𝐾) ∈ 𝑊 ∧ (𝐵‘𝐿) ∈ 𝑊)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 {crab 2916 ∖ cdif 3571 ∅c0 3915 {csn 4177 〈cop 4183 〈cotp 4185 ∪ ciun 4520 class class class wbr 4653 ↦ cmpt 4729 I cid 5023 × cxp 5112 dom cdm 5114 ran crn 5115 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ↦ cmpt2 6652 1𝑜c1o 7553 2𝑜c2o 7554 0cc0 9936 1c1 9937 < clt 10074 − cmin 10266 ℕcn 11020 ℕ0cn0 11292 ℤcz 11377 ...cfz 12326 ..^cfzo 12465 #chash 13117 Word cword 13291 splice csplice 13296 〈“cs2 13586 ~FG cefg 18119 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 |
This theorem is referenced by: efgredlemg 18155 efgredleme 18156 |
Copyright terms: Public domain | W3C validator |