psgnghm - Metamath Proof Explorer

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

Theorem psgnghm 21125

Description: The sign is a homomorphism from the finitary permutation group to the numeric signs. (Contributed by Stefan O'Rear, 28-Aug-2015.)

**Hypotheses**
Ref	Expression
psgnghm.s	⊢ 𝑆 = (SymGrp‘𝐷)
psgnghm.n	⊢ 𝑁 = (pmSgn‘𝐷)
psgnghm.f	⊢ 𝐹 = (𝑆 ↾_s dom 𝑁)
psgnghm.u	⊢ 𝑈 = ((mulGrp‘ℂ_fld) ↾_s {1, -1})

**Assertion**
Ref	Expression
psgnghm	⊢ (𝐷 ∈ 𝑉 → 𝑁 ∈ (𝐹 GrpHom 𝑈))

Proof of Theorem psgnghm Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		psgnghm.s	. . . . . 6 ⊢ 𝑆 = (SymGrp‘𝐷)
2		eqid 2733	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
3		eqid 2733	. . . . . 6 ⊢ {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
4		psgnghm.n	. . . . . 6 ⊢ 𝑁 = (pmSgn‘𝐷)
5	1, 2, 3, 4	psgnfn 19364	. . . . 5 ⊢ 𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
6	5	fndmi 6651	. . . 4 ⊢ dom 𝑁 = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
7	6	ssrab3 4080	. . 3 ⊢ dom 𝑁 ⊆ (Base‘𝑆)
8		psgnghm.f	. . . 4 ⊢ 𝐹 = (𝑆 ↾_s dom 𝑁)
9	8, 2	ressbas2 17179	. . 3 ⊢ (dom 𝑁 ⊆ (Base‘𝑆) → dom 𝑁 = (Base‘𝐹))
10	7, 9	ax-mp 5	. 2 ⊢ dom 𝑁 = (Base‘𝐹)
11		psgnghm.u	. . 3 ⊢ 𝑈 = ((mulGrp‘ℂ_fld) ↾_s {1, -1})
12	11	cnmsgnbas 21123	. 2 ⊢ {1, -1} = (Base‘𝑈)
13	10	fvexi 6903	. . 3 ⊢ dom 𝑁 ∈ V
14		eqid 2733	. . . 4 ⊢ (+_g‘𝑆) = (+_g‘𝑆)
15	8, 14	ressplusg 17232	. . 3 ⊢ (dom 𝑁 ∈ V → (+_g‘𝑆) = (+_g‘𝐹))
16	13, 15	ax-mp 5	. 2 ⊢ (+_g‘𝑆) = (+_g‘𝐹)
17		prex 5432	. . 3 ⊢ {1, -1} ∈ V
18		eqid 2733	. . . . 5 ⊢ (mulGrp‘ℂ_fld) = (mulGrp‘ℂ_fld)
19		cnfldmul 20943	. . . . 5 ⊢ · = (._r‘ℂ_fld)
20	18, 19	mgpplusg 19986	. . . 4 ⊢ · = (+_g‘(mulGrp‘ℂ_fld))
21	11, 20	ressplusg 17232	. . 3 ⊢ ({1, -1} ∈ V → · = (+_g‘𝑈))
22	17, 21	ax-mp 5	. 2 ⊢ · = (+_g‘𝑈)
23	1, 4	psgndmsubg 19365	. . 3 ⊢ (𝐷 ∈ 𝑉 → dom 𝑁 ∈ (SubGrp‘𝑆))
24	8	subggrp 19004	. . 3 ⊢ (dom 𝑁 ∈ (SubGrp‘𝑆) → 𝐹 ∈ Grp)
25	23, 24	syl 17	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝐹 ∈ Grp)
26	11	cnmsgngrp 21124	. . 3 ⊢ 𝑈 ∈ Grp
27	26	a1i 11	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝑈 ∈ Grp)
28		fnfun 6647	. . . . . 6 ⊢ (𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} → Fun 𝑁)
29	5, 28	ax-mp 5	. . . . 5 ⊢ Fun 𝑁
30		funfn 6576	. . . . 5 ⊢ (Fun 𝑁 ↔ 𝑁 Fn dom 𝑁)
31	29, 30	mpbi 229	. . . 4 ⊢ 𝑁 Fn dom 𝑁
32	31	a1i 11	. . 3 ⊢ (𝐷 ∈ 𝑉 → 𝑁 Fn dom 𝑁)
33		eqid 2733	. . . . . 6 ⊢ ran (pmTrsp‘𝐷) = ran (pmTrsp‘𝐷)
34	1, 33, 4	psgnvali 19371	. . . . 5 ⊢ (𝑥 ∈ dom 𝑁 → ∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))))
35		lencl 14480	. . . . . . . . . 10 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℕ₀)
36	35	nn0zd 12581	. . . . . . . . 9 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℤ)
37		m1expcl2 14048	. . . . . . . . . 10 ⊢ ((♯‘𝑧) ∈ ℤ → (-1↑(♯‘𝑧)) ∈ {-1, 1})
38		prcom 4736	. . . . . . . . . 10 ⊢ {-1, 1} = {1, -1}
39	37, 38	eleqtrdi 2844	. . . . . . . . 9 ⊢ ((♯‘𝑧) ∈ ℤ → (-1↑(♯‘𝑧)) ∈ {1, -1})
40		eleq1a 2829	. . . . . . . . 9 ⊢ ((-1↑(♯‘𝑧)) ∈ {1, -1} → ((𝑁‘𝑥) = (-1↑(♯‘𝑧)) → (𝑁‘𝑥) ∈ {1, -1}))
41	36, 39, 40	3syl 18	. . . . . . . 8 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → ((𝑁‘𝑥) = (-1↑(♯‘𝑧)) → (𝑁‘𝑥) ∈ {1, -1}))
42	41	adantld 492	. . . . . . 7 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → ((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) → (𝑁‘𝑥) ∈ {1, -1}))
43	42	rexlimiv 3149	. . . . . 6 ⊢ (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) → (𝑁‘𝑥) ∈ {1, -1})
44	43	a1i 11	. . . . 5 ⊢ (𝐷 ∈ 𝑉 → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) → (𝑁‘𝑥) ∈ {1, -1}))
45	34, 44	syl5 34	. . . 4 ⊢ (𝐷 ∈ 𝑉 → (𝑥 ∈ dom 𝑁 → (𝑁‘𝑥) ∈ {1, -1}))
46	45	ralrimiv 3146	. . 3 ⊢ (𝐷 ∈ 𝑉 → ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1})
47		ffnfv 7115	. . 3 ⊢ (𝑁:dom 𝑁⟶{1, -1} ↔ (𝑁 Fn dom 𝑁 ∧ ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1}))
48	32, 46, 47	sylanbrc 584	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝑁:dom 𝑁⟶{1, -1})
49		ccatcl 14521	. . . . . . 7 ⊢ ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷))
50	1, 33, 4	psgnvalii 19372	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷)) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (-1↑(♯‘(𝑧 ++ 𝑤))))
51	49, 50	sylan2 594	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (-1↑(♯‘(𝑧 ++ 𝑤))))
52	1	symggrp 19263	. . . . . . . . . 10 ⊢ (𝐷 ∈ 𝑉 → 𝑆 ∈ Grp)
53	52	grpmndd 18829	. . . . . . . . 9 ⊢ (𝐷 ∈ 𝑉 → 𝑆 ∈ Mnd)
54	33, 1, 2	symgtrf 19332	. . . . . . . . . . 11 ⊢ ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆)
55		sswrd 14469	. . . . . . . . . . 11 ⊢ (ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆) → Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆))
56	54, 55	ax-mp 5	. . . . . . . . . 10 ⊢ Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆)
57	56	sseli 3978	. . . . . . . . 9 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → 𝑧 ∈ Word (Base‘𝑆))
58	56	sseli 3978	. . . . . . . . 9 ⊢ (𝑤 ∈ Word ran (pmTrsp‘𝐷) → 𝑤 ∈ Word (Base‘𝑆))
59	2, 14	gsumccat 18719	. . . . . . . . 9 ⊢ ((𝑆 ∈ Mnd ∧ 𝑧 ∈ Word (Base‘𝑆) ∧ 𝑤 ∈ Word (Base‘𝑆)) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
60	53, 57, 58, 59	syl3an 1161	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
61	60	3expb 1121	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
62	61	fveq2d 6893	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))))
63		ccatlen 14522	. . . . . . . . 9 ⊢ ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
64	63	adantl 483	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
65	64	oveq2d 7422	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑(♯‘(𝑧 ++ 𝑤))) = (-1↑((♯‘𝑧) + (♯‘𝑤))))
66		neg1cn 12323	. . . . . . . . 9 ⊢ -1 ∈ ℂ
67	66	a1i 11	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → -1 ∈ ℂ)
68		lencl 14480	. . . . . . . . 9 ⊢ (𝑤 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑤) ∈ ℕ₀)
69	68	ad2antll 728	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘𝑤) ∈ ℕ₀)
70	35	ad2antrl 727	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘𝑧) ∈ ℕ₀)
71	67, 69, 70	expaddd 14110	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑((♯‘𝑧) + (♯‘𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
72	65, 71	eqtrd 2773	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑(♯‘(𝑧 ++ 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
73	51, 62, 72	3eqtr3d 2781	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
74		oveq12 7415	. . . . . . . 8 ⊢ ((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) → (𝑥(+_g‘𝑆)𝑦) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
75	74	fveq2d 6893	. . . . . . 7 ⊢ ((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))))
76		oveq12 7415	. . . . . . 7 ⊢ (((𝑁‘𝑥) = (-1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤))) → ((𝑁‘𝑥) · (𝑁‘𝑦)) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
77	75, 76	eqeqan12d 2747	. . . . . 6 ⊢ (((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) ∧ ((𝑁‘𝑥) = (-1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → ((𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)) ↔ (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤)))))
78	77	an4s 659	. . . . 5 ⊢ (((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → ((𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)) ↔ (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤)))))
79	73, 78	syl5ibrcom 246	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦))))
80	79	rexlimdvva 3212	. . 3 ⊢ (𝐷 ∈ 𝑉 → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦))))
81	1, 33, 4	psgnvali 19371	. . . . 5 ⊢ (𝑦 ∈ dom 𝑁 → ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤))))
82	34, 81	anim12i 614	. . . 4 ⊢ ((𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁) → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))))
83		reeanv 3227	. . . 4 ⊢ (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) ↔ (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))))
84	82, 83	sylibr 233	. . 3 ⊢ ((𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁) → ∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))))
85	80, 84	impel 507	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁)) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)))
86	10, 12, 16, 22, 25, 27, 48, 85	isghmd 19096	1 ⊢ (𝐷 ∈ 𝑉 → 𝑁 ∈ (𝐹 GrpHom 𝑈))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 {crab 3433 Vcvv 3475 ∖ cdif 3945 ⊆ wss 3948 {cpr 4630 I cid 5573 dom cdm 5676 ran crn 5677 Fun wfun 6535 Fn wfn 6536 ⟶wf 6537 ‘cfv 6541 (class class class)co 7406 Fincfn 8936 ℂcc 11105 1c1 11108 + caddc 11110 · cmul 11112 -cneg 11442 ℕ₀cn0 12469 ℤcz 12555 ↑cexp 14024 ♯chash 14287 Word cword 14461 ++ cconcat 14517 Basecbs 17141 ↾_s cress 17170 +_gcplusg 17194 Σ_g cgsu 17383 Mndcmnd 18622 Grpcgrp 18816 SubGrpcsubg 18995 GrpHom cghm 19084 SymGrpcsymg 19229 pmTrspcpmtr 19304 pmSgncpsgn 19352 mulGrpcmgp 19982 ℂ_fldccnfld 20937

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 ax-addf 11186 ax-mulf 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-xor 1511 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-ot 4637 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 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-se 5632 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-isom 6550 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-tpos 8208 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-2o 8464 df-er 8700 df-map 8819 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-card 9931 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 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-xnn0 12542 df-z 12556 df-dec 12675 df-uz 12820 df-rp 12972 df-fz 13482 df-fzo 13625 df-seq 13964 df-exp 14025 df-hash 14288 df-word 14462 df-lsw 14510 df-concat 14518 df-s1 14543 df-substr 14588 df-pfx 14618 df-splice 14697 df-reverse 14706 df-s2 14796 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-starv 17209 df-tset 17213 df-ple 17214 df-ds 17216 df-unif 17217 df-0g 17384 df-gsum 17385 df-mre 17527 df-mrc 17528 df-acs 17530 df-mgm 18558 df-sgrp 18607 df-mnd 18623 df-mhm 18668 df-submnd 18669 df-efmnd 18747 df-grp 18819 df-minusg 18820 df-subg 18998 df-ghm 19085 df-gim 19128 df-oppg 19205 df-symg 19230 df-pmtr 19305 df-psgn 19354 df-cmn 19645 df-abl 19646 df-mgp 19983 df-ur 20000 df-ring 20052 df-cring 20053 df-oppr 20143 df-dvdsr 20164 df-unit 20165 df-invr 20195 df-dvr 20208 df-drng 20310 df-cnfld 20938

This theorem is referenced by: psgnghm2 21126 evpmss 21131

W3C validator