| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > efgredlemg | Structured version Visualization version GIF version | ||
| Description: Lemma for efgred 20015. (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) |
| efgredlemb.p | ⊢ (𝜑 → 𝑃 ∈ (0...(♯‘(𝐴‘𝐾)))) |
| efgredlemb.q | ⊢ (𝜑 → 𝑄 ∈ (0...(♯‘(𝐵‘𝐿)))) |
| efgredlemb.u | ⊢ (𝜑 → 𝑈 ∈ (𝐼 × 2o)) |
| efgredlemb.v | ⊢ (𝜑 → 𝑉 ∈ (𝐼 × 2o)) |
| efgredlemb.6 | ⊢ (𝜑 → (𝑆‘𝐴) = (𝑃(𝑇‘(𝐴‘𝐾))𝑈)) |
| efgredlemb.7 | ⊢ (𝜑 → (𝑆‘𝐵) = (𝑄(𝑇‘(𝐵‘𝐿))𝑉)) |
| Ref | Expression |
|---|---|
| efgredlemg | ⊢ (𝜑 → (♯‘(𝐴‘𝐾)) = (♯‘(𝐵‘𝐿))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | efgval.w | . . . . . 6 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 2 | fviss 6992 | . . . . . 6 ⊢ ( I ‘Word (𝐼 × 2o)) ⊆ Word (𝐼 × 2o) | |
| 3 | 1, 2 | eqsstri 3958 | . . . . 5 ⊢ 𝑊 ⊆ Word (𝐼 × 2o) |
| 4 | efgval.r | . . . . . . 7 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 5 | efgval2.m | . . . . . . 7 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) | |
| 6 | efgval2.t | . . . . . . 7 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) | |
| 7 | efgred.d | . . . . . . 7 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) | |
| 8 | efgred.s | . . . . . . 7 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1))) | |
| 9 | efgredlem.1 | . . . . . . 7 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0)))) | |
| 10 | efgredlem.2 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ dom 𝑆) | |
| 11 | efgredlem.3 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ dom 𝑆) | |
| 12 | efgredlem.4 | . . . . . . 7 ⊢ (𝜑 → (𝑆‘𝐴) = (𝑆‘𝐵)) | |
| 13 | efgredlem.5 | . . . . . . 7 ⊢ (𝜑 → ¬ (𝐴‘0) = (𝐵‘0)) | |
| 14 | efgredlemb.k | . . . . . . 7 ⊢ 𝐾 = (((♯‘𝐴) − 1) − 1) | |
| 15 | efgredlemb.l | . . . . . . 7 ⊢ 𝐿 = (((♯‘𝐵) − 1) − 1) | |
| 16 | 1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 | efgredlemf 20008 | . . . . . 6 ⊢ (𝜑 → ((𝐴‘𝐾) ∈ 𝑊 ∧ (𝐵‘𝐿) ∈ 𝑊)) |
| 17 | 16 | simpld 500 | . . . . 5 ⊢ (𝜑 → (𝐴‘𝐾) ∈ 𝑊) |
| 18 | 3, 17 | sselid 3910 | . . . 4 ⊢ (𝜑 → (𝐴‘𝐾) ∈ Word (𝐼 × 2o)) |
| 19 | lencl 14718 | . . . 4 ⊢ ((𝐴‘𝐾) ∈ Word (𝐼 × 2o) → (♯‘(𝐴‘𝐾)) ∈ ℕ0) | |
| 20 | 18, 19 | syl 18 | . . 3 ⊢ (𝜑 → (♯‘(𝐴‘𝐾)) ∈ ℕ0) |
| 21 | 20 | nn0cnd 12708 | . 2 ⊢ (𝜑 → (♯‘(𝐴‘𝐾)) ∈ ℂ) |
| 22 | 16 | simprd 501 | . . . . 5 ⊢ (𝜑 → (𝐵‘𝐿) ∈ 𝑊) |
| 23 | 3, 22 | sselid 3910 | . . . 4 ⊢ (𝜑 → (𝐵‘𝐿) ∈ Word (𝐼 × 2o)) |
| 24 | lencl 14718 | . . . 4 ⊢ ((𝐵‘𝐿) ∈ Word (𝐼 × 2o) → (♯‘(𝐵‘𝐿)) ∈ ℕ0) | |
| 25 | 23, 24 | syl 18 | . . 3 ⊢ (𝜑 → (♯‘(𝐵‘𝐿)) ∈ ℕ0) |
| 26 | 25 | nn0cnd 12708 | . 2 ⊢ (𝜑 → (♯‘(𝐵‘𝐿)) ∈ ℂ) |
| 27 | 2cnd 12460 | . 2 ⊢ (𝜑 → 2 ∈ ℂ) | |
| 28 | 1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 | efgredlema 20007 | . . . . . . 7 ⊢ (𝜑 → (((♯‘𝐴) − 1) ∈ ℕ ∧ ((♯‘𝐵) − 1) ∈ ℕ)) |
| 29 | 28 | simpld 500 | . . . . . 6 ⊢ (𝜑 → ((♯‘𝐴) − 1) ∈ ℕ) |
| 30 | 1, 4, 5, 6, 7, 8 | efgsdmi 19999 | . . . . . 6 ⊢ ((𝐴 ∈ dom 𝑆 ∧ ((♯‘𝐴) − 1) ∈ ℕ) → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐴‘(((♯‘𝐴) − 1) − 1)))) |
| 31 | 10, 29, 30 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐴‘(((♯‘𝐴) − 1) − 1)))) |
| 32 | 14 | fveq2i 6918 | . . . . . . 7 ⊢ (𝐴‘𝐾) = (𝐴‘(((♯‘𝐴) − 1) − 1)) |
| 33 | 32 | fveq2i 6918 | . . . . . 6 ⊢ (𝑇‘(𝐴‘𝐾)) = (𝑇‘(𝐴‘(((♯‘𝐴) − 1) − 1))) |
| 34 | 33 | rneqi 5930 | . . . . 5 ⊢ ran (𝑇‘(𝐴‘𝐾)) = ran (𝑇‘(𝐴‘(((♯‘𝐴) − 1) − 1))) |
| 35 | 31, 34 | eleqtrrdi 2878 | . . . 4 ⊢ (𝜑 → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐴‘𝐾))) |
| 36 | 1, 4, 5, 6 | efgtlen 19993 | . . . 4 ⊢ (((𝐴‘𝐾) ∈ 𝑊 ∧ (𝑆‘𝐴) ∈ ran (𝑇‘(𝐴‘𝐾))) → (♯‘(𝑆‘𝐴)) = ((♯‘(𝐴‘𝐾)) + 2)) |
| 37 | 17, 35, 36 | syl2anc 596 | . . 3 ⊢ (𝜑 → (♯‘(𝑆‘𝐴)) = ((♯‘(𝐴‘𝐾)) + 2)) |
| 38 | 28 | simprd 501 | . . . . . . 7 ⊢ (𝜑 → ((♯‘𝐵) − 1) ∈ ℕ) |
| 39 | 1, 4, 5, 6, 7, 8 | efgsdmi 19999 | . . . . . . 7 ⊢ ((𝐵 ∈ dom 𝑆 ∧ ((♯‘𝐵) − 1) ∈ ℕ) → (𝑆‘𝐵) ∈ ran (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1)))) |
| 40 | 11, 38, 39 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (𝑆‘𝐵) ∈ ran (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1)))) |
| 41 | 12, 40 | eqeltrd 2867 | . . . . 5 ⊢ (𝜑 → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1)))) |
| 42 | 15 | fveq2i 6918 | . . . . . . 7 ⊢ (𝐵‘𝐿) = (𝐵‘(((♯‘𝐵) − 1) − 1)) |
| 43 | 42 | fveq2i 6918 | . . . . . 6 ⊢ (𝑇‘(𝐵‘𝐿)) = (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1))) |
| 44 | 43 | rneqi 5930 | . . . . 5 ⊢ ran (𝑇‘(𝐵‘𝐿)) = ran (𝑇‘(𝐵‘(((♯‘𝐵) − 1) − 1))) |
| 45 | 41, 44 | eleqtrrdi 2878 | . . . 4 ⊢ (𝜑 → (𝑆‘𝐴) ∈ ran (𝑇‘(𝐵‘𝐿))) |
| 46 | 1, 4, 5, 6 | efgtlen 19993 | . . . 4 ⊢ (((𝐵‘𝐿) ∈ 𝑊 ∧ (𝑆‘𝐴) ∈ ran (𝑇‘(𝐵‘𝐿))) → (♯‘(𝑆‘𝐴)) = ((♯‘(𝐵‘𝐿)) + 2)) |
| 47 | 22, 45, 46 | syl2anc 596 | . . 3 ⊢ (𝜑 → (♯‘(𝑆‘𝐴)) = ((♯‘(𝐵‘𝐿)) + 2)) |
| 48 | 37, 47 | eqtr3d 2803 | . 2 ⊢ (𝜑 → ((♯‘(𝐴‘𝐾)) + 2) = ((♯‘(𝐵‘𝐿)) + 2)) |
| 49 | 21, 26, 27, 48 | addcan2ad 11554 | 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 ‘cfv 6565 (class class class)co 7450 ∈ cmpo 7452 1oc1o 8506 2oc2o 8507 0cc0 11238 1c1 11239 + caddc 11241 < clt 11381 − cmin 11579 ℕcn 12374 2c2 12436 ℕ0cn0 12645 ...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-ot 4863 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-2o 8514 df-er 8754 df-map 8886 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 df-concat 14756 df-s1 14783 df-substr 14830 df-pfx 14862 df-splice 14940 df-s2 15040 |
| This theorem is used by: efgredleme 20010 |
| Copyright terms: Public domain | W3C validator |