| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > efgredlemf | Structured version Visualization version GIF version | ||
| Description: Lemma for efgredleme 20010. (Contributed by Mario Carneiro, 4-Jun-2016.) |
| Ref | Expression |
|---|---|
| efgval.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) |
| efgval.r | ⊢ ∼ = ( ~FG ‘𝐼) |
| efgval2.m | ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) |
| efgval2.t | ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 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 (𝐼 × 2o)) | |
| 3 | efgval.r | . . . . . . . 8 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 4 | efgval2.m | . . . . . . . 8 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) | |
| 5 | efgval2.t | . . . . . . . 8 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) | |
| 6 | efgred.d | . . . . . . . 8 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) | |
| 7 | efgred.s | . . . . . . . 8 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1))) | |
| 8 | 2, 3, 4, 5, 6, 7 | efgsdm 19997 | . . . . . . 7 ⊢ (𝐴 ∈ dom 𝑆 ↔ (𝐴 ∈ (Word 𝑊 ∖ {∅}) ∧ (𝐴‘0) ∈ 𝐷 ∧ ∀𝑖 ∈ (1..^(♯‘𝐴))(𝐴‘𝑖) ∈ ran (𝑇‘(𝐴‘(𝑖 − 1))))) |
| 9 | 8 | simp1bi 1164 | . . . . . 6 ⊢ (𝐴 ∈ dom 𝑆 → 𝐴 ∈ (Word 𝑊 ∖ {∅})) |
| 10 | 1, 9 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ (Word 𝑊 ∖ {∅})) |
| 11 | 10 | eldifad 4053 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Word 𝑊) |
| 12 | wrdf 14703 | . . . 4 ⊢ (𝐴 ∈ Word 𝑊 → 𝐴:(0..^(♯‘𝐴))⟶𝑊) | |
| 13 | 11, 12 | syl 18 | . . 3 ⊢ (𝜑 → 𝐴:(0..^(♯‘𝐴))⟶𝑊) |
| 14 | fzossfz 13852 | . . . . 5 ⊢ (0..^((♯‘𝐴) − 1)) ⊆ (0...((♯‘𝐴) − 1)) | |
| 15 | lencl 14718 | . . . . . . . 8 ⊢ (𝐴 ∈ Word 𝑊 → (♯‘𝐴) ∈ ℕ0) | |
| 16 | 11, 15 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (♯‘𝐴) ∈ ℕ0) |
| 17 | 16 | nn0zd 12757 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐴) ∈ ℤ) |
| 18 | fzoval 13833 | . . . . . 6 ⊢ ((♯‘𝐴) ∈ ℤ → (0..^(♯‘𝐴)) = (0...((♯‘𝐴) − 1))) | |
| 19 | 17, 18 | syl 18 | . . . . 5 ⊢ (𝜑 → (0..^(♯‘𝐴)) = (0...((♯‘𝐴) − 1))) |
| 20 | 14, 19 | sseqtrrid 3955 | . . . 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 20007 | . . . . . . 7 ⊢ (𝜑 → (((♯‘𝐴) − 1) ∈ ℕ ∧ ((♯‘𝐵) − 1) ∈ ℕ)) |
| 27 | 26 | simpld 500 | . . . . . 6 ⊢ (𝜑 → ((♯‘𝐴) − 1) ∈ ℕ) |
| 28 | fzo0end 13932 | . . . . . 6 ⊢ (((♯‘𝐴) − 1) ∈ ℕ → (((♯‘𝐴) − 1) − 1) ∈ (0..^((♯‘𝐴) − 1))) | |
| 29 | 27, 28 | syl 18 | . . . . 5 ⊢ (𝜑 → (((♯‘𝐴) − 1) − 1) ∈ (0..^((♯‘𝐴) − 1))) |
| 30 | 21, 29 | eqeltrid 2871 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ (0..^((♯‘𝐴) − 1))) |
| 31 | 20, 30 | sseldd 3913 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (0..^(♯‘𝐴))) |
| 32 | 13, 31 | ffvelcdmd 7116 | . 2 ⊢ (𝜑 → (𝐴‘𝐾) ∈ 𝑊) |
| 33 | 2, 3, 4, 5, 6, 7 | efgsdm 19997 | . . . . . . 7 ⊢ (𝐵 ∈ dom 𝑆 ↔ (𝐵 ∈ (Word 𝑊 ∖ {∅}) ∧ (𝐵‘0) ∈ 𝐷 ∧ ∀𝑖 ∈ (1..^(♯‘𝐵))(𝐵‘𝑖) ∈ ran (𝑇‘(𝐵‘(𝑖 − 1))))) |
| 34 | 33 | simp1bi 1164 | . . . . . 6 ⊢ (𝐵 ∈ dom 𝑆 → 𝐵 ∈ (Word 𝑊 ∖ {∅})) |
| 35 | 23, 34 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ (Word 𝑊 ∖ {∅})) |
| 36 | 35 | eldifad 4053 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ Word 𝑊) |
| 37 | wrdf 14703 | . . . 4 ⊢ (𝐵 ∈ Word 𝑊 → 𝐵:(0..^(♯‘𝐵))⟶𝑊) | |
| 38 | 36, 37 | syl 18 | . . 3 ⊢ (𝜑 → 𝐵:(0..^(♯‘𝐵))⟶𝑊) |
| 39 | fzossfz 13852 | . . . . 5 ⊢ (0..^((♯‘𝐵) − 1)) ⊆ (0...((♯‘𝐵) − 1)) | |
| 40 | lencl 14718 | . . . . . . . 8 ⊢ (𝐵 ∈ Word 𝑊 → (♯‘𝐵) ∈ ℕ0) | |
| 41 | 36, 40 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (♯‘𝐵) ∈ ℕ0) |
| 42 | 41 | nn0zd 12757 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐵) ∈ ℤ) |
| 43 | fzoval 13833 | . . . . . 6 ⊢ ((♯‘𝐵) ∈ ℤ → (0..^(♯‘𝐵)) = (0...((♯‘𝐵) − 1))) | |
| 44 | 42, 43 | syl 18 | . . . . 5 ⊢ (𝜑 → (0..^(♯‘𝐵)) = (0...((♯‘𝐵) − 1))) |
| 45 | 39, 44 | sseqtrrid 3955 | . . . 4 ⊢ (𝜑 → (0..^((♯‘𝐵) − 1)) ⊆ (0..^(♯‘𝐵))) |
| 46 | efgredlemb.l | . . . . 5 ⊢ 𝐿 = (((♯‘𝐵) − 1) − 1) | |
| 47 | fzo0end 13932 | . . . . . 6 ⊢ (((♯‘𝐵) − 1) ∈ ℕ → (((♯‘𝐵) − 1) − 1) ∈ (0..^((♯‘𝐵) − 1))) | |
| 48 | 26, 47 | simpl2im 513 | . . . . 5 ⊢ (𝜑 → (((♯‘𝐵) − 1) − 1) ∈ (0..^((♯‘𝐵) − 1))) |
| 49 | 46, 48 | eqeltrid 2871 | . . . 4 ⊢ (𝜑 → 𝐿 ∈ (0..^((♯‘𝐵) − 1))) |
| 50 | 45, 49 | sseldd 3913 | . . 3 ⊢ (𝜑 → 𝐿 ∈ (0..^(♯‘𝐵))) |
| 51 | 38, 50 | ffvelcdmd 7116 | . 2 ⊢ (𝜑 → (𝐵‘𝐿) ∈ 𝑊) |
| 52 | 32, 51 | jca 521 | 1 ⊢ (𝜑 → ((𝐴‘𝐾) ∈ 𝑊 ∧ (𝐵‘𝐿) ∈ 𝑊)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∀wral 3083 {crab 3415 ∖ cdif 4047 ∅c0 4280 {csn 4587 〈cop 4839 〈cotp 4862 ∪ ciun 4955 class class class wbr 5107 ↦ cmpt 5191 I cid 5551 × cxp 5655 dom cdm 5657 ran crn 5658 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 ∈ cmpo 7452 1oc1o 8506 2oc2o 8507 0cc0 11238 1c1 11239 < clt 11381 − cmin 11579 ℕcn 12374 ℕ0cn0 12645 ℤcz 12732 ...cfz 13678 ..^cfzo 13827 ♯chash 14514 Word cword 14698 splice csplice 14939 〈“cs2 15033 ~FG cefg 19973 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-n0 12646 df-z 12733 df-uz 13005 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 |
| This theorem is used by: efgredlemg 20009 efgredleme 20010 |
| Copyright terms: Public domain | W3C validator |