![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > frgpeccl | Structured version Visualization version GIF version |
Description: Closure of the quotient map in a free group. (Contributed by Mario Carneiro, 1-Oct-2015.) |
Ref | Expression |
---|---|
frgp0.m | ⊢ 𝐺 = (freeGrp‘𝐼) |
frgp0.r | ⊢ ∼ = ( ~FG ‘𝐼) |
frgpeccl.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2𝑜)) |
frgpeccl.b | ⊢ 𝐵 = (Base‘𝐺) |
Ref | Expression |
---|---|
frgpeccl | ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | frgp0.r | . . . 4 ⊢ ∼ = ( ~FG ‘𝐼) | |
2 | fvex 6113 | . . . 4 ⊢ ( ~FG ‘𝐼) ∈ V | |
3 | 1, 2 | eqeltri 2684 | . . 3 ⊢ ∼ ∈ V |
4 | 3 | ecelqsi 7690 | . 2 ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ (𝑊 / ∼ )) |
5 | frgpeccl.w | . . . . . . 7 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2𝑜)) | |
6 | 5 | efgrcl 17951 | . . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2𝑜))) |
7 | 6 | simpld 474 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → 𝐼 ∈ V) |
8 | frgp0.m | . . . . . 6 ⊢ 𝐺 = (freeGrp‘𝐼) | |
9 | eqid 2610 | . . . . . 6 ⊢ (freeMnd‘(𝐼 × 2𝑜)) = (freeMnd‘(𝐼 × 2𝑜)) | |
10 | 8, 9, 1 | frgpval 17994 | . . . . 5 ⊢ (𝐼 ∈ V → 𝐺 = ((freeMnd‘(𝐼 × 2𝑜)) /s ∼ )) |
11 | 7, 10 | syl 17 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → 𝐺 = ((freeMnd‘(𝐼 × 2𝑜)) /s ∼ )) |
12 | 6 | simprd 478 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → 𝑊 = Word (𝐼 × 2𝑜)) |
13 | 2on 7455 | . . . . . . 7 ⊢ 2𝑜 ∈ On | |
14 | xpexg 6858 | . . . . . . 7 ⊢ ((𝐼 ∈ V ∧ 2𝑜 ∈ On) → (𝐼 × 2𝑜) ∈ V) | |
15 | 7, 13, 14 | sylancl 693 | . . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝐼 × 2𝑜) ∈ V) |
16 | eqid 2610 | . . . . . . 7 ⊢ (Base‘(freeMnd‘(𝐼 × 2𝑜))) = (Base‘(freeMnd‘(𝐼 × 2𝑜))) | |
17 | 9, 16 | frmdbas 17212 | . . . . . 6 ⊢ ((𝐼 × 2𝑜) ∈ V → (Base‘(freeMnd‘(𝐼 × 2𝑜))) = Word (𝐼 × 2𝑜)) |
18 | 15, 17 | syl 17 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → (Base‘(freeMnd‘(𝐼 × 2𝑜))) = Word (𝐼 × 2𝑜)) |
19 | 12, 18 | eqtr4d 2647 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → 𝑊 = (Base‘(freeMnd‘(𝐼 × 2𝑜)))) |
20 | 3 | a1i 11 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → ∼ ∈ V) |
21 | fvex 6113 | . . . . 5 ⊢ (freeMnd‘(𝐼 × 2𝑜)) ∈ V | |
22 | 21 | a1i 11 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → (freeMnd‘(𝐼 × 2𝑜)) ∈ V) |
23 | 11, 19, 20, 22 | qusbas 16028 | . . 3 ⊢ (𝑋 ∈ 𝑊 → (𝑊 / ∼ ) = (Base‘𝐺)) |
24 | frgpeccl.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
25 | 23, 24 | syl6eqr 2662 | . 2 ⊢ (𝑋 ∈ 𝑊 → (𝑊 / ∼ ) = 𝐵) |
26 | 4, 25 | eleqtrd 2690 | 1 ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 Vcvv 3173 I cid 4948 × cxp 5036 Oncon0 5640 ‘cfv 5804 (class class class)co 6549 2𝑜c2o 7441 [cec 7627 / cqs 7628 Word cword 13146 Basecbs 15695 /s cqus 15988 freeMndcfrmd 17207 ~FG cefg 17942 freeGrpcfrgp 17943 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-er 7629 df-ec 7631 df-qs 7635 df-map 7746 df-pm 7747 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-inf 8232 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-uz 11564 df-fz 12198 df-fzo 12335 df-hash 12980 df-word 13154 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-plusg 15781 df-mulr 15782 df-sca 15784 df-vsca 15785 df-ip 15786 df-tset 15787 df-ple 15788 df-ds 15791 df-imas 15991 df-qus 15992 df-frmd 17209 df-frgp 17946 |
This theorem is referenced by: frgpinv 18000 frgpmhm 18001 vrgpf 18004 frgpup3lem 18013 |
Copyright terms: Public domain | W3C validator |