![]() |
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 19545 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
6 | 1, 2, 5 | syl2anc 584 | . . 3 ⊢ (𝜑 → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
7 | 6 | fveq2d 6844 | . 2 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ )) |
8 | 0ex 5263 | . . . . . . . 8 ⊢ ∅ ∈ V | |
9 | 8 | prid1 4722 | . . . . . . 7 ⊢ ∅ ∈ {∅, 1o} |
10 | df2o3 8417 | . . . . . . 7 ⊢ 2o = {∅, 1o} | |
11 | 9, 10 | eleqtrri 2837 | . . . . . 6 ⊢ ∅ ∈ 2o |
12 | opelxpi 5669 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) | |
13 | 2, 11, 12 | sylancl 586 | . . . . 5 ⊢ (𝜑 → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) |
14 | 13 | s1cld 14488 | . . . 4 ⊢ (𝜑 → 〈“〈𝐴, ∅〉”〉 ∈ Word (𝐼 × 2o)) |
15 | frgpup.w | . . . . 5 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
16 | 2on 8423 | . . . . . . 7 ⊢ 2o ∈ On | |
17 | xpexg 7681 | . . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
18 | 1, 16, 17 | sylancl 586 | . . . . . 6 ⊢ (𝜑 → (𝐼 × 2o) ∈ V) |
19 | wrdexg 14409 | . . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V) | |
20 | fvi 6915 | . . . . . 6 ⊢ (Word (𝐼 × 2o) ∈ V → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o)) | |
21 | 18, 19, 20 | 3syl 18 | . . . . 5 ⊢ (𝜑 → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o)) |
22 | 15, 21 | eqtrid 2788 | . . . 4 ⊢ (𝜑 → 𝑊 = Word (𝐼 × 2o)) |
23 | 14, 22 | eleqtrrd 2841 | . . 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 19552 | . . 3 ⊢ ((𝜑 ∧ 〈“〈𝐴, ∅〉”〉 ∈ 𝑊) → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
33 | 23, 32 | mpdan 685 | . 2 ⊢ (𝜑 → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
34 | 24, 25, 26, 27, 1, 28 | frgpuptf 19548 | . . . . . 6 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
35 | s1co 14719 | . . . . . 6 ⊢ ((〈𝐴, ∅〉 ∈ (𝐼 × 2o) ∧ 𝑇:(𝐼 × 2o)⟶𝐵) → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) | |
36 | 13, 34, 35 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) |
37 | df-ov 7357 | . . . . . . 7 ⊢ (𝐴𝑇∅) = (𝑇‘〈𝐴, ∅〉) | |
38 | iftrue 4491 | . . . . . . . . . 10 ⊢ (𝑧 = ∅ → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝑦)) | |
39 | fveq2 6840 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝐹‘𝑦) = (𝐹‘𝐴)) | |
40 | 38, 39 | sylan9eqr 2798 | . . . . . . . . 9 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = ∅) → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝐴)) |
41 | fvex 6853 | . . . . . . . . 9 ⊢ (𝐹‘𝐴) ∈ V | |
42 | 40, 26, 41 | ovmpoa 7507 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → (𝐴𝑇∅) = (𝐹‘𝐴)) |
43 | 2, 11, 42 | sylancl 586 | . . . . . . 7 ⊢ (𝜑 → (𝐴𝑇∅) = (𝐹‘𝐴)) |
44 | 37, 43 | eqtr3id 2790 | . . . . . 6 ⊢ (𝜑 → (𝑇‘〈𝐴, ∅〉) = (𝐹‘𝐴)) |
45 | 44 | s1eqd 14486 | . . . . 5 ⊢ (𝜑 → 〈“(𝑇‘〈𝐴, ∅〉)”〉 = 〈“(𝐹‘𝐴)”〉) |
46 | 36, 45 | eqtrd 2776 | . . . 4 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝐹‘𝐴)”〉) |
47 | 46 | oveq2d 7370 | . . 3 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐻 Σg 〈“(𝐹‘𝐴)”〉)) |
48 | 28, 2 | ffvelcdmd 7033 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝐵) |
49 | 24 | gsumws1 18645 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
50 | 48, 49 | syl 17 | . . 3 ⊢ (𝜑 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
51 | 47, 50 | eqtrd 2776 | . 2 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐹‘𝐴)) |
52 | 7, 33, 51 | 3eqtrd 2780 | 1 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐹‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 Vcvv 3444 ∅c0 4281 ifcif 4485 {cpr 4587 〈cop 4591 ↦ cmpt 5187 I cid 5529 × cxp 5630 ran crn 5633 ∘ ccom 5636 Oncon0 6316 ⟶wf 6490 ‘cfv 6494 (class class class)co 7354 ∈ cmpo 7356 1oc1o 8402 2oc2o 8403 [cec 8643 Word cword 14399 〈“cs1 14480 Basecbs 17080 Σg cgsu 17319 Grpcgrp 18745 invgcminusg 18746 ~FG cefg 19484 freeGrpcfrgp 19485 varFGrpcvrgp 19486 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5241 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7669 ax-cnex 11104 ax-resscn 11105 ax-1cn 11106 ax-icn 11107 ax-addcl 11108 ax-addrcl 11109 ax-mulcl 11110 ax-mulrcl 11111 ax-mulcom 11112 ax-addass 11113 ax-mulass 11114 ax-distr 11115 ax-i2m1 11116 ax-1ne0 11117 ax-1rid 11118 ax-rnegex 11119 ax-rrecex 11120 ax-cnre 11121 ax-pre-lttri 11122 ax-pre-lttrn 11123 ax-pre-ltadd 11124 ax-pre-mulgt0 11125 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-pss 3928 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-ot 4594 df-uni 4865 df-int 4907 df-iun 4955 df-iin 4956 df-br 5105 df-opab 5167 df-mpt 5188 df-tr 5222 df-id 5530 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5587 df-we 5589 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6252 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6446 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7310 df-ov 7357 df-oprab 7358 df-mpo 7359 df-om 7800 df-1st 7918 df-2nd 7919 df-frecs 8209 df-wrecs 8240 df-recs 8314 df-rdg 8353 df-1o 8409 df-2o 8410 df-er 8645 df-ec 8647 df-qs 8651 df-map 8764 df-en 8881 df-dom 8882 df-sdom 8883 df-fin 8884 df-sup 9375 df-inf 9376 df-card 9872 df-pnf 11188 df-mnf 11189 df-xr 11190 df-ltxr 11191 df-le 11192 df-sub 11384 df-neg 11385 df-nn 12151 df-2 12213 df-3 12214 df-4 12215 df-5 12216 df-6 12217 df-7 12218 df-8 12219 df-9 12220 df-n0 12411 df-z 12497 df-dec 12616 df-uz 12761 df-fz 13422 df-fzo 13565 df-seq 13904 df-hash 14228 df-word 14400 df-concat 14456 df-s1 14481 df-substr 14526 df-pfx 14556 df-splice 14635 df-s2 14734 df-struct 17016 df-sets 17033 df-slot 17051 df-ndx 17063 df-base 17081 df-ress 17110 df-plusg 17143 df-mulr 17144 df-sca 17146 df-vsca 17147 df-ip 17148 df-tset 17149 df-ple 17150 df-ds 17152 df-0g 17320 df-gsum 17321 df-imas 17387 df-qus 17388 df-mgm 18494 df-sgrp 18543 df-mnd 18554 df-submnd 18599 df-frmd 18656 df-grp 18748 df-minusg 18749 df-efg 19487 df-frgp 19488 df-vrgp 19489 |
This theorem is referenced by: frgpup3 19556 |
Copyright terms: Public domain | W3C validator |