ghmquskerco - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ghmquskerco		Structured version Visualization version GIF version

Theorem ghmquskerco 32518

Description: In the case of theorem ghmqusker 32521, the composition of the natural homomorphism 𝐿 with the constructed homomorphism 𝐽 equals the original homomorphism 𝐹. One says that 𝐹 factors through 𝑄. (Proposed by Saveliy Skresanov, 15-Feb-2025.) (Contributed by Thierry Arnoux, 15-Feb-2025.)

**Hypotheses**
Ref	Expression
ghmqusker.1	⊢ 0 = (0_g‘𝐻)
ghmqusker.f	⊢ (𝜑 → 𝐹 ∈ (𝐺 GrpHom 𝐻))
ghmqusker.k	⊢ 𝐾 = (^◡𝐹 “ { 0 })
ghmqusker.q	⊢ 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝐾))
ghmqusker.j	⊢ 𝐽 = (𝑞 ∈ (Base‘𝑄) ↦ ∪ (𝐹 “ 𝑞))
ghmquskerco.b	⊢ 𝐵 = (Base‘𝐺)
ghmquskerco.l	⊢ 𝐿 = (𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝐾))

**Assertion**
Ref	Expression
ghmquskerco	⊢ (𝜑 → 𝐹 = (𝐽 ∘ 𝐿))

Distinct variable groups: 𝑥, 0 𝐵,𝑞,𝑥 𝐹,𝑞,𝑥 𝐺,𝑞,𝑥 𝐻,𝑞,𝑥 𝐽,𝑞,𝑥 𝐾,𝑞,𝑥 𝑥,𝐿 𝑄,𝑞,𝑥 𝜑,𝑞,𝑥 Allowed substitution hints: 𝐿(𝑞) 0 (𝑞)

**Proof of Theorem ghmquskerco**
Step	Hyp	Ref	Expression
1		ghmqusker.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐺 GrpHom 𝐻))
2		ghmquskerco.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
3		eqid 2733	. . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻)
4	2, 3	ghmf 19091	. . . 4 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐹:𝐵⟶(Base‘𝐻))
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → 𝐹:𝐵⟶(Base‘𝐻))
6	5	ffnd 6716	. 2 ⊢ (𝜑 → 𝐹 Fn 𝐵)
7	1	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
8	7	imaexd 31892	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)) ∈ V)
9	8	uniexd 7729	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)) ∈ V)
10	9	ralrimiva 3147	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)) ∈ V)
11		eqid 2733	. . . . 5 ⊢ (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))) = (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)))
12	11	fnmpt 6688	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)) ∈ V → (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))) Fn 𝐵)
13	10, 12	syl 17	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))) Fn 𝐵)
14		ovex 7439	. . . . . . . 8 ⊢ (𝐺 ~_QG 𝐾) ∈ V
15	14	ecelqsi 8764	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 → [𝑥](𝐺 ~_QG 𝐾) ∈ (𝐵 / (𝐺 ~_QG 𝐾)))
16	15	adantl 483	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → [𝑥](𝐺 ~_QG 𝐾) ∈ (𝐵 / (𝐺 ~_QG 𝐾)))
17		ghmqusker.q	. . . . . . . . 9 ⊢ 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝐾))
18	17	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝐾)))
19	2	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = (Base‘𝐺))
20		ovexd 7441	. . . . . . . 8 ⊢ (𝜑 → (𝐺 ~_QG 𝐾) ∈ V)
21		reldmghm 19086	. . . . . . . . . . 11 ⊢ Rel dom GrpHom
22	21	ovrcl 7447	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → (𝐺 ∈ V ∧ 𝐻 ∈ V))
23	22	simpld 496	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐺 ∈ V)
24	1, 23	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ V)
25	18, 19, 20, 24	qusbas 17488	. . . . . . 7 ⊢ (𝜑 → (𝐵 / (𝐺 ~_QG 𝐾)) = (Base‘𝑄))
26	25	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐵 / (𝐺 ~_QG 𝐾)) = (Base‘𝑄))
27	16, 26	eleqtrd 2836	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → [𝑥](𝐺 ~_QG 𝐾) ∈ (Base‘𝑄))
28		ghmquskerco.l	. . . . . 6 ⊢ 𝐿 = (𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝐾))
29	28	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐿 = (𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝐾)))
30		ghmqusker.j	. . . . . 6 ⊢ 𝐽 = (𝑞 ∈ (Base‘𝑄) ↦ ∪ (𝐹 “ 𝑞))
31	30	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐽 = (𝑞 ∈ (Base‘𝑄) ↦ ∪ (𝐹 “ 𝑞)))
32		imaeq2 6054	. . . . . 6 ⊢ (𝑞 = [𝑥](𝐺 ~_QG 𝐾) → (𝐹 “ 𝑞) = (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)))
33	32	unieqd 4922	. . . . 5 ⊢ (𝑞 = [𝑥](𝐺 ~_QG 𝐾) → ∪ (𝐹 “ 𝑞) = ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)))
34	27, 29, 31, 33	fmptco 7124	. . . 4 ⊢ (𝜑 → (𝐽 ∘ 𝐿) = (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))))
35	34	fneq1d 6640	. . 3 ⊢ (𝜑 → ((𝐽 ∘ 𝐿) Fn 𝐵 ↔ (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))) Fn 𝐵))
36	13, 35	mpbird 257	. 2 ⊢ (𝜑 → (𝐽 ∘ 𝐿) Fn 𝐵)
37		ecexg 8704	. . . . . 6 ⊢ ((𝐺 ~_QG 𝐾) ∈ V → [𝑥](𝐺 ~_QG 𝐾) ∈ V)
38	14, 37	ax-mp 5	. . . . 5 ⊢ [𝑥](𝐺 ~_QG 𝐾) ∈ V
39	38, 28	fnmpti 6691	. . . 4 ⊢ 𝐿 Fn 𝐵
40		simpr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
41		fvco2 6986	. . . 4 ⊢ ((𝐿 Fn 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝐽 ∘ 𝐿)‘𝑥) = (𝐽‘(𝐿‘𝑥)))
42	39, 40, 41	sylancr 588	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((𝐽 ∘ 𝐿)‘𝑥) = (𝐽‘(𝐿‘𝑥)))
43	38	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → [𝑥](𝐺 ~_QG 𝐾) ∈ V)
44	29, 43	fvmpt2d 7009	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐿‘𝑥) = [𝑥](𝐺 ~_QG 𝐾))
45	44	fveq2d 6893	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐽‘(𝐿‘𝑥)) = (𝐽‘[𝑥](𝐺 ~_QG 𝐾)))
46		ghmqusker.1	. . . 4 ⊢ 0 = (0_g‘𝐻)
47		ghmqusker.k	. . . 4 ⊢ 𝐾 = (^◡𝐹 “ { 0 })
48	40, 2	eleqtrdi 2844	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (Base‘𝐺))
49	46, 7, 47, 17, 30, 48	ghmquskerlem1 32517	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐽‘[𝑥](𝐺 ~_QG 𝐾)) = (𝐹‘𝑥))
50	42, 45, 49	3eqtrrd 2778	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = ((𝐽 ∘ 𝐿)‘𝑥))
51	6, 36, 50	eqfnfvd 7033	1 ⊢ (𝜑 → 𝐹 = (𝐽 ∘ 𝐿))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 Vcvv 3475 {csn 4628 ∪ cuni 4908 ↦ cmpt 5231 ^◡ccnv 5675 “ cima 5679 ∘ ccom 5680 Fn wfn 6536 ⟶wf 6537 ‘cfv 6541 (class class class)co 7406 [cec 8698 / cqs 8699 Basecbs 17141 0_gc0g 17382 /_s cqus 17448 ~_QG cqg 18997 GrpHom cghm 19084

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-er 8700 df-ec 8702 df-qs 8706 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-sup 9434 df-inf 9435 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-5 12275 df-6 12276 df-7 12277 df-8 12278 df-9 12279 df-n0 12470 df-z 12556 df-dec 12675 df-uz 12820 df-fz 13482 df-struct 17077 df-sets 17094 df-slot 17112 df-ndx 17124 df-base 17142 df-ress 17171 df-plusg 17207 df-mulr 17208 df-sca 17210 df-vsca 17211 df-ip 17212 df-tset 17213 df-ple 17214 df-ds 17216 df-0g 17384 df-imas 17451 df-qus 17452 df-mgm 18558 df-sgrp 18607 df-mnd 18623 df-submnd 18669 df-grp 18819 df-minusg 18820 df-sbg 18821 df-subg 18998 df-nsg 18999 df-eqg 19000 df-ghm 19085

This theorem is referenced by: algextdeglem1 32761

W3C validator