| 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 (𝐼 × 2o)) |
| frgpeccl.b | ⊢ 𝐵 = (Base‘𝐺) |
| Ref | Expression |
|---|---|
| frgpeccl | ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgp0.r | . . . 4 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 2 | 1 | fvexi 6892 | . . 3 ⊢ ∼ ∈ V |
| 3 | 2 | ecelqsi 8769 | . 2 ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ (𝑊 / ∼ )) |
| 4 | frgpeccl.w | . . . . . . 7 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 5 | 4 | efgrcl 19842 | . . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2o))) |
| 6 | 5 | simpld 500 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → 𝐼 ∈ V) |
| 7 | frgp0.m | . . . . . 6 ⊢ 𝐺 = (freeGrp‘𝐼) | |
| 8 | eqid 2760 | . . . . . 6 ⊢ (freeMnd‘(𝐼 × 2o)) = (freeMnd‘(𝐼 × 2o)) | |
| 9 | 7, 8, 1 | frgpval 19885 | . . . . 5 ⊢ (𝐼 ∈ V → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 10 | 6, 9 | syl 18 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 11 | 5 | simprd 501 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → 𝑊 = Word (𝐼 × 2o)) |
| 12 | 2on 8469 | . . . . . . 7 ⊢ 2o ∈ On | |
| 13 | xpexg 7749 | . . . . . . 7 ⊢ ((𝐼 ∈ V ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
| 14 | 6, 12, 13 | sylancl 598 | . . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝐼 × 2o) ∈ V) |
| 15 | eqid 2760 | . . . . . . 7 ⊢ (Base‘(freeMnd‘(𝐼 × 2o))) = (Base‘(freeMnd‘(𝐼 × 2o))) | |
| 16 | 8, 15 | frmdbas 18961 | . . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 17 | 14, 16 | syl 18 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 18 | 11, 17 | eqtr4d 2798 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → 𝑊 = (Base‘(freeMnd‘(𝐼 × 2o)))) |
| 19 | 2 | a1i 11 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → ∼ ∈ V) |
| 20 | fvexd 6893 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → (freeMnd‘(𝐼 × 2o)) ∈ V) | |
| 21 | 10, 18, 19, 20 | qusbas 17631 | . . 3 ⊢ (𝑋 ∈ 𝑊 → (𝑊 / ∼ ) = (Base‘𝐺)) |
| 22 | frgpeccl.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 23 | 21, 22 | eqtr4di 2813 | . 2 ⊢ (𝑋 ∈ 𝑊 → (𝑊 / ∼ ) = 𝐵) |
| 24 | 3, 23 | eleqtrd 2862 | 1 ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3450 I cid 5549 × cxp 5653 Oncon0 6357 ‘cfv 6533 (class class class)co 7413 2oc2o 8449 [cec 8694 / cqs 8695 Word cword 14578 Basecbs 17301 /s cqus 17591 freeMndcfrmd 18956 ~FG cefg 19833 freeGrpcfrgp 19834 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-er 8696 df-ec 8698 df-qs 8702 df-map 8828 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-card 9944 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-uz 12888 df-fz 13562 df-fzo 13710 df-hash 14395 df-word 14579 df-struct 17239 df-slot 17274 df-ndx 17286 df-base 17302 df-plusg 17355 df-mulr 17356 df-sca 17358 df-vsca 17359 df-ip 17360 df-tset 17361 df-ple 17362 df-ds 17364 df-imas 17594 df-qus 17595 df-frmd 18958 df-frgp 19837 |
| This theorem is used by: frgpinv 19891 frgpmhm 19892 vrgpf 19895 frgpup3lem 19904 |
| Copyright terms: Public domain | W3C validator |