MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  frgpup1 Structured version   Visualization version   GIF version

Theorem frgpup1 18234
Description: Any assignment of the generators to target elements can be extended (uniquely) to a homomorphism from a free monoid to an arbitrary other monoid. (Contributed by Mario Carneiro, 2-Oct-2015.) (Revised by Mario Carneiro, 28-Feb-2016.)
Hypotheses
Ref Expression
frgpup.b 𝐵 = (Base‘𝐻)
frgpup.n 𝑁 = (invg𝐻)
frgpup.t 𝑇 = (𝑦𝐼, 𝑧 ∈ 2𝑜 ↦ if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))))
frgpup.h (𝜑𝐻 ∈ Grp)
frgpup.i (𝜑𝐼𝑉)
frgpup.a (𝜑𝐹:𝐼𝐵)
frgpup.w 𝑊 = ( I ‘Word (𝐼 × 2𝑜))
frgpup.r = ( ~FG𝐼)
frgpup.g 𝐺 = (freeGrp‘𝐼)
frgpup.x 𝑋 = (Base‘𝐺)
frgpup.e 𝐸 = ran (𝑔𝑊 ↦ ⟨[𝑔] , (𝐻 Σg (𝑇𝑔))⟩)
Assertion
Ref Expression
frgpup1 (𝜑𝐸 ∈ (𝐺 GrpHom 𝐻))
Distinct variable groups:   𝑦,𝑔,𝑧   𝑔,𝐻   𝑦,𝐹,𝑧   𝑦,𝑁,𝑧   𝐵,𝑔,𝑦,𝑧   𝑇,𝑔   ,𝑔   𝜑,𝑔,𝑦,𝑧   𝑦,𝐼,𝑧   𝑔,𝑊
Allowed substitution hints:   (𝑦,𝑧)   𝑇(𝑦,𝑧)   𝐸(𝑦,𝑧,𝑔)   𝐹(𝑔)   𝐺(𝑦,𝑧,𝑔)   𝐻(𝑦,𝑧)   𝐼(𝑔)   𝑁(𝑔)   𝑉(𝑦,𝑧,𝑔)   𝑊(𝑦,𝑧)   𝑋(𝑦,𝑧,𝑔)

Proof of Theorem frgpup1
Dummy variables 𝑎 𝑢 𝑐 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frgpup.x . 2 𝑋 = (Base‘𝐺)
2 frgpup.b . 2 𝐵 = (Base‘𝐻)
3 eqid 2651 . 2 (+g𝐺) = (+g𝐺)
4 eqid 2651 . 2 (+g𝐻) = (+g𝐻)
5 frgpup.i . . 3 (𝜑𝐼𝑉)
6 frgpup.g . . . 4 𝐺 = (freeGrp‘𝐼)
76frgpgrp 18221 . . 3 (𝐼𝑉𝐺 ∈ Grp)
85, 7syl 17 . 2 (𝜑𝐺 ∈ Grp)
9 frgpup.h . 2 (𝜑𝐻 ∈ Grp)
10 frgpup.n . . 3 𝑁 = (invg𝐻)
11 frgpup.t . . 3 𝑇 = (𝑦𝐼, 𝑧 ∈ 2𝑜 ↦ if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))))
12 frgpup.a . . 3 (𝜑𝐹:𝐼𝐵)
13 frgpup.w . . 3 𝑊 = ( I ‘Word (𝐼 × 2𝑜))
14 frgpup.r . . 3 = ( ~FG𝐼)
15 frgpup.e . . 3 𝐸 = ran (𝑔𝑊 ↦ ⟨[𝑔] , (𝐻 Σg (𝑇𝑔))⟩)
162, 10, 11, 9, 5, 12, 13, 14, 6, 1, 15frgpupf 18232 . 2 (𝜑𝐸:𝑋𝐵)
17 eqid 2651 . . . . . . . . . . 11 (freeMnd‘(𝐼 × 2𝑜)) = (freeMnd‘(𝐼 × 2𝑜))
186, 17, 14frgpval 18217 . . . . . . . . . 10 (𝐼𝑉𝐺 = ((freeMnd‘(𝐼 × 2𝑜)) /s ))
195, 18syl 17 . . . . . . . . 9 (𝜑𝐺 = ((freeMnd‘(𝐼 × 2𝑜)) /s ))
20 2on 7613 . . . . . . . . . . . . 13 2𝑜 ∈ On
21 xpexg 7002 . . . . . . . . . . . . 13 ((𝐼𝑉 ∧ 2𝑜 ∈ On) → (𝐼 × 2𝑜) ∈ V)
225, 20, 21sylancl 695 . . . . . . . . . . . 12 (𝜑 → (𝐼 × 2𝑜) ∈ V)
23 wrdexg 13347 . . . . . . . . . . . 12 ((𝐼 × 2𝑜) ∈ V → Word (𝐼 × 2𝑜) ∈ V)
24 fvi 6294 . . . . . . . . . . . 12 (Word (𝐼 × 2𝑜) ∈ V → ( I ‘Word (𝐼 × 2𝑜)) = Word (𝐼 × 2𝑜))
2522, 23, 243syl 18 . . . . . . . . . . 11 (𝜑 → ( I ‘Word (𝐼 × 2𝑜)) = Word (𝐼 × 2𝑜))
2613, 25syl5eq 2697 . . . . . . . . . 10 (𝜑𝑊 = Word (𝐼 × 2𝑜))
27 eqid 2651 . . . . . . . . . . . 12 (Base‘(freeMnd‘(𝐼 × 2𝑜))) = (Base‘(freeMnd‘(𝐼 × 2𝑜)))
2817, 27frmdbas 17436 . . . . . . . . . . 11 ((𝐼 × 2𝑜) ∈ V → (Base‘(freeMnd‘(𝐼 × 2𝑜))) = Word (𝐼 × 2𝑜))
2922, 28syl 17 . . . . . . . . . 10 (𝜑 → (Base‘(freeMnd‘(𝐼 × 2𝑜))) = Word (𝐼 × 2𝑜))
3026, 29eqtr4d 2688 . . . . . . . . 9 (𝜑𝑊 = (Base‘(freeMnd‘(𝐼 × 2𝑜))))
31 fvex 6239 . . . . . . . . . . 11 ( ~FG𝐼) ∈ V
3214, 31eqeltri 2726 . . . . . . . . . 10 ∈ V
3332a1i 11 . . . . . . . . 9 (𝜑 ∈ V)
34 fvexd 6241 . . . . . . . . 9 (𝜑 → (freeMnd‘(𝐼 × 2𝑜)) ∈ V)
3519, 30, 33, 34qusbas 16252 . . . . . . . 8 (𝜑 → (𝑊 / ) = (Base‘𝐺))
3635, 1syl6reqr 2704 . . . . . . 7 (𝜑𝑋 = (𝑊 / ))
37 eqimss 3690 . . . . . . 7 (𝑋 = (𝑊 / ) → 𝑋 ⊆ (𝑊 / ))
3836, 37syl 17 . . . . . 6 (𝜑𝑋 ⊆ (𝑊 / ))
3938adantr 480 . . . . 5 ((𝜑𝑎𝑋) → 𝑋 ⊆ (𝑊 / ))
4039sselda 3636 . . . 4 (((𝜑𝑎𝑋) ∧ 𝑐𝑋) → 𝑐 ∈ (𝑊 / ))
41 eqid 2651 . . . . 5 (𝑊 / ) = (𝑊 / )
42 oveq2 6698 . . . . . . 7 ([𝑢] = 𝑐 → (𝑎(+g𝐺)[𝑢] ) = (𝑎(+g𝐺)𝑐))
4342fveq2d 6233 . . . . . 6 ([𝑢] = 𝑐 → (𝐸‘(𝑎(+g𝐺)[𝑢] )) = (𝐸‘(𝑎(+g𝐺)𝑐)))
44 fveq2 6229 . . . . . . 7 ([𝑢] = 𝑐 → (𝐸‘[𝑢] ) = (𝐸𝑐))
4544oveq2d 6706 . . . . . 6 ([𝑢] = 𝑐 → ((𝐸𝑎)(+g𝐻)(𝐸‘[𝑢] )) = ((𝐸𝑎)(+g𝐻)(𝐸𝑐)))
4643, 45eqeq12d 2666 . . . . 5 ([𝑢] = 𝑐 → ((𝐸‘(𝑎(+g𝐺)[𝑢] )) = ((𝐸𝑎)(+g𝐻)(𝐸‘[𝑢] )) ↔ (𝐸‘(𝑎(+g𝐺)𝑐)) = ((𝐸𝑎)(+g𝐻)(𝐸𝑐))))
4738sselda 3636 . . . . . . . 8 ((𝜑𝑎𝑋) → 𝑎 ∈ (𝑊 / ))
4847adantlr 751 . . . . . . 7 (((𝜑𝑢𝑊) ∧ 𝑎𝑋) → 𝑎 ∈ (𝑊 / ))
49 oveq1 6697 . . . . . . . . . 10 ([𝑡] = 𝑎 → ([𝑡] (+g𝐺)[𝑢] ) = (𝑎(+g𝐺)[𝑢] ))
5049fveq2d 6233 . . . . . . . . 9 ([𝑡] = 𝑎 → (𝐸‘([𝑡] (+g𝐺)[𝑢] )) = (𝐸‘(𝑎(+g𝐺)[𝑢] )))
51 fveq2 6229 . . . . . . . . . 10 ([𝑡] = 𝑎 → (𝐸‘[𝑡] ) = (𝐸𝑎))
5251oveq1d 6705 . . . . . . . . 9 ([𝑡] = 𝑎 → ((𝐸‘[𝑡] )(+g𝐻)(𝐸‘[𝑢] )) = ((𝐸𝑎)(+g𝐻)(𝐸‘[𝑢] )))
5350, 52eqeq12d 2666 . . . . . . . 8 ([𝑡] = 𝑎 → ((𝐸‘([𝑡] (+g𝐺)[𝑢] )) = ((𝐸‘[𝑡] )(+g𝐻)(𝐸‘[𝑢] )) ↔ (𝐸‘(𝑎(+g𝐺)[𝑢] )) = ((𝐸𝑎)(+g𝐻)(𝐸‘[𝑢] ))))
54 fviss 6295 . . . . . . . . . . . . . . . 16 ( I ‘Word (𝐼 × 2𝑜)) ⊆ Word (𝐼 × 2𝑜)
5513, 54eqsstri 3668 . . . . . . . . . . . . . . 15 𝑊 ⊆ Word (𝐼 × 2𝑜)
5655sseli 3632 . . . . . . . . . . . . . 14 (𝑡𝑊𝑡 ∈ Word (𝐼 × 2𝑜))
5755sseli 3632 . . . . . . . . . . . . . 14 (𝑢𝑊𝑢 ∈ Word (𝐼 × 2𝑜))
58 ccatcl 13392 . . . . . . . . . . . . . 14 ((𝑡 ∈ Word (𝐼 × 2𝑜) ∧ 𝑢 ∈ Word (𝐼 × 2𝑜)) → (𝑡 ++ 𝑢) ∈ Word (𝐼 × 2𝑜))
5956, 57, 58syl2an 493 . . . . . . . . . . . . 13 ((𝑡𝑊𝑢𝑊) → (𝑡 ++ 𝑢) ∈ Word (𝐼 × 2𝑜))
6013efgrcl 18174 . . . . . . . . . . . . . . 15 (𝑡𝑊 → (𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2𝑜)))
6160adantr 480 . . . . . . . . . . . . . 14 ((𝑡𝑊𝑢𝑊) → (𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2𝑜)))
6261simprd 478 . . . . . . . . . . . . 13 ((𝑡𝑊𝑢𝑊) → 𝑊 = Word (𝐼 × 2𝑜))
6359, 62eleqtrrd 2733 . . . . . . . . . . . 12 ((𝑡𝑊𝑢𝑊) → (𝑡 ++ 𝑢) ∈ 𝑊)
642, 10, 11, 9, 5, 12, 13, 14, 6, 1, 15frgpupval 18233 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑡 ++ 𝑢) ∈ 𝑊) → (𝐸‘[(𝑡 ++ 𝑢)] ) = (𝐻 Σg (𝑇 ∘ (𝑡 ++ 𝑢))))
6563, 64sylan2 490 . . . . . . . . . . 11 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝐸‘[(𝑡 ++ 𝑢)] ) = (𝐻 Σg (𝑇 ∘ (𝑡 ++ 𝑢))))
6656ad2antrl 764 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → 𝑡 ∈ Word (𝐼 × 2𝑜))
6757ad2antll 765 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → 𝑢 ∈ Word (𝐼 × 2𝑜))
682, 10, 11, 9, 5, 12frgpuptf 18229 . . . . . . . . . . . . . 14 (𝜑𝑇:(𝐼 × 2𝑜)⟶𝐵)
6968adantr 480 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → 𝑇:(𝐼 × 2𝑜)⟶𝐵)
70 ccatco 13627 . . . . . . . . . . . . 13 ((𝑡 ∈ Word (𝐼 × 2𝑜) ∧ 𝑢 ∈ Word (𝐼 × 2𝑜) ∧ 𝑇:(𝐼 × 2𝑜)⟶𝐵) → (𝑇 ∘ (𝑡 ++ 𝑢)) = ((𝑇𝑡) ++ (𝑇𝑢)))
7166, 67, 69, 70syl3anc 1366 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝑇 ∘ (𝑡 ++ 𝑢)) = ((𝑇𝑡) ++ (𝑇𝑢)))
7271oveq2d 6706 . . . . . . . . . . 11 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝐻 Σg (𝑇 ∘ (𝑡 ++ 𝑢))) = (𝐻 Σg ((𝑇𝑡) ++ (𝑇𝑢))))
73 grpmnd 17476 . . . . . . . . . . . . . 14 (𝐻 ∈ Grp → 𝐻 ∈ Mnd)
749, 73syl 17 . . . . . . . . . . . . 13 (𝜑𝐻 ∈ Mnd)
7574adantr 480 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → 𝐻 ∈ Mnd)
76 wrdco 13623 . . . . . . . . . . . . . 14 ((𝑡 ∈ Word (𝐼 × 2𝑜) ∧ 𝑇:(𝐼 × 2𝑜)⟶𝐵) → (𝑇𝑡) ∈ Word 𝐵)
7756, 68, 76syl2anr 494 . . . . . . . . . . . . 13 ((𝜑𝑡𝑊) → (𝑇𝑡) ∈ Word 𝐵)
7877adantrr 753 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝑇𝑡) ∈ Word 𝐵)
79 wrdco 13623 . . . . . . . . . . . . 13 ((𝑢 ∈ Word (𝐼 × 2𝑜) ∧ 𝑇:(𝐼 × 2𝑜)⟶𝐵) → (𝑇𝑢) ∈ Word 𝐵)
8067, 69, 79syl2anc 694 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝑇𝑢) ∈ Word 𝐵)
812, 4gsumccat 17425 . . . . . . . . . . . 12 ((𝐻 ∈ Mnd ∧ (𝑇𝑡) ∈ Word 𝐵 ∧ (𝑇𝑢) ∈ Word 𝐵) → (𝐻 Σg ((𝑇𝑡) ++ (𝑇𝑢))) = ((𝐻 Σg (𝑇𝑡))(+g𝐻)(𝐻 Σg (𝑇𝑢))))
8275, 78, 80, 81syl3anc 1366 . . . . . . . . . . 11 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝐻 Σg ((𝑇𝑡) ++ (𝑇𝑢))) = ((𝐻 Σg (𝑇𝑡))(+g𝐻)(𝐻 Σg (𝑇𝑢))))
8365, 72, 823eqtrd 2689 . . . . . . . . . 10 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝐸‘[(𝑡 ++ 𝑢)] ) = ((𝐻 Σg (𝑇𝑡))(+g𝐻)(𝐻 Σg (𝑇𝑢))))
8413, 6, 14, 3frgpadd 18222 . . . . . . . . . . . 12 ((𝑡𝑊𝑢𝑊) → ([𝑡] (+g𝐺)[𝑢] ) = [(𝑡 ++ 𝑢)] )
8584adantl 481 . . . . . . . . . . 11 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → ([𝑡] (+g𝐺)[𝑢] ) = [(𝑡 ++ 𝑢)] )
8685fveq2d 6233 . . . . . . . . . 10 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝐸‘([𝑡] (+g𝐺)[𝑢] )) = (𝐸‘[(𝑡 ++ 𝑢)] ))
872, 10, 11, 9, 5, 12, 13, 14, 6, 1, 15frgpupval 18233 . . . . . . . . . . . 12 ((𝜑𝑡𝑊) → (𝐸‘[𝑡] ) = (𝐻 Σg (𝑇𝑡)))
8887adantrr 753 . . . . . . . . . . 11 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝐸‘[𝑡] ) = (𝐻 Σg (𝑇𝑡)))
892, 10, 11, 9, 5, 12, 13, 14, 6, 1, 15frgpupval 18233 . . . . . . . . . . . 12 ((𝜑𝑢𝑊) → (𝐸‘[𝑢] ) = (𝐻 Σg (𝑇𝑢)))
9089adantrl 752 . . . . . . . . . . 11 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝐸‘[𝑢] ) = (𝐻 Σg (𝑇𝑢)))
9188, 90oveq12d 6708 . . . . . . . . . 10 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → ((𝐸‘[𝑡] )(+g𝐻)(𝐸‘[𝑢] )) = ((𝐻 Σg (𝑇𝑡))(+g𝐻)(𝐻 Σg (𝑇𝑢))))
9283, 86, 913eqtr4d 2695 . . . . . . . . 9 ((𝜑 ∧ (𝑡𝑊𝑢𝑊)) → (𝐸‘([𝑡] (+g𝐺)[𝑢] )) = ((𝐸‘[𝑡] )(+g𝐻)(𝐸‘[𝑢] )))
9392anass1rs 866 . . . . . . . 8 (((𝜑𝑢𝑊) ∧ 𝑡𝑊) → (𝐸‘([𝑡] (+g𝐺)[𝑢] )) = ((𝐸‘[𝑡] )(+g𝐻)(𝐸‘[𝑢] )))
9441, 53, 93ectocld 7857 . . . . . . 7 (((𝜑𝑢𝑊) ∧ 𝑎 ∈ (𝑊 / )) → (𝐸‘(𝑎(+g𝐺)[𝑢] )) = ((𝐸𝑎)(+g𝐻)(𝐸‘[𝑢] )))
9548, 94syldan 486 . . . . . 6 (((𝜑𝑢𝑊) ∧ 𝑎𝑋) → (𝐸‘(𝑎(+g𝐺)[𝑢] )) = ((𝐸𝑎)(+g𝐻)(𝐸‘[𝑢] )))
9695an32s 863 . . . . 5 (((𝜑𝑎𝑋) ∧ 𝑢𝑊) → (𝐸‘(𝑎(+g𝐺)[𝑢] )) = ((𝐸𝑎)(+g𝐻)(𝐸‘[𝑢] )))
9741, 46, 96ectocld 7857 . . . 4 (((𝜑𝑎𝑋) ∧ 𝑐 ∈ (𝑊 / )) → (𝐸‘(𝑎(+g𝐺)𝑐)) = ((𝐸𝑎)(+g𝐻)(𝐸𝑐)))
9840, 97syldan 486 . . 3 (((𝜑𝑎𝑋) ∧ 𝑐𝑋) → (𝐸‘(𝑎(+g𝐺)𝑐)) = ((𝐸𝑎)(+g𝐻)(𝐸𝑐)))
9998anasss 680 . 2 ((𝜑 ∧ (𝑎𝑋𝑐𝑋)) → (𝐸‘(𝑎(+g𝐺)𝑐)) = ((𝐸𝑎)(+g𝐻)(𝐸𝑐)))
1001, 2, 3, 4, 8, 9, 16, 99isghmd 17716 1 (𝜑𝐸 ∈ (𝐺 GrpHom 𝐻))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1523  wcel 2030  Vcvv 3231  wss 3607  c0 3948  ifcif 4119  cop 4216  cmpt 4762   I cid 5052   × cxp 5141  ran crn 5144  ccom 5147  Oncon0 5761  wf 5922  cfv 5926  (class class class)co 6690  cmpt2 6692  2𝑜c2o 7599  [cec 7785   / cqs 7786  Word cword 13323   ++ cconcat 13325  Basecbs 15904  +gcplusg 15988   Σg cgsu 16148   /s cqus 16212  Mndcmnd 17341  freeMndcfrmd 17431  Grpcgrp 17469  invgcminusg 17470   GrpHom cghm 17704   ~FG cefg 18165  freeGrpcfrgp 18166
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-ot 4219  df-uni 4469  df-int 4508  df-iun 4554  df-iin 4555  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-2o 7606  df-oadd 7609  df-er 7787  df-ec 7789  df-qs 7793  df-map 7901  df-pm 7902  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-sup 8389  df-inf 8390  df-card 8803  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-nn 11059  df-2 11117  df-3 11118  df-4 11119  df-5 11120  df-6 11121  df-7 11122  df-8 11123  df-9 11124  df-n0 11331  df-xnn0 11402  df-z 11416  df-dec 11532  df-uz 11726  df-fz 12365  df-fzo 12505  df-seq 12842  df-hash 13158  df-word 13331  df-lsw 13332  df-concat 13333  df-s1 13334  df-substr 13335  df-splice 13336  df-reverse 13337  df-s2 13639  df-struct 15906  df-ndx 15907  df-slot 15908  df-base 15910  df-sets 15911  df-ress 15912  df-plusg 16001  df-mulr 16002  df-sca 16004  df-vsca 16005  df-ip 16006  df-tset 16007  df-ple 16008  df-ds 16011  df-0g 16149  df-gsum 16150  df-imas 16215  df-qus 16216  df-mgm 17289  df-sgrp 17331  df-mnd 17342  df-submnd 17383  df-frmd 17433  df-grp 17472  df-minusg 17473  df-ghm 17705  df-efg 18168  df-frgp 18169
This theorem is referenced by:  frgpup3lem  18236  frgpup3  18237
  Copyright terms: Public domain W3C validator