| 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 6930 | . . 3 ⊢ ∼ ∈ V |
| 3 | 2 | ecelqsi 8828 | . 2 ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ (𝑊 / ∼ )) |
| 4 | frgpeccl.w | . . . . . . 7 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 5 | 4 | efgrcl 19980 | . . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2o))) |
| 6 | 5 | simpld 500 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → 𝐼 ∈ V) |
| 7 | frgp0.m | . . . . . 6 ⊢ 𝐺 = (freeGrp‘𝐼) | |
| 8 | eqid 2763 | . . . . . 6 ⊢ (freeMnd‘(𝐼 × 2o)) = (freeMnd‘(𝐼 × 2o)) | |
| 9 | 7, 8, 1 | frgpval 20023 | . . . . 5 ⊢ (𝐼 ∈ V → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 10 | 6, 9 | syl 18 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 11 | 5 | simprd 501 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → 𝑊 = Word (𝐼 × 2o)) |
| 12 | 2on 8528 | . . . . . . 7 ⊢ 2o ∈ On | |
| 13 | xpexg 7796 | . . . . . . 7 ⊢ ((𝐼 ∈ V ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
| 14 | 6, 12, 13 | sylancl 598 | . . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝐼 × 2o) ∈ V) |
| 15 | eqid 2763 | . . . . . . 7 ⊢ (Base‘(freeMnd‘(𝐼 × 2o))) = (Base‘(freeMnd‘(𝐼 × 2o))) | |
| 16 | 8, 15 | frmdbas 19098 | . . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 17 | 14, 16 | syl 18 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 18 | 11, 17 | eqtr4d 2801 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → 𝑊 = (Base‘(freeMnd‘(𝐼 × 2o)))) |
| 19 | 2 | a1i 11 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → ∼ ∈ V) |
| 20 | fvexd 6931 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → (freeMnd‘(𝐼 × 2o)) ∈ V) | |
| 21 | 10, 18, 19, 20 | qusbas 17767 | . . 3 ⊢ (𝑋 ∈ 𝑊 → (𝑊 / ∼ ) = (Base‘𝐺)) |
| 22 | frgpeccl.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 23 | 21, 22 | eqtr4di 2816 | . 2 ⊢ (𝑋 ∈ 𝑊 → (𝑊 / ∼ ) = 𝐵) |
| 24 | 3, 23 | eleqtrd 2866 | 1 ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Vcvv 3454 I cid 5552 × cxp 5656 Oncon0 6388 ‘cfv 6566 (class class class)co 7451 2oc2o 8508 [cec 8753 / cqs 8754 Word cword 14699 Basecbs 17431 /s cqus 17727 freeMndcfrmd 19093 ~FG cefg 19971 freeGrpcfrgp 19972 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-er 8755 df-ec 8757 df-qs 8761 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-struct 17369 df-slot 17404 df-ndx 17416 df-base 17432 df-plusg 17486 df-mulr 17487 df-sca 17489 df-vsca 17490 df-ip 17491 df-tset 17492 df-ple 17493 df-ds 17495 df-imas 17730 df-qus 17731 df-frmd 19095 df-frgp 19975 |
| This theorem is used by: frgpinv 20029 frgpmhm 20030 vrgpf 20033 frgpup3lem 20042 |
| Copyright terms: Public domain | W3C validator |