| 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 6897 | . . 3 ⊢ ∼ ∈ V |
| 3 | 2 | ecelqsi 8783 | . 2 ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ (𝑊 / ∼ )) |
| 4 | frgpeccl.w | . . . . . . 7 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 5 | 4 | efgrcl 19922 | . . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2o))) |
| 6 | 5 | simpld 500 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → 𝐼 ∈ V) |
| 7 | frgp0.m | . . . . . 6 ⊢ 𝐺 = (freeGrp‘𝐼) | |
| 8 | eqid 2761 | . . . . . 6 ⊢ (freeMnd‘(𝐼 × 2o)) = (freeMnd‘(𝐼 × 2o)) | |
| 9 | 7, 8, 1 | frgpval 19965 | . . . . 5 ⊢ (𝐼 ∈ V → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 10 | 6, 9 | syl 18 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 11 | 5 | simprd 501 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → 𝑊 = Word (𝐼 × 2o)) |
| 12 | 2on 8483 | . . . . . . 7 ⊢ 2o ∈ On | |
| 13 | xpexg 7762 | . . . . . . 7 ⊢ ((𝐼 ∈ V ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
| 14 | 6, 12, 13 | sylancl 598 | . . . . . 6 ⊢ (𝑋 ∈ 𝑊 → (𝐼 × 2o) ∈ V) |
| 15 | eqid 2761 | . . . . . . 7 ⊢ (Base‘(freeMnd‘(𝐼 × 2o))) = (Base‘(freeMnd‘(𝐼 × 2o))) | |
| 16 | 8, 15 | frmdbas 19041 | . . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 17 | 14, 16 | syl 18 | . . . . 5 ⊢ (𝑋 ∈ 𝑊 → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 18 | 11, 17 | eqtr4d 2799 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → 𝑊 = (Base‘(freeMnd‘(𝐼 × 2o)))) |
| 19 | 2 | a1i 11 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → ∼ ∈ V) |
| 20 | fvexd 6898 | . . . 4 ⊢ (𝑋 ∈ 𝑊 → (freeMnd‘(𝐼 × 2o)) ∈ V) | |
| 21 | 10, 18, 19, 20 | qusbas 17710 | . . 3 ⊢ (𝑋 ∈ 𝑊 → (𝑊 / ∼ ) = (Base‘𝐺)) |
| 22 | frgpeccl.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 23 | 21, 22 | eqtr4di 2814 | . 2 ⊢ (𝑋 ∈ 𝑊 → (𝑊 / ∼ ) = 𝐵) |
| 24 | 3, 23 | eleqtrd 2863 | 1 ⊢ (𝑋 ∈ 𝑊 → [𝑋] ∼ ∈ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3451 I cid 5545 × cxp 5649 Oncon0 6361 ‘cfv 6537 (class class class)co 7418 2oc2o 8463 [cec 8708 / cqs 8709 Word cword 14651 Basecbs 17380 /s cqus 17670 freeMndcfrmd 19036 ~FG cefg 19913 freeGrpcfrgp 19914 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-2o 8470 df-er 8710 df-ec 8712 df-qs 8716 df-map 8842 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-sup 9427 df-inf 9428 df-card 10013 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-3 12399 df-4 12400 df-5 12401 df-6 12402 df-7 12403 df-8 12404 df-9 12405 df-n0 12600 df-z 12687 df-dec 12808 df-uz 12959 df-fz 13633 df-fzo 13782 df-hash 14468 df-word 14652 df-struct 17318 df-slot 17353 df-ndx 17365 df-base 17381 df-plusg 17434 df-mulr 17435 df-sca 17437 df-vsca 17438 df-ip 17439 df-tset 17440 df-ple 17441 df-ds 17443 df-imas 17673 df-qus 17674 df-frmd 19038 df-frgp 19917 |
| This theorem is used by: frgpinv 19971 frgpmhm 19972 vrgpf 19975 frgpup3lem 19984 |
| Copyright terms: Public domain | W3C validator |