| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > efgtval | Structured version Visualization version GIF version | ||
| Description: Value of the extension function, which maps a word (a representation of the group element as a sequence of elements and their inverses) to its direct extensions, defined as the original representation with an element and its inverse inserted somewhere in the string. (Contributed by Mario Carneiro, 29-Sep-2015.) |
| Ref | Expression |
|---|---|
| efgval.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) |
| efgval.r | ⊢ ∼ = ( ~FG ‘𝐼) |
| efgval2.m | ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) |
| efgval2.t | ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) |
| Ref | Expression |
|---|---|
| efgtval | ⊢ ((𝑋 ∈ 𝑊 ∧ 𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑇‘𝑋)𝐴) = (𝑋 splice 〈𝑁, 𝑁, 〈“𝐴(𝑀‘𝐴)”〉〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | efgval.w | . . . . . 6 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 2 | efgval.r | . . . . . 6 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 3 | efgval2.m | . . . . . 6 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) | |
| 4 | efgval2.t | . . . . . 6 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) | |
| 5 | 1, 2, 3, 4 | efgtf 19942 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → ((𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉)) ∧ (𝑇‘𝑋):((0...(♯‘𝑋)) × (𝐼 × 2o))⟶𝑊)) |
| 6 | 5 | simpld 500 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → (𝑇‘𝑋) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉))) |
| 7 | 6 | oveqd 7438 | . . 3 ⊢ (𝑋 ∈ 𝑊 → (𝑁(𝑇‘𝑋)𝐴) = (𝑁(𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉))𝐴)) |
| 8 | oteq1 4859 | . . . . . 6 ⊢ (𝑎 = 𝑁 → 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉 = 〈𝑁, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉) | |
| 9 | oteq2 4860 | . . . . . 6 ⊢ (𝑎 = 𝑁 → 〈𝑁, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉 = 〈𝑁, 𝑁, 〈“𝑏(𝑀‘𝑏)”〉〉) | |
| 10 | 8, 9 | eqtrd 2795 | . . . . 5 ⊢ (𝑎 = 𝑁 → 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉 = 〈𝑁, 𝑁, 〈“𝑏(𝑀‘𝑏)”〉〉) |
| 11 | 10 | oveq2d 7437 | . . . 4 ⊢ (𝑎 = 𝑁 → (𝑋 splice 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉) = (𝑋 splice 〈𝑁, 𝑁, 〈“𝑏(𝑀‘𝑏)”〉〉)) |
| 12 | id 23 | . . . . . . 7 ⊢ (𝑏 = 𝐴 → 𝑏 = 𝐴) | |
| 13 | fveq2 6886 | . . . . . . 7 ⊢ (𝑏 = 𝐴 → (𝑀‘𝑏) = (𝑀‘𝐴)) | |
| 14 | 12, 13 | s2eqd 15019 | . . . . . 6 ⊢ (𝑏 = 𝐴 → 〈“𝑏(𝑀‘𝑏)”〉 = 〈“𝐴(𝑀‘𝐴)”〉) |
| 15 | 14 | oteq3d 4864 | . . . . 5 ⊢ (𝑏 = 𝐴 → 〈𝑁, 𝑁, 〈“𝑏(𝑀‘𝑏)”〉〉 = 〈𝑁, 𝑁, 〈“𝐴(𝑀‘𝐴)”〉〉) |
| 16 | 15 | oveq2d 7437 | . . . 4 ⊢ (𝑏 = 𝐴 → (𝑋 splice 〈𝑁, 𝑁, 〈“𝑏(𝑀‘𝑏)”〉〉) = (𝑋 splice 〈𝑁, 𝑁, 〈“𝐴(𝑀‘𝐴)”〉〉)) |
| 17 | eqid 2760 | . . . 4 ⊢ (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉)) = (𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉)) | |
| 18 | ovex 7454 | . . . 4 ⊢ (𝑋 splice 〈𝑁, 𝑁, 〈“𝐴(𝑀‘𝐴)”〉〉) ∈ V | |
| 19 | 11, 16, 17, 18 | ovmpo 7581 | . . 3 ⊢ ((𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑎 ∈ (0...(♯‘𝑋)), 𝑏 ∈ (𝐼 × 2o) ↦ (𝑋 splice 〈𝑎, 𝑎, 〈“𝑏(𝑀‘𝑏)”〉〉))𝐴) = (𝑋 splice 〈𝑁, 𝑁, 〈“𝐴(𝑀‘𝐴)”〉〉)) |
| 20 | 7, 19 | sylan9eq 2815 | . 2 ⊢ ((𝑋 ∈ 𝑊 ∧ (𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o))) → (𝑁(𝑇‘𝑋)𝐴) = (𝑋 splice 〈𝑁, 𝑁, 〈“𝐴(𝑀‘𝐴)”〉〉)) |
| 21 | 20 | 3impb 1132 | 1 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝑁 ∈ (0...(♯‘𝑋)) ∧ 𝐴 ∈ (𝐼 × 2o)) → (𝑁(𝑇‘𝑋)𝐴) = (𝑋 splice 〈𝑁, 𝑁, 〈“𝐴(𝑀‘𝐴)”〉〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∖ cdif 4045 〈cop 4834 〈cotp 4857 ↦ cmpt 5185 I cid 5544 × cxp 5648 ⟶wf 6535 ‘cfv 6539 (class class class)co 7421 ∈ cmpo 7423 1oc1o 8473 2oc2o 8474 0cc0 11204 ...cfz 13643 ♯chash 14478 Word cword 14662 splice csplice 14903 〈“cs2 14997 ~FG cefg 19926 |
| 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 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 |
| 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-ot 4858 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 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-2o 8481 df-er 8721 df-map 8853 df-en 8978 df-dom 8979 df-sdom 8980 df-fin 8981 df-card 10024 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-nn 12340 df-n0 12611 df-z 12698 df-uz 12970 df-fz 13644 df-fzo 13793 df-hash 14479 df-word 14663 df-concat 14720 df-s1 14747 df-substr 14794 df-pfx 14826 df-splice 14904 df-s2 15004 |
| This theorem is used by: efginvrel2 19947 efgredleme 19963 efgredlemc 19965 efgcpbllemb 19975 |
| Copyright terms: Public domain | W3C validator |