ghmquskerco - Metamath Proof Explorer

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

Theorem ghmquskerco 19314

Description: In the case of theorem ghmqusker 19317, 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 2734	. . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻)
4	2, 3	ghmf 19250	. . . 4 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐹:𝐵⟶(Base‘𝐻))
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → 𝐹:𝐵⟶(Base‘𝐻))
6	5	ffnd 6737	. 2 ⊢ (𝜑 → 𝐹 Fn 𝐵)
7	1	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
8	7	imaexd 7938	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)) ∈ V)
9	8	uniexd 7760	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)) ∈ V)
10	9	ralrimiva 3143	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)) ∈ V)
11		eqid 2734	. . . . 5 ⊢ (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))) = (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)))
12	11	fnmpt 6708	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)) ∈ V → (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))) Fn 𝐵)
13	10, 12	syl 17	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))) Fn 𝐵)
14		ovex 7463	. . . . . . . 8 ⊢ (𝐺 ~_QG 𝐾) ∈ V
15	14	ecelqsi 8811	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 → [𝑥](𝐺 ~_QG 𝐾) ∈ (𝐵 / (𝐺 ~_QG 𝐾)))
16	15	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → [𝑥](𝐺 ~_QG 𝐾) ∈ (𝐵 / (𝐺 ~_QG 𝐾)))
17		ghmqusker.q	. . . . . . . . 9 ⊢ 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝐾))
18	17	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝐾)))
19	2	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = (Base‘𝐺))
20		ovexd 7465	. . . . . . . 8 ⊢ (𝜑 → (𝐺 ~_QG 𝐾) ∈ V)
21		reldmghm 19244	. . . . . . . . . . 11 ⊢ Rel dom GrpHom
22	21	ovrcl 7471	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → (𝐺 ∈ V ∧ 𝐻 ∈ V))
23	22	simpld 494	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐺 ∈ V)
24	1, 23	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ V)
25	18, 19, 20, 24	qusbas 17591	. . . . . . 7 ⊢ (𝜑 → (𝐵 / (𝐺 ~_QG 𝐾)) = (Base‘𝑄))
26	25	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐵 / (𝐺 ~_QG 𝐾)) = (Base‘𝑄))
27	16, 26	eleqtrd 2840	. . . . 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 6075	. . . . . 6 ⊢ (𝑞 = [𝑥](𝐺 ~_QG 𝐾) → (𝐹 “ 𝑞) = (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)))
33	32	unieqd 4924	. . . . 5 ⊢ (𝑞 = [𝑥](𝐺 ~_QG 𝐾) → ∪ (𝐹 “ 𝑞) = ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾)))
34	27, 29, 31, 33	fmptco 7148	. . . 4 ⊢ (𝜑 → (𝐽 ∘ 𝐿) = (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))))
35	34	fneq1d 6661	. . 3 ⊢ (𝜑 → ((𝐽 ∘ 𝐿) Fn 𝐵 ↔ (𝑥 ∈ 𝐵 ↦ ∪ (𝐹 “ [𝑥](𝐺 ~_QG 𝐾))) Fn 𝐵))
36	13, 35	mpbird 257	. 2 ⊢ (𝜑 → (𝐽 ∘ 𝐿) Fn 𝐵)
37		ecexg 8747	. . . . . 6 ⊢ ((𝐺 ~_QG 𝐾) ∈ V → [𝑥](𝐺 ~_QG 𝐾) ∈ V)
38	14, 37	ax-mp 5	. . . . 5 ⊢ [𝑥](𝐺 ~_QG 𝐾) ∈ V
39	38, 28	fnmpti 6711	. . . 4 ⊢ 𝐿 Fn 𝐵
40		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
41		fvco2 7005	. . . 4 ⊢ ((𝐿 Fn 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝐽 ∘ 𝐿)‘𝑥) = (𝐽‘(𝐿‘𝑥)))
42	39, 40, 41	sylancr 587	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((𝐽 ∘ 𝐿)‘𝑥) = (𝐽‘(𝐿‘𝑥)))
43	38	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → [𝑥](𝐺 ~_QG 𝐾) ∈ V)
44	29, 43	fvmpt2d 7028	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐿‘𝑥) = [𝑥](𝐺 ~_QG 𝐾))
45	44	fveq2d 6910	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐽‘(𝐿‘𝑥)) = (𝐽‘[𝑥](𝐺 ~_QG 𝐾)))
46		ghmqusker.1	. . . 4 ⊢ 0 = (0_g‘𝐻)
47		ghmqusker.k	. . . 4 ⊢ 𝐾 = (^◡𝐹 “ { 0 })
48	40, 2	eleqtrdi 2848	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (Base‘𝐺))
49	46, 7, 47, 17, 30, 48	ghmquskerlem1 19313	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐽‘[𝑥](𝐺 ~_QG 𝐾)) = (𝐹‘𝑥))
50	42, 45, 49	3eqtrrd 2779	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = ((𝐽 ∘ 𝐿)‘𝑥))
51	6, 36, 50	eqfnfvd 7053	1 ⊢ (𝜑 → 𝐹 = (𝐽 ∘ 𝐿))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1536 ∈ wcel 2105 ∀wral 3058 Vcvv 3477 {csn 4630 ∪ cuni 4911 ↦ cmpt 5230 ^◡ccnv 5687 “ cima 5691 ∘ ccom 5692 Fn wfn 6557 ⟶wf 6558 ‘cfv 6562 (class class class)co 7430 [cec 8741 / cqs 8742 Basecbs 17244 0_gc0g 17485 /_s cqus 17551 ~_QG cqg 19152 GrpHom cghm 19242

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-tp 4635 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-1st 8012 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-1o 8504 df-er 8743 df-ec 8745 df-qs 8749 df-map 8866 df-en 8984 df-dom 8985 df-sdom 8986 df-fin 8987 df-sup 9479 df-inf 9480 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-nn 12264 df-2 12326 df-3 12327 df-4 12328 df-5 12329 df-6 12330 df-7 12331 df-8 12332 df-9 12333 df-n0 12524 df-z 12611 df-dec 12731 df-uz 12876 df-fz 13544 df-struct 17180 df-sets 17197 df-slot 17215 df-ndx 17227 df-base 17245 df-ress 17274 df-plusg 17310 df-mulr 17311 df-sca 17313 df-vsca 17314 df-ip 17315 df-tset 17316 df-ple 17317 df-ds 17319 df-0g 17487 df-imas 17554 df-qus 17555 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-submnd 18809 df-grp 18966 df-minusg 18967 df-sbg 18968 df-subg 19153 df-nsg 19154 df-eqg 19155 df-ghm 19243

This theorem is referenced by: algextdeglem4 33725 aks6d1c6lem5 42158

W3C validator