![]() |
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 19809 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
6 | 1, 2, 5 | syl2anc 583 | . . 3 ⊢ (𝜑 → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
7 | 6 | fveq2d 6924 | . 2 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ )) |
8 | 0ex 5325 | . . . . . . . 8 ⊢ ∅ ∈ V | |
9 | 8 | prid1 4787 | . . . . . . 7 ⊢ ∅ ∈ {∅, 1o} |
10 | df2o3 8530 | . . . . . . 7 ⊢ 2o = {∅, 1o} | |
11 | 9, 10 | eleqtrri 2843 | . . . . . 6 ⊢ ∅ ∈ 2o |
12 | opelxpi 5737 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) | |
13 | 2, 11, 12 | sylancl 585 | . . . . 5 ⊢ (𝜑 → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) |
14 | 13 | s1cld 14651 | . . . 4 ⊢ (𝜑 → 〈“〈𝐴, ∅〉”〉 ∈ Word (𝐼 × 2o)) |
15 | frgpup.w | . . . . 5 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
16 | 2on 8536 | . . . . . . 7 ⊢ 2o ∈ On | |
17 | xpexg 7785 | . . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
18 | 1, 16, 17 | sylancl 585 | . . . . . 6 ⊢ (𝜑 → (𝐼 × 2o) ∈ V) |
19 | wrdexg 14572 | . . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V) | |
20 | fvi 6998 | . . . . . 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 2792 | . . . 4 ⊢ (𝜑 → 𝑊 = Word (𝐼 × 2o)) |
23 | 14, 22 | eleqtrrd 2847 | . . 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 19816 | . . 3 ⊢ ((𝜑 ∧ 〈“〈𝐴, ∅〉”〉 ∈ 𝑊) → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
33 | 23, 32 | mpdan 686 | . 2 ⊢ (𝜑 → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
34 | 24, 25, 26, 27, 1, 28 | frgpuptf 19812 | . . . . . 6 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
35 | s1co 14882 | . . . . . 6 ⊢ ((〈𝐴, ∅〉 ∈ (𝐼 × 2o) ∧ 𝑇:(𝐼 × 2o)⟶𝐵) → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) | |
36 | 13, 34, 35 | syl2anc 583 | . . . . 5 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) |
37 | df-ov 7451 | . . . . . . 7 ⊢ (𝐴𝑇∅) = (𝑇‘〈𝐴, ∅〉) | |
38 | iftrue 4554 | . . . . . . . . . 10 ⊢ (𝑧 = ∅ → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝑦)) | |
39 | fveq2 6920 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝐹‘𝑦) = (𝐹‘𝐴)) | |
40 | 38, 39 | sylan9eqr 2802 | . . . . . . . . 9 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = ∅) → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝐴)) |
41 | fvex 6933 | . . . . . . . . 9 ⊢ (𝐹‘𝐴) ∈ V | |
42 | 40, 26, 41 | ovmpoa 7605 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → (𝐴𝑇∅) = (𝐹‘𝐴)) |
43 | 2, 11, 42 | sylancl 585 | . . . . . . 7 ⊢ (𝜑 → (𝐴𝑇∅) = (𝐹‘𝐴)) |
44 | 37, 43 | eqtr3id 2794 | . . . . . 6 ⊢ (𝜑 → (𝑇‘〈𝐴, ∅〉) = (𝐹‘𝐴)) |
45 | 44 | s1eqd 14649 | . . . . 5 ⊢ (𝜑 → 〈“(𝑇‘〈𝐴, ∅〉)”〉 = 〈“(𝐹‘𝐴)”〉) |
46 | 36, 45 | eqtrd 2780 | . . . 4 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝐹‘𝐴)”〉) |
47 | 46 | oveq2d 7464 | . . 3 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐻 Σg 〈“(𝐹‘𝐴)”〉)) |
48 | 28, 2 | ffvelcdmd 7119 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝐵) |
49 | 24 | gsumws1 18873 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
50 | 48, 49 | syl 17 | . . 3 ⊢ (𝜑 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
51 | 47, 50 | eqtrd 2780 | . 2 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐹‘𝐴)) |
52 | 7, 33, 51 | 3eqtrd 2784 | 1 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐹‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ∅c0 4352 ifcif 4548 {cpr 4650 〈cop 4654 ↦ cmpt 5249 I cid 5592 × cxp 5698 ran crn 5701 ∘ ccom 5704 Oncon0 6395 ⟶wf 6569 ‘cfv 6573 (class class class)co 7448 ∈ cmpo 7450 1oc1o 8515 2oc2o 8516 [cec 8761 Word cword 14562 〈“cs1 14643 Basecbs 17258 Σg cgsu 17500 Grpcgrp 18973 invgcminusg 18974 ~FG cefg 19748 freeGrpcfrgp 19749 varFGrpcvrgp 19750 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-ot 4657 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-er 8763 df-ec 8765 df-qs 8769 df-map 8886 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-sup 9511 df-inf 9512 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-fz 13568 df-fzo 13712 df-seq 14053 df-hash 14380 df-word 14563 df-concat 14619 df-s1 14644 df-substr 14689 df-pfx 14719 df-splice 14798 df-s2 14897 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-0g 17501 df-gsum 17502 df-imas 17568 df-qus 17569 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-submnd 18819 df-frmd 18884 df-grp 18976 df-minusg 18977 df-efg 19751 df-frgp 19752 df-vrgp 19753 |
This theorem is referenced by: frgpup3 19820 |
Copyright terms: Public domain | W3C validator |