| 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 19700 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
| 6 | 1, 2, 5 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑈‘𝐴) = [〈“〈𝐴, ∅〉”〉] ∼ ) |
| 7 | 6 | fveq2d 6839 | . 2 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ )) |
| 8 | 0ex 5253 | . . . . . . . 8 ⊢ ∅ ∈ V | |
| 9 | 8 | prid1 4720 | . . . . . . 7 ⊢ ∅ ∈ {∅, 1o} |
| 10 | df2o3 8407 | . . . . . . 7 ⊢ 2o = {∅, 1o} | |
| 11 | 9, 10 | eleqtrri 2836 | . . . . . 6 ⊢ ∅ ∈ 2o |
| 12 | opelxpi 5662 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) | |
| 13 | 2, 11, 12 | sylancl 587 | . . . . 5 ⊢ (𝜑 → 〈𝐴, ∅〉 ∈ (𝐼 × 2o)) |
| 14 | 13 | s1cld 14531 | . . . 4 ⊢ (𝜑 → 〈“〈𝐴, ∅〉”〉 ∈ Word (𝐼 × 2o)) |
| 15 | frgpup.w | . . . . 5 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 16 | 2on 8412 | . . . . . . 7 ⊢ 2o ∈ On | |
| 17 | xpexg 7697 | . . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
| 18 | 1, 16, 17 | sylancl 587 | . . . . . 6 ⊢ (𝜑 → (𝐼 × 2o) ∈ V) |
| 19 | wrdexg 14451 | . . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V) | |
| 20 | fvi 6911 | . . . . . 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 2784 | . . . 4 ⊢ (𝜑 → 𝑊 = Word (𝐼 × 2o)) |
| 23 | 14, 22 | eleqtrrd 2840 | . . 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 19707 | . . 3 ⊢ ((𝜑 ∧ 〈“〈𝐴, ∅〉”〉 ∈ 𝑊) → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
| 33 | 23, 32 | mpdan 688 | . 2 ⊢ (𝜑 → (𝐸‘[〈“〈𝐴, ∅〉”〉] ∼ ) = (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉))) |
| 34 | 24, 25, 26, 27, 1, 28 | frgpuptf 19703 | . . . . . 6 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
| 35 | s1co 14760 | . . . . . 6 ⊢ ((〈𝐴, ∅〉 ∈ (𝐼 × 2o) ∧ 𝑇:(𝐼 × 2o)⟶𝐵) → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) | |
| 36 | 13, 34, 35 | syl2anc 585 | . . . . 5 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝑇‘〈𝐴, ∅〉)”〉) |
| 37 | df-ov 7363 | . . . . . . 7 ⊢ (𝐴𝑇∅) = (𝑇‘〈𝐴, ∅〉) | |
| 38 | iftrue 4486 | . . . . . . . . . 10 ⊢ (𝑧 = ∅ → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝑦)) | |
| 39 | fveq2 6835 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝐹‘𝑦) = (𝐹‘𝐴)) | |
| 40 | 38, 39 | sylan9eqr 2794 | . . . . . . . . 9 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = ∅) → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) = (𝐹‘𝐴)) |
| 41 | fvex 6848 | . . . . . . . . 9 ⊢ (𝐹‘𝐴) ∈ V | |
| 42 | 40, 26, 41 | ovmpoa 7515 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐼 ∧ ∅ ∈ 2o) → (𝐴𝑇∅) = (𝐹‘𝐴)) |
| 43 | 2, 11, 42 | sylancl 587 | . . . . . . 7 ⊢ (𝜑 → (𝐴𝑇∅) = (𝐹‘𝐴)) |
| 44 | 37, 43 | eqtr3id 2786 | . . . . . 6 ⊢ (𝜑 → (𝑇‘〈𝐴, ∅〉) = (𝐹‘𝐴)) |
| 45 | 44 | s1eqd 14529 | . . . . 5 ⊢ (𝜑 → 〈“(𝑇‘〈𝐴, ∅〉)”〉 = 〈“(𝐹‘𝐴)”〉) |
| 46 | 36, 45 | eqtrd 2772 | . . . 4 ⊢ (𝜑 → (𝑇 ∘ 〈“〈𝐴, ∅〉”〉) = 〈“(𝐹‘𝐴)”〉) |
| 47 | 46 | oveq2d 7376 | . . 3 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐻 Σg 〈“(𝐹‘𝐴)”〉)) |
| 48 | 28, 2 | ffvelcdmd 7032 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝐵) |
| 49 | 24 | gsumws1 18767 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
| 50 | 48, 49 | syl 17 | . . 3 ⊢ (𝜑 → (𝐻 Σg 〈“(𝐹‘𝐴)”〉) = (𝐹‘𝐴)) |
| 51 | 47, 50 | eqtrd 2772 | . 2 ⊢ (𝜑 → (𝐻 Σg (𝑇 ∘ 〈“〈𝐴, ∅〉”〉)) = (𝐹‘𝐴)) |
| 52 | 7, 33, 51 | 3eqtrd 2776 | 1 ⊢ (𝜑 → (𝐸‘(𝑈‘𝐴)) = (𝐹‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3441 ∅c0 4286 ifcif 4480 {cpr 4583 〈cop 4587 ↦ cmpt 5180 I cid 5519 × cxp 5623 ran crn 5626 ∘ ccom 5629 Oncon0 6318 ⟶wf 6489 ‘cfv 6493 (class class class)co 7360 ∈ cmpo 7362 1oc1o 8392 2oc2o 8393 [cec 8635 Word cword 14440 〈“cs1 14523 Basecbs 17140 Σg cgsu 17364 Grpcgrp 18867 invgcminusg 18868 ~FG cefg 19639 freeGrpcfrgp 19640 varFGrpcvrgp 19641 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-ot 4590 df-uni 4865 df-int 4904 df-iun 4949 df-iin 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-er 8637 df-ec 8639 df-qs 8643 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-inf 9350 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-3 12213 df-4 12214 df-5 12215 df-6 12216 df-7 12217 df-8 12218 df-9 12219 df-n0 12406 df-z 12493 df-dec 12612 df-uz 12756 df-fz 13428 df-fzo 13575 df-seq 13929 df-hash 14258 df-word 14441 df-concat 14498 df-s1 14524 df-substr 14569 df-pfx 14599 df-splice 14677 df-s2 14775 df-struct 17078 df-sets 17095 df-slot 17113 df-ndx 17125 df-base 17141 df-ress 17162 df-plusg 17194 df-mulr 17195 df-sca 17197 df-vsca 17198 df-ip 17199 df-tset 17200 df-ple 17201 df-ds 17203 df-0g 17365 df-gsum 17366 df-imas 17433 df-qus 17434 df-mgm 18569 df-sgrp 18648 df-mnd 18664 df-submnd 18713 df-frmd 18778 df-grp 18870 df-minusg 18871 df-efg 19642 df-frgp 19643 df-vrgp 19644 |
| This theorem is referenced by: frgpup3 19711 |
| Copyright terms: Public domain | W3C validator |