| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgpup2 | Structured version Visualization version GIF version | ||
| Description: The evaluation map has the intended behavior on the generators. (Contributed by Mario Carneiro, 2-Oct-2015.) (Revised by Mario Carneiro, 28-Feb-2016.) |
| Ref | Expression |
|---|---|
| frgpup.b | ⊢ 𝐵 = (Base‘𝐻) |
| frgpup.n | ⊢ 𝑁 = (invg‘𝐻) |
| frgpup.t | ⊢ 𝑇 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦)))) |
| frgpup.h | ⊢ (𝜑 → 𝐻 ∈ Grp) |
| frgpup.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
| frgpup.a | ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
| frgpup.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) |
| frgpup.r | ⊢ ∼ = ( ~FG ‘𝐼) |
| frgpup.g | ⊢ 𝐺 = (freeGrp‘𝐼) |
| frgpup.x | ⊢ 𝑋 = (Base‘𝐺) |
| frgpup.e | ⊢ 𝐸 = ran (𝑔 ∈ 𝑊 ↦ 〈[𝑔] ∼ , (𝐻 Σg (𝑇 ∘ 𝑔))〉) |
| frgpup.u | ⊢ 𝑈 = (varFGrp‘𝐼) |
| frgpup.y | ⊢ (𝜑 → 𝐴 ∈ 𝐼) |
| Ref | Expression |
|---|---|
| frgpup2 | ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐹‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgpup.i | . . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
| 2 | frgpup.y | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐼) | |
| 3 | frgpup.r | . . . . 5 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 4 | frgpup.u | . . . . 5 ⊢ 𝑈 = (varFGrp‘𝐼) | |
| 5 | 3, 4 | vrgpval 19981 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
| 6 | 1, 2, 5 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
| 7 | 6 | fveq2d 6889 | . 2 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ )) |
| 8 | 0ex 5260 | . . . . . . . 8 ⊢ ∅ ∈ V | |
| 9 | 8 | prid1 4722 | . . . . . . 7 ⊢ ∅ ∈ {∅, 1o} |
| 10 | df2o3 8484 | . . . . . . 7 ⊢ 2o = {∅, 1o} | |
| 11 | 9, 10 | eleqtrri 2859 | . . . . . 6 ⊢ ∅ ∈ 2o |
| 12 | opelxpi 5687 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) | |
| 13 | 2, 11, 12 | sylancl 598 | . . . . 5 ⊢ (𝜑 → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) |
| 14 | 13 | s1cld 14750 | . . . 4 ⊢ (𝜑 → 〈“〈𝐴, ∅〉”〉 ∈ Word (𝐼 × 2o)) |
| 15 | frgpup.w | . . . . 5 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 16 | 2on 8490 | . . . . . . 7 ⊢ 2o ∈ On | |
| 17 | xpexg 7764 | . . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
| 18 | 1, 16, 17 | sylancl 598 | . . . . . 6 ⊢ (𝜑 → (𝐼 × 2o) ∈ V) |
| 19 | wrdexg 14669 | . . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V) | |
| 20 | fvi 6961 | . . . . . 6 ⊢ (Word (𝐼 × 2o) ∈ V → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o)) | |
| 21 | 18, 19, 20 | 3syl 19 | . . . . 5 ⊢ (𝜑 → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o)) |
| 22 | 15, 21 | eqtrid 2807 | . . . 4 ⊢ (𝜑 → 𝑊 = Word (𝐼 × 2o)) |
| 23 | 14, 22 | eleqtrrd 2863 | . . 3 ⊢ (𝜑 → 〈“〈𝐴, ∅〉”〉 ∈ 𝑊) |
| 24 | frgpup.b | . . . 4 ⊢ 𝐵 = (Base‘𝐻) | |
| 25 | frgpup.n | . . . 4 ⊢ 𝑁 = (invg‘𝐻) | |
| 26 | frgpup.t | . . . 4 ⊢ 𝑇 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦)))) | |
| 27 | frgpup.h | . . . 4 ⊢ (𝜑 → 𝐻 ∈ Grp) | |
| 28 | frgpup.a | . . . 4 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) | |
| 29 | frgpup.g | . . . 4 ⊢ 𝐺 = (freeGrp‘𝐼) | |
| 30 | frgpup.x | . . . 4 ⊢ 𝑋 = (Base‘𝐺) | |
| 31 | frgpup.e | . . . 4 ⊢ 𝐸 = ran (𝑔 ∈ 𝑊 ↦ 〈[𝑔] ∼ , (𝐻 Σg (𝑇 ∘ 𝑔))〉) | |
| 32 | 24, 25, 26, 27, 1, 28, 15, 3, 29, 30, 31 | frgpupval 19988 | . . 3 ⊢ ((𝜑 ∧ 〈“〈𝐴, ∅〉”〉 ∈ 𝑊) → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
| 33 | 23, 32 | mpdan 700 | . 2 ⊢ (𝜑 → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
| 34 | 24, 25, 26, 27, 1, 28 | frgpuptf 19984 | . . . . . 6 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
| 35 | s1co 14984 | . . . . . 6 ⊢ ((〈𝐴, ∅〉 ∈ (𝐼 × 2o) ∧ 𝑇:(𝐼 × 2o)⟶𝐵) → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) | |
| 36 | 13, 34, 35 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) |
| 37 | df-ov 7423 | . . . . . . 7 ⊢ (𝐴𝑇∅) = (𝑇‘〈𝐴, ∅〉) | |
| 38 | iftrue 4487 | . . . . . . . . . 10 ⊢ (𝑧 = ∅ → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝑦)) | |
| 39 | fveq2 6885 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝐹‘𝑦) = (𝐹‘𝐴)) | |
| 40 | 38, 39 | sylan9eqr 2817 | . . . . . . . . 9 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = ∅) → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝐴)) |
| 41 | fvex 6898 | . . . . . . . . 9 ⊢ (𝐹‘𝐴) ∈ V | |
| 42 | 40, 26, 41 | ovmpoa 7575 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → (𝐴𝑇∅) = (𝐹‘𝐴)) |
| 43 | 2, 11, 42 | sylancl 598 | . . . . . . 7 ⊢ (𝜑 → (𝐴𝑇∅) = (𝐹‘𝐴)) |
| 44 | 37, 43 | eqtr3id 2809 | . . . . . 6 ⊢ (𝜑 → (𝑇‘〈𝐴, ∅〉) = (𝐹‘𝐴)) |
| 45 | 44 | s1eqd 14748 | . . . . 5 ⊢ (𝜑 → 〈“(𝑇‘〈𝐴, ∅〉)”〉 = 〈“(𝐹‘𝐴)”〉) |
| 46 | 36, 45 | eqtrd 2795 | . . . 4 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝐹‘𝐴)”〉) |
| 47 | 46 | oveq2d 7436 | . . 3 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐻 Σg 〈“(𝐹‘𝐴)”〉)) |
| 48 | 28, 2 | ffvelcdmd 7085 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝐵) |
| 49 | 24 | gsumws1 19034 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
| 50 | 48, 49 | syl 18 | . . 3 ⊢ (𝜑 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
| 51 | 47, 50 | eqtrd 2795 | . 2 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐹‘𝐴)) |
| 52 | 7, 33, 51 | 3eqtrd 2799 | 1 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐹‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∅c0 4278 ifcif 4481 {cpr 4585 〈cop 4589 ↦ cmpt 5185 I cid 5544 × cxp 5648 ran crn 5651 ∘ ccom 5654 Oncon0 6362 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ∈ cmpo 7422 1oc1o 8469 2oc2o 8470 [cec 8715 Word cword 14658 〈“cs1 14742 Basecbs 17387 Σg cgsu 17611 Grpcgrp 19144 invgcminusg 19145 ~FG cefg 19920 freeGrpcfrgp 19921 varFGrpcvrgp 19922 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-tp 4588 df-op 4590 df-ot 4592 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-2o 8477 df-er 8717 df-ec 8719 df-qs 8723 df-map 8849 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 df-inf 9435 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-fz 13640 df-fzo 13789 df-seq 14145 df-hash 14475 df-word 14659 df-concat 14716 df-s1 14743 df-substr 14789 df-pfx 14821 df-splice 14899 df-s2 14999 df-struct 17325 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-ress 17409 df-plusg 17441 df-mulr 17442 df-sca 17444 df-vsca 17445 df-ip 17446 df-tset 17447 df-ple 17448 df-ds 17450 df-0g 17612 df-gsum 17613 df-imas 17680 df-qus 17681 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-submnd 18979 df-frmd 19045 df-grp 19147 df-minusg 19148 df-efg 19923 df-frgp 19924 df-vrgp 19925 |
| This theorem is used by: frgpup3 19992 |
| Copyright terms: Public domain | W3C validator |