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 20697

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 2738	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
3		eqid 2738	. . . . . 6 ⊢ {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
4		psgnghm.n	. . . . . 6 ⊢ 𝑁 = (pmSgn‘𝐷)
5	1, 2, 3, 4	psgnfn 19024	. . . . 5 ⊢ 𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
6	5	fndmi 6521	. . . 4 ⊢ dom 𝑁 = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
7	6	ssrab3 4011	. . 3 ⊢ dom 𝑁 ⊆ (Base‘𝑆)
8		psgnghm.f	. . . 4 ⊢ 𝐹 = (𝑆 ↾_s dom 𝑁)
9	8, 2	ressbas2 16875	. . 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 20695	. 2 ⊢ {1, -1} = (Base‘𝑈)
13	10	fvexi 6770	. . 3 ⊢ dom 𝑁 ∈ V
14		eqid 2738	. . . 4 ⊢ (+_g‘𝑆) = (+_g‘𝑆)
15	8, 14	ressplusg 16926	. . 3 ⊢ (dom 𝑁 ∈ V → (+_g‘𝑆) = (+_g‘𝐹))
16	13, 15	ax-mp 5	. 2 ⊢ (+_g‘𝑆) = (+_g‘𝐹)
17		prex 5350	. . 3 ⊢ {1, -1} ∈ V
18		eqid 2738	. . . . 5 ⊢ (mulGrp‘ℂ_fld) = (mulGrp‘ℂ_fld)
19		cnfldmul 20516	. . . . 5 ⊢ · = (._r‘ℂ_fld)
20	18, 19	mgpplusg 19639	. . . 4 ⊢ · = (+_g‘(mulGrp‘ℂ_fld))
21	11, 20	ressplusg 16926	. . 3 ⊢ ({1, -1} ∈ V → · = (+_g‘𝑈))
22	17, 21	ax-mp 5	. 2 ⊢ · = (+_g‘𝑈)
23	1, 4	psgndmsubg 19025	. . 3 ⊢ (𝐷 ∈ 𝑉 → dom 𝑁 ∈ (SubGrp‘𝑆))
24	8	subggrp 18673	. . 3 ⊢ (dom 𝑁 ∈ (SubGrp‘𝑆) → 𝐹 ∈ Grp)
25	23, 24	syl 17	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝐹 ∈ Grp)
26	11	cnmsgngrp 20696	. . 3 ⊢ 𝑈 ∈ Grp
27	26	a1i 11	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝑈 ∈ Grp)
28		fnfun 6517	. . . . . 6 ⊢ (𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} → Fun 𝑁)
29	5, 28	ax-mp 5	. . . . 5 ⊢ Fun 𝑁
30		funfn 6448	. . . . 5 ⊢ (Fun 𝑁 ↔ 𝑁 Fn dom 𝑁)
31	29, 30	mpbi 229	. . . 4 ⊢ 𝑁 Fn dom 𝑁
32	31	a1i 11	. . 3 ⊢ (𝐷 ∈ 𝑉 → 𝑁 Fn dom 𝑁)
33		eqid 2738	. . . . . 6 ⊢ ran (pmTrsp‘𝐷) = ran (pmTrsp‘𝐷)
34	1, 33, 4	psgnvali 19031	. . . . 5 ⊢ (𝑥 ∈ dom 𝑁 → ∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))))
35		lencl 14164	. . . . . . . . . 10 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℕ₀)
36	35	nn0zd 12353	. . . . . . . . 9 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℤ)
37		m1expcl2 13732	. . . . . . . . . 10 ⊢ ((♯‘𝑧) ∈ ℤ → (-1↑(♯‘𝑧)) ∈ {-1, 1})
38		prcom 4665	. . . . . . . . . 10 ⊢ {-1, 1} = {1, -1}
39	37, 38	eleqtrdi 2849	. . . . . . . . 9 ⊢ ((♯‘𝑧) ∈ ℤ → (-1↑(♯‘𝑧)) ∈ {1, -1})
40		eleq1a 2834	. . . . . . . . 9 ⊢ ((-1↑(♯‘𝑧)) ∈ {1, -1} → ((𝑁‘𝑥) = (-1↑(♯‘𝑧)) → (𝑁‘𝑥) ∈ {1, -1}))
41	36, 39, 40	3syl 18	. . . . . . . 8 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → ((𝑁‘𝑥) = (-1↑(♯‘𝑧)) → (𝑁‘𝑥) ∈ {1, -1}))
42	41	adantld 490	. . . . . . 7 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → ((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) → (𝑁‘𝑥) ∈ {1, -1}))
43	42	rexlimiv 3208	. . . . . 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 3106	. . 3 ⊢ (𝐷 ∈ 𝑉 → ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1})
47		ffnfv 6974	. . 3 ⊢ (𝑁:dom 𝑁⟶{1, -1} ↔ (𝑁 Fn dom 𝑁 ∧ ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1}))
48	32, 46, 47	sylanbrc 582	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝑁:dom 𝑁⟶{1, -1})
49		ccatcl 14205	. . . . . . 7 ⊢ ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷))
50	1, 33, 4	psgnvalii 19032	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷)) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (-1↑(♯‘(𝑧 ++ 𝑤))))
51	49, 50	sylan2 592	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (-1↑(♯‘(𝑧 ++ 𝑤))))
52	1	symggrp 18923	. . . . . . . . . 10 ⊢ (𝐷 ∈ 𝑉 → 𝑆 ∈ Grp)
53	52	grpmndd 18504	. . . . . . . . 9 ⊢ (𝐷 ∈ 𝑉 → 𝑆 ∈ Mnd)
54	33, 1, 2	symgtrf 18992	. . . . . . . . . . 11 ⊢ ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆)
55		sswrd 14153	. . . . . . . . . . 11 ⊢ (ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆) → Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆))
56	54, 55	ax-mp 5	. . . . . . . . . 10 ⊢ Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆)
57	56	sseli 3913	. . . . . . . . 9 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → 𝑧 ∈ Word (Base‘𝑆))
58	56	sseli 3913	. . . . . . . . 9 ⊢ (𝑤 ∈ Word ran (pmTrsp‘𝐷) → 𝑤 ∈ Word (Base‘𝑆))
59	2, 14	gsumccat 18395	. . . . . . . . 9 ⊢ ((𝑆 ∈ Mnd ∧ 𝑧 ∈ Word (Base‘𝑆) ∧ 𝑤 ∈ Word (Base‘𝑆)) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
60	53, 57, 58, 59	syl3an 1158	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
61	60	3expb 1118	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
62	61	fveq2d 6760	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))))
63		ccatlen 14206	. . . . . . . . 9 ⊢ ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
64	63	adantl 481	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
65	64	oveq2d 7271	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑(♯‘(𝑧 ++ 𝑤))) = (-1↑((♯‘𝑧) + (♯‘𝑤))))
66		neg1cn 12017	. . . . . . . . 9 ⊢ -1 ∈ ℂ
67	66	a1i 11	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → -1 ∈ ℂ)
68		lencl 14164	. . . . . . . . 9 ⊢ (𝑤 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑤) ∈ ℕ₀)
69	68	ad2antll 725	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘𝑤) ∈ ℕ₀)
70	35	ad2antrl 724	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘𝑧) ∈ ℕ₀)
71	67, 69, 70	expaddd 13794	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑((♯‘𝑧) + (♯‘𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
72	65, 71	eqtrd 2778	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑(♯‘(𝑧 ++ 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
73	51, 62, 72	3eqtr3d 2786	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
74		oveq12 7264	. . . . . . . 8 ⊢ ((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) → (𝑥(+_g‘𝑆)𝑦) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
75	74	fveq2d 6760	. . . . . . 7 ⊢ ((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))))
76		oveq12 7264	. . . . . . 7 ⊢ (((𝑁‘𝑥) = (-1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤))) → ((𝑁‘𝑥) · (𝑁‘𝑦)) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
77	75, 76	eqeqan12d 2752	. . . . . 6 ⊢ (((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) ∧ ((𝑁‘𝑥) = (-1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → ((𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)) ↔ (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤)))))
78	77	an4s 656	. . . . 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 3222	. . 3 ⊢ (𝐷 ∈ 𝑉 → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦))))
81	1, 33, 4	psgnvali 19031	. . . . 5 ⊢ (𝑦 ∈ dom 𝑁 → ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤))))
82	34, 81	anim12i 612	. . . 4 ⊢ ((𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁) → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))))
83		reeanv 3292	. . . 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 505	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁)) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)))
86	10, 12, 16, 22, 25, 27, 48, 85	isghmd 18758	1 ⊢ (𝐷 ∈ 𝑉 → 𝑁 ∈ (𝐹 GrpHom 𝑈))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ∃wrex 3064 {crab 3067 Vcvv 3422 ∖ cdif 3880 ⊆ wss 3883 {cpr 4560 I cid 5479 dom cdm 5580 ran crn 5581 Fun wfun 6412 Fn wfn 6413 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 Fincfn 8691 ℂcc 10800 1c1 10803 + caddc 10805 · cmul 10807 -cneg 11136 ℕ₀cn0 12163 ℤcz 12249 ↑cexp 13710 ♯chash 13972 Word cword 14145 ++ cconcat 14201 Basecbs 16840 ↾_s cress 16867 +_gcplusg 16888 Σ_g cgsu 17068 Mndcmnd 18300 Grpcgrp 18492 SubGrpcsubg 18664 GrpHom cghm 18746 SymGrpcsymg 18889 pmTrspcpmtr 18964 pmSgncpsgn 19012 mulGrpcmgp 19635 ℂ_fldccnfld 20510

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-addf 10881 ax-mulf 10882

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-xor 1504 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-ot 4567 df-uni 4837 df-int 4877 df-iun 4923 df-iin 4924 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-tpos 8013 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-xnn0 12236 df-z 12250 df-dec 12367 df-uz 12512 df-rp 12660 df-fz 13169 df-fzo 13312 df-seq 13650 df-exp 13711 df-hash 13973 df-word 14146 df-lsw 14194 df-concat 14202 df-s1 14229 df-substr 14282 df-pfx 14312 df-splice 14391 df-reverse 14400 df-s2 14489 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-starv 16903 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-0g 17069 df-gsum 17070 df-mre 17212 df-mrc 17213 df-acs 17215 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-mhm 18345 df-submnd 18346 df-efmnd 18423 df-grp 18495 df-minusg 18496 df-subg 18667 df-ghm 18747 df-gim 18790 df-oppg 18865 df-symg 18890 df-pmtr 18965 df-psgn 19014 df-cmn 19303 df-abl 19304 df-mgp 19636 df-ur 19653 df-ring 19700 df-cring 19701 df-oppr 19777 df-dvdsr 19798 df-unit 19799 df-invr 19829 df-dvr 19840 df-drng 19908 df-cnfld 20511

This theorem is referenced by: psgnghm2 20698 evpmss 20703

W3C validator