Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > efgi0 | Structured version Visualization version GIF version |
Description: Value of the free group construction. (Contributed by Mario Carneiro, 27-Sep-2015.) (Revised by Mario Carneiro, 27-Feb-2016.) |
Ref | Expression |
---|---|
efgval.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2𝑜)) |
efgval.r | ⊢ ∼ = ( ~FG ‘𝐼) |
Ref | Expression |
---|---|
efgi0 | ⊢ ((𝐴 ∈ 𝑊 ∧ 𝑁 ∈ (0...(#‘𝐴)) ∧ 𝐽 ∈ 𝐼) → 𝐴 ∼ (𝐴 splice 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, 1𝑜〉”〉〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0ex 4790 | . . . . . 6 ⊢ ∅ ∈ V | |
2 | 1 | prid1 4297 | . . . . 5 ⊢ ∅ ∈ {∅, 1𝑜} |
3 | df2o3 7573 | . . . . 5 ⊢ 2𝑜 = {∅, 1𝑜} | |
4 | 2, 3 | eleqtrri 2700 | . . . 4 ⊢ ∅ ∈ 2𝑜 |
5 | efgval.w | . . . . 5 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2𝑜)) | |
6 | efgval.r | . . . . 5 ⊢ ∼ = ( ~FG ‘𝐼) | |
7 | 5, 6 | efgi 18132 | . . . 4 ⊢ (((𝐴 ∈ 𝑊 ∧ 𝑁 ∈ (0...(#‘𝐴))) ∧ (𝐽 ∈ 𝐼 ∧ ∅ ∈ 2𝑜)) → 𝐴 ∼ (𝐴 splice 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, (1𝑜 ∖ ∅)〉”〉〉)) |
8 | 4, 7 | mpanr2 720 | . . 3 ⊢ (((𝐴 ∈ 𝑊 ∧ 𝑁 ∈ (0...(#‘𝐴))) ∧ 𝐽 ∈ 𝐼) → 𝐴 ∼ (𝐴 splice 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, (1𝑜 ∖ ∅)〉”〉〉)) |
9 | 8 | 3impa 1259 | . 2 ⊢ ((𝐴 ∈ 𝑊 ∧ 𝑁 ∈ (0...(#‘𝐴)) ∧ 𝐽 ∈ 𝐼) → 𝐴 ∼ (𝐴 splice 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, (1𝑜 ∖ ∅)〉”〉〉)) |
10 | tru 1487 | . . . 4 ⊢ ⊤ | |
11 | eqidd 2623 | . . . . 5 ⊢ (⊤ → 〈𝐽, ∅〉 = 〈𝐽, ∅〉) | |
12 | dif0 3950 | . . . . . . 7 ⊢ (1𝑜 ∖ ∅) = 1𝑜 | |
13 | 12 | opeq2i 4406 | . . . . . 6 ⊢ 〈𝐽, (1𝑜 ∖ ∅)〉 = 〈𝐽, 1𝑜〉 |
14 | 13 | a1i 11 | . . . . 5 ⊢ (⊤ → 〈𝐽, (1𝑜 ∖ ∅)〉 = 〈𝐽, 1𝑜〉) |
15 | 11, 14 | s2eqd 13608 | . . . 4 ⊢ (⊤ → 〈“〈𝐽, ∅〉〈𝐽, (1𝑜 ∖ ∅)〉”〉 = 〈“〈𝐽, ∅〉〈𝐽, 1𝑜〉”〉) |
16 | oteq3 4413 | . . . 4 ⊢ (〈“〈𝐽, ∅〉〈𝐽, (1𝑜 ∖ ∅)〉”〉 = 〈“〈𝐽, ∅〉〈𝐽, 1𝑜〉”〉 → 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, (1𝑜 ∖ ∅)〉”〉〉 = 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, 1𝑜〉”〉〉) | |
17 | 10, 15, 16 | mp2b 10 | . . 3 ⊢ 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, (1𝑜 ∖ ∅)〉”〉〉 = 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, 1𝑜〉”〉〉 |
18 | 17 | oveq2i 6661 | . 2 ⊢ (𝐴 splice 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, (1𝑜 ∖ ∅)〉”〉〉) = (𝐴 splice 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, 1𝑜〉”〉〉) |
19 | 9, 18 | syl6breq 4694 | 1 ⊢ ((𝐴 ∈ 𝑊 ∧ 𝑁 ∈ (0...(#‘𝐴)) ∧ 𝐽 ∈ 𝐼) → 𝐴 ∼ (𝐴 splice 〈𝑁, 𝑁, 〈“〈𝐽, ∅〉〈𝐽, 1𝑜〉”〉〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ⊤wtru 1484 ∈ wcel 1990 ∖ cdif 3571 ∅c0 3915 {cpr 4179 〈cop 4183 〈cotp 4185 class class class wbr 4653 I cid 5023 × cxp 5112 ‘cfv 5888 (class class class)co 6650 1𝑜c1o 7553 2𝑜c2o 7554 0cc0 9936 ...cfz 12326 #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-ot 4186 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-2o 7561 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 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-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 df-concat 13301 df-s1 13302 df-substr 13303 df-splice 13304 df-s2 13593 df-efg 18122 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |