![]() |
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 19800 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
6 | 1, 2, 5 | syl2anc 584 | . . 3 ⊢ (𝜑 → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
7 | 6 | fveq2d 6911 | . 2 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ )) |
8 | 0ex 5313 | . . . . . . . 8 ⊢ ∅ ∈ V | |
9 | 8 | prid1 4767 | . . . . . . 7 ⊢ ∅ ∈ {∅, 1o} |
10 | df2o3 8513 | . . . . . . 7 ⊢ 2o = {∅, 1o} | |
11 | 9, 10 | eleqtrri 2838 | . . . . . 6 ⊢ ∅ ∈ 2o |
12 | opelxpi 5726 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) | |
13 | 2, 11, 12 | sylancl 586 | . . . . 5 ⊢ (𝜑 → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) |
14 | 13 | s1cld 14638 | . . . 4 ⊢ (𝜑 → 〈“〈𝐴, ∅〉”〉 ∈ Word (𝐼 × 2o)) |
15 | frgpup.w | . . . . 5 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
16 | 2on 8519 | . . . . . . 7 ⊢ 2o ∈ On | |
17 | xpexg 7769 | . . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
18 | 1, 16, 17 | sylancl 586 | . . . . . 6 ⊢ (𝜑 → (𝐼 × 2o) ∈ V) |
19 | wrdexg 14559 | . . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V) | |
20 | fvi 6985 | . . . . . 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 2787 | . . . 4 ⊢ (𝜑 → 𝑊 = Word (𝐼 × 2o)) |
23 | 14, 22 | eleqtrrd 2842 | . . 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 19807 | . . 3 ⊢ ((𝜑 ∧ 〈“〈𝐴, ∅〉”〉 ∈ 𝑊) → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
33 | 23, 32 | mpdan 687 | . 2 ⊢ (𝜑 → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
34 | 24, 25, 26, 27, 1, 28 | frgpuptf 19803 | . . . . . 6 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
35 | s1co 14869 | . . . . . 6 ⊢ ((〈𝐴, ∅〉 ∈ (𝐼 × 2o) ∧ 𝑇:(𝐼 × 2o)⟶𝐵) → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) | |
36 | 13, 34, 35 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) |
37 | df-ov 7434 | . . . . . . 7 ⊢ (𝐴𝑇∅) = (𝑇‘〈𝐴, ∅〉) | |
38 | iftrue 4537 | . . . . . . . . . 10 ⊢ (𝑧 = ∅ → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝑦)) | |
39 | fveq2 6907 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝐹‘𝑦) = (𝐹‘𝐴)) | |
40 | 38, 39 | sylan9eqr 2797 | . . . . . . . . 9 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = ∅) → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝐴)) |
41 | fvex 6920 | . . . . . . . . 9 ⊢ (𝐹‘𝐴) ∈ V | |
42 | 40, 26, 41 | ovmpoa 7588 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → (𝐴𝑇∅) = (𝐹‘𝐴)) |
43 | 2, 11, 42 | sylancl 586 | . . . . . . 7 ⊢ (𝜑 → (𝐴𝑇∅) = (𝐹‘𝐴)) |
44 | 37, 43 | eqtr3id 2789 | . . . . . 6 ⊢ (𝜑 → (𝑇‘〈𝐴, ∅〉) = (𝐹‘𝐴)) |
45 | 44 | s1eqd 14636 | . . . . 5 ⊢ (𝜑 → 〈“(𝑇‘〈𝐴, ∅〉)”〉 = 〈“(𝐹‘𝐴)”〉) |
46 | 36, 45 | eqtrd 2775 | . . . 4 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝐹‘𝐴)”〉) |
47 | 46 | oveq2d 7447 | . . 3 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐻 Σg 〈“(𝐹‘𝐴)”〉)) |
48 | 28, 2 | ffvelcdmd 7105 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝐵) |
49 | 24 | gsumws1 18864 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
50 | 48, 49 | syl 17 | . . 3 ⊢ (𝜑 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
51 | 47, 50 | eqtrd 2775 | . 2 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐹‘𝐴)) |
52 | 7, 33, 51 | 3eqtrd 2779 | 1 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐹‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ∅c0 4339 ifcif 4531 {cpr 4633 〈cop 4637 ↦ cmpt 5231 I cid 5582 × cxp 5687 ran crn 5690 ∘ ccom 5693 Oncon0 6386 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 ∈ cmpo 7433 1oc1o 8498 2oc2o 8499 [cec 8742 Word cword 14549 〈“cs1 14630 Basecbs 17245 Σg cgsu 17487 Grpcgrp 18964 invgcminusg 18965 ~FG cefg 19739 freeGrpcfrgp 19740 varFGrpcvrgp 19741 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-ot 4640 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-2o 8506 df-er 8744 df-ec 8746 df-qs 8750 df-map 8867 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9480 df-inf 9481 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-z 12612 df-dec 12732 df-uz 12877 df-fz 13545 df-fzo 13692 df-seq 14040 df-hash 14367 df-word 14550 df-concat 14606 df-s1 14631 df-substr 14676 df-pfx 14706 df-splice 14785 df-s2 14884 df-struct 17181 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-ress 17275 df-plusg 17311 df-mulr 17312 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-0g 17488 df-gsum 17489 df-imas 17555 df-qus 17556 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-submnd 18810 df-frmd 18875 df-grp 18967 df-minusg 18968 df-efg 19742 df-frgp 19743 df-vrgp 19744 |
This theorem is referenced by: frgpup3 19811 |
Copyright terms: Public domain | W3C validator |