Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > efgredlemb | Structured version Visualization version GIF version |
Description: The reduced word that forms the base of the sequence in efgsval 18860 is uniquely determined, given the ending representation. (Contributed by Mario Carneiro, 30-Sep-2015.) |
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 | ⊢ (𝜑 → (𝑆‘𝐵) = (𝑄(𝑇‘(𝐵‘𝐿))𝑉)) |
efgredlemb.8 | ⊢ (𝜑 → ¬ (𝐴‘𝐾) = (𝐵‘𝐿)) |
Ref | Expression |
---|---|
efgredlemb | ⊢ ¬ 𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | efgval.w | . . . . 5 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
2 | efgval.r | . . . . 5 ⊢ ∼ = ( ~FG ‘𝐼) | |
3 | efgval2.m | . . . . 5 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) | |
4 | efgval2.t | . . . . 5 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) | |
5 | efgred.d | . . . . 5 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) | |
6 | efgred.s | . . . . 5 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1))) | |
7 | efgredlem.1 | . . . . . 6 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0)))) | |
8 | efgredlem.4 | . . . . . . 7 ⊢ (𝜑 → (𝑆‘𝐴) = (𝑆‘𝐵)) | |
9 | fveq2 6673 | . . . . . . . . . 10 ⊢ ((𝑆‘𝐴) = (𝑆‘𝐵) → (♯‘(𝑆‘𝐴)) = (♯‘(𝑆‘𝐵))) | |
10 | 9 | breq2d 5081 | . . . . . . . . 9 ⊢ ((𝑆‘𝐴) = (𝑆‘𝐵) → ((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐴)) ↔ (♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐵)))) |
11 | 10 | imbi1d 344 | . . . . . . . 8 ⊢ ((𝑆‘𝐴) = (𝑆‘𝐵) → (((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0))) ↔ ((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐵)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0))))) |
12 | 11 | 2ralbidv 3202 | . . . . . . 7 ⊢ ((𝑆‘𝐴) = (𝑆‘𝐵) → (∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0))) ↔ ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐵)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0))))) |
13 | 8, 12 | syl 17 | . . . . . 6 ⊢ (𝜑 → (∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐴)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0))) ↔ ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐵)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0))))) |
14 | 7, 13 | mpbid 234 | . . . . 5 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑆∀𝑏 ∈ dom 𝑆((♯‘(𝑆‘𝑎)) < (♯‘(𝑆‘𝐵)) → ((𝑆‘𝑎) = (𝑆‘𝑏) → (𝑎‘0) = (𝑏‘0)))) |
15 | efgredlem.3 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ dom 𝑆) | |
16 | efgredlem.2 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ dom 𝑆) | |
17 | 8 | eqcomd 2830 | . . . . 5 ⊢ (𝜑 → (𝑆‘𝐵) = (𝑆‘𝐴)) |
18 | efgredlem.5 | . . . . . 6 ⊢ (𝜑 → ¬ (𝐴‘0) = (𝐵‘0)) | |
19 | eqcom 2831 | . . . . . 6 ⊢ ((𝐴‘0) = (𝐵‘0) ↔ (𝐵‘0) = (𝐴‘0)) | |
20 | 18, 19 | sylnib 330 | . . . . 5 ⊢ (𝜑 → ¬ (𝐵‘0) = (𝐴‘0)) |
21 | efgredlemb.l | . . . . 5 ⊢ 𝐿 = (((♯‘𝐵) − 1) − 1) | |
22 | efgredlemb.k | . . . . 5 ⊢ 𝐾 = (((♯‘𝐴) − 1) − 1) | |
23 | efgredlemb.q | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ (0...(♯‘(𝐵‘𝐿)))) | |
24 | efgredlemb.p | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ (0...(♯‘(𝐴‘𝐾)))) | |
25 | efgredlemb.v | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ (𝐼 × 2o)) | |
26 | efgredlemb.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ (𝐼 × 2o)) | |
27 | efgredlemb.7 | . . . . 5 ⊢ (𝜑 → (𝑆‘𝐵) = (𝑄(𝑇‘(𝐵‘𝐿))𝑉)) | |
28 | efgredlemb.6 | . . . . 5 ⊢ (𝜑 → (𝑆‘𝐴) = (𝑃(𝑇‘(𝐴‘𝐾))𝑈)) | |
29 | efgredlemb.8 | . . . . . 6 ⊢ (𝜑 → ¬ (𝐴‘𝐾) = (𝐵‘𝐿)) | |
30 | eqcom 2831 | . . . . . 6 ⊢ ((𝐴‘𝐾) = (𝐵‘𝐿) ↔ (𝐵‘𝐿) = (𝐴‘𝐾)) | |
31 | 29, 30 | sylnib 330 | . . . . 5 ⊢ (𝜑 → ¬ (𝐵‘𝐿) = (𝐴‘𝐾)) |
32 | 1, 2, 3, 4, 5, 6, 14, 15, 16, 17, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31 | efgredlemc 18874 | . . . 4 ⊢ (𝜑 → (𝑄 ∈ (ℤ≥‘𝑃) → (𝐵‘0) = (𝐴‘0))) |
33 | 32, 19 | syl6ibr 254 | . . 3 ⊢ (𝜑 → (𝑄 ∈ (ℤ≥‘𝑃) → (𝐴‘0) = (𝐵‘0))) |
34 | 1, 2, 3, 4, 5, 6, 7, 16, 15, 8, 18, 22, 21, 24, 23, 26, 25, 28, 27, 29 | efgredlemc 18874 | . . 3 ⊢ (𝜑 → (𝑃 ∈ (ℤ≥‘𝑄) → (𝐴‘0) = (𝐵‘0))) |
35 | elfzelz 12911 | . . . . 5 ⊢ (𝑃 ∈ (0...(♯‘(𝐴‘𝐾))) → 𝑃 ∈ ℤ) | |
36 | 24, 35 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ ℤ) |
37 | elfzelz 12911 | . . . . 5 ⊢ (𝑄 ∈ (0...(♯‘(𝐵‘𝐿))) → 𝑄 ∈ ℤ) | |
38 | 23, 37 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑄 ∈ ℤ) |
39 | uztric 12269 | . . . 4 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℤ) → (𝑄 ∈ (ℤ≥‘𝑃) ∨ 𝑃 ∈ (ℤ≥‘𝑄))) | |
40 | 36, 38, 39 | syl2anc 586 | . . 3 ⊢ (𝜑 → (𝑄 ∈ (ℤ≥‘𝑃) ∨ 𝑃 ∈ (ℤ≥‘𝑄))) |
41 | 33, 34, 40 | mpjaod 856 | . 2 ⊢ (𝜑 → (𝐴‘0) = (𝐵‘0)) |
42 | 41, 18 | pm2.65i 196 | 1 ⊢ ¬ 𝜑 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 = wceq 1536 ∈ wcel 2113 ∀wral 3141 {crab 3145 ∖ cdif 3936 ∅c0 4294 {csn 4570 〈cop 4576 〈cotp 4578 ∪ ciun 4922 class class class wbr 5069 ↦ cmpt 5149 I cid 5462 × cxp 5556 dom cdm 5558 ran crn 5559 ‘cfv 6358 (class class class)co 7159 ∈ cmpo 7161 1oc1o 8098 2oc2o 8099 0cc0 10540 1c1 10541 < clt 10678 − cmin 10873 ℤcz 11984 ℤ≥cuz 12246 ...cfz 12895 ..^cfzo 13036 ♯chash 13693 Word cword 13864 splice csplice 14114 〈“cs2 14206 ~FG cefg 18835 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-ot 4579 df-uni 4842 df-int 4880 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-2o 8106 df-oadd 8109 df-er 8292 df-map 8411 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-card 9371 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-2 11703 df-n0 11901 df-xnn0 11971 df-z 11985 df-uz 12247 df-rp 12393 df-fz 12896 df-fzo 13037 df-hash 13694 df-word 13865 df-concat 13926 df-s1 13953 df-substr 14006 df-pfx 14036 df-splice 14115 df-s2 14213 |
This theorem is referenced by: efgredlem 18876 |
Copyright terms: Public domain | W3C validator |