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 21540

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 2735	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
3		eqid 2735	. . . . . 6 ⊢ {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
4		psgnghm.n	. . . . . 6 ⊢ 𝑁 = (pmSgn‘𝐷)
5	1, 2, 3, 4	psgnfn 19482	. . . . 5 ⊢ 𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
6	5	fndmi 6642	. . . 4 ⊢ dom 𝑁 = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
7	6	ssrab3 4057	. . 3 ⊢ dom 𝑁 ⊆ (Base‘𝑆)
8		psgnghm.f	. . . 4 ⊢ 𝐹 = (𝑆 ↾_s dom 𝑁)
9	8, 2	ressbas2 17259	. . 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 21538	. 2 ⊢ {1, -1} = (Base‘𝑈)
13	10	fvexi 6890	. . 3 ⊢ dom 𝑁 ∈ V
14		eqid 2735	. . . 4 ⊢ (+_g‘𝑆) = (+_g‘𝑆)
15	8, 14	ressplusg 17305	. . 3 ⊢ (dom 𝑁 ∈ V → (+_g‘𝑆) = (+_g‘𝐹))
16	13, 15	ax-mp 5	. 2 ⊢ (+_g‘𝑆) = (+_g‘𝐹)
17		prex 5407	. . 3 ⊢ {1, -1} ∈ V
18		eqid 2735	. . . . 5 ⊢ (mulGrp‘ℂ_fld) = (mulGrp‘ℂ_fld)
19		cnfldmul 21323	. . . . 5 ⊢ · = (._r‘ℂ_fld)
20	18, 19	mgpplusg 20104	. . . 4 ⊢ · = (+_g‘(mulGrp‘ℂ_fld))
21	11, 20	ressplusg 17305	. . 3 ⊢ ({1, -1} ∈ V → · = (+_g‘𝑈))
22	17, 21	ax-mp 5	. 2 ⊢ · = (+_g‘𝑈)
23	1, 4	psgndmsubg 19483	. . 3 ⊢ (𝐷 ∈ 𝑉 → dom 𝑁 ∈ (SubGrp‘𝑆))
24	8	subggrp 19112	. . 3 ⊢ (dom 𝑁 ∈ (SubGrp‘𝑆) → 𝐹 ∈ Grp)
25	23, 24	syl 17	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝐹 ∈ Grp)
26	11	cnmsgngrp 21539	. . 3 ⊢ 𝑈 ∈ Grp
27	26	a1i 11	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝑈 ∈ Grp)
28		fnfun 6638	. . . . . 6 ⊢ (𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} → Fun 𝑁)
29	5, 28	ax-mp 5	. . . . 5 ⊢ Fun 𝑁
30		funfn 6566	. . . . 5 ⊢ (Fun 𝑁 ↔ 𝑁 Fn dom 𝑁)
31	29, 30	mpbi 230	. . . 4 ⊢ 𝑁 Fn dom 𝑁
32	31	a1i 11	. . 3 ⊢ (𝐷 ∈ 𝑉 → 𝑁 Fn dom 𝑁)
33		eqid 2735	. . . . . 6 ⊢ ran (pmTrsp‘𝐷) = ran (pmTrsp‘𝐷)
34	1, 33, 4	psgnvali 19489	. . . . 5 ⊢ (𝑥 ∈ dom 𝑁 → ∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))))
35		lencl 14551	. . . . . . . . . 10 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℕ₀)
36	35	nn0zd 12614	. . . . . . . . 9 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℤ)
37		m1expcl2 14103	. . . . . . . . . 10 ⊢ ((♯‘𝑧) ∈ ℤ → (-1↑(♯‘𝑧)) ∈ {-1, 1})
38		prcom 4708	. . . . . . . . . 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 490	. . . . . . 7 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → ((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) → (𝑁‘𝑥) ∈ {1, -1}))
43	42	rexlimiv 3134	. . . . . 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 3131	. . 3 ⊢ (𝐷 ∈ 𝑉 → ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1})
47		ffnfv 7109	. . 3 ⊢ (𝑁:dom 𝑁⟶{1, -1} ↔ (𝑁 Fn dom 𝑁 ∧ ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1}))
48	32, 46, 47	sylanbrc 583	. 2 ⊢ (𝐷 ∈ 𝑉 → 𝑁:dom 𝑁⟶{1, -1})
49		ccatcl 14592	. . . . . . 7 ⊢ ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷))
50	1, 33, 4	psgnvalii 19490	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷)) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (-1↑(♯‘(𝑧 ++ 𝑤))))
51	49, 50	sylan2 593	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (-1↑(♯‘(𝑧 ++ 𝑤))))
52	1	symggrp 19381	. . . . . . . . . 10 ⊢ (𝐷 ∈ 𝑉 → 𝑆 ∈ Grp)
53	52	grpmndd 18929	. . . . . . . . 9 ⊢ (𝐷 ∈ 𝑉 → 𝑆 ∈ Mnd)
54	33, 1, 2	symgtrf 19450	. . . . . . . . . . 11 ⊢ ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆)
55		sswrd 14540	. . . . . . . . . . 11 ⊢ (ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆) → Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆))
56	54, 55	ax-mp 5	. . . . . . . . . 10 ⊢ Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆)
57	56	sseli 3954	. . . . . . . . 9 ⊢ (𝑧 ∈ Word ran (pmTrsp‘𝐷) → 𝑧 ∈ Word (Base‘𝑆))
58	56	sseli 3954	. . . . . . . . 9 ⊢ (𝑤 ∈ Word ran (pmTrsp‘𝐷) → 𝑤 ∈ Word (Base‘𝑆))
59	2, 14	gsumccat 18819	. . . . . . . . 9 ⊢ ((𝑆 ∈ Mnd ∧ 𝑧 ∈ Word (Base‘𝑆) ∧ 𝑤 ∈ Word (Base‘𝑆)) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
60	53, 57, 58, 59	syl3an 1160	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
61	60	3expb 1120	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑆 Σ_g (𝑧 ++ 𝑤)) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
62	61	fveq2d 6880	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σ_g (𝑧 ++ 𝑤))) = (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))))
63		ccatlen 14593	. . . . . . . . 9 ⊢ ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
64	63	adantl 481	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
65	64	oveq2d 7421	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑(♯‘(𝑧 ++ 𝑤))) = (-1↑((♯‘𝑧) + (♯‘𝑤))))
66		neg1cn 12354	. . . . . . . . 9 ⊢ -1 ∈ ℂ
67	66	a1i 11	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → -1 ∈ ℂ)
68		lencl 14551	. . . . . . . . 9 ⊢ (𝑤 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑤) ∈ ℕ₀)
69	68	ad2antll 729	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘𝑤) ∈ ℕ₀)
70	35	ad2antrl 728	. . . . . . . 8 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘𝑧) ∈ ℕ₀)
71	67, 69, 70	expaddd 14166	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑((♯‘𝑧) + (♯‘𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
72	65, 71	eqtrd 2770	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (-1↑(♯‘(𝑧 ++ 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
73	51, 62, 72	3eqtr3d 2778	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
74		oveq12 7414	. . . . . . . 8 ⊢ ((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) → (𝑥(+_g‘𝑆)𝑦) = ((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤)))
75	74	fveq2d 6880	. . . . . . 7 ⊢ ((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))))
76		oveq12 7414	. . . . . . 7 ⊢ (((𝑁‘𝑥) = (-1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤))) → ((𝑁‘𝑥) · (𝑁‘𝑦)) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤))))
77	75, 76	eqeqan12d 2749	. . . . . 6 ⊢ (((𝑥 = (𝑆 Σ_g 𝑧) ∧ 𝑦 = (𝑆 Σ_g 𝑤)) ∧ ((𝑁‘𝑥) = (-1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → ((𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)) ↔ (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤)))))
78	77	an4s 660	. . . . 5 ⊢ (((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → ((𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)) ↔ (𝑁‘((𝑆 Σ_g 𝑧)(+_g‘𝑆)(𝑆 Σ_g 𝑤))) = ((-1↑(♯‘𝑧)) · (-1↑(♯‘𝑤)))))
79	73, 78	syl5ibrcom 247	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦))))
80	79	rexlimdvva 3198	. . 3 ⊢ (𝐷 ∈ 𝑉 → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))) → (𝑁‘(𝑥(+_g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦))))
81	1, 33, 4	psgnvali 19489	. . . . 5 ⊢ (𝑦 ∈ dom 𝑁 → ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤))))
82	34, 81	anim12i 613	. . . 4 ⊢ ((𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁) → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σ_g 𝑧) ∧ (𝑁‘𝑥) = (-1↑(♯‘𝑧))) ∧ ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σ_g 𝑤) ∧ (𝑁‘𝑦) = (-1↑(♯‘𝑤)))))
83		reeanv 3213	. . . 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 234	. . 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 19208	1 ⊢ (𝐷 ∈ 𝑉 → 𝑁 ∈ (𝐹 GrpHom 𝑈))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ∀wral 3051 ∃wrex 3060 {crab 3415 Vcvv 3459 ∖ cdif 3923 ⊆ wss 3926 {cpr 4603 I cid 5547 dom cdm 5654 ran crn 5655 Fun wfun 6525 Fn wfn 6526 ⟶wf 6527 ‘cfv 6531 (class class class)co 7405 Fincfn 8959 ℂcc 11127 1c1 11130 + caddc 11132 · cmul 11134 -cneg 11467 ℕ₀cn0 12501 ℤcz 12588 ↑cexp 14079 ♯chash 14348 Word cword 14531 ++ cconcat 14588 Basecbs 17228 ↾_s cress 17251 +_gcplusg 17271 Σ_g cgsu 17454 Mndcmnd 18712 Grpcgrp 18916 SubGrpcsubg 19103 GrpHom cghm 19195 SymGrpcsymg 19350 pmTrspcpmtr 19422 pmSgncpsgn 19470 mulGrpcmgp 20100 ℂ_fldccnfld 21315

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-addf 11208 ax-mulf 11209

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-xor 1512 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-tp 4606 df-op 4608 df-ot 4610 df-uni 4884 df-int 4923 df-iun 4969 df-iin 4970 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-tpos 8225 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-2o 8481 df-er 8719 df-map 8842 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12502 df-xnn0 12575 df-z 12589 df-dec 12709 df-uz 12853 df-rp 13009 df-fz 13525 df-fzo 13672 df-seq 14020 df-exp 14080 df-hash 14349 df-word 14532 df-lsw 14581 df-concat 14589 df-s1 14614 df-substr 14659 df-pfx 14689 df-splice 14768 df-reverse 14777 df-s2 14867 df-struct 17166 df-sets 17183 df-slot 17201 df-ndx 17213 df-base 17229 df-ress 17252 df-plusg 17284 df-mulr 17285 df-starv 17286 df-tset 17290 df-ple 17291 df-ds 17293 df-unif 17294 df-0g 17455 df-gsum 17456 df-mre 17598 df-mrc 17599 df-acs 17601 df-mgm 18618 df-sgrp 18697 df-mnd 18713 df-mhm 18761 df-submnd 18762 df-efmnd 18847 df-grp 18919 df-minusg 18920 df-subg 19106 df-ghm 19196 df-gim 19242 df-oppg 19329 df-symg 19351 df-pmtr 19423 df-psgn 19472 df-cmn 19763 df-abl 19764 df-mgp 20101 df-rng 20113 df-ur 20142 df-ring 20195 df-cring 20196 df-oppr 20297 df-dvdsr 20317 df-unit 20318 df-invr 20348 df-dvr 20361 df-drng 20691 df-cnfld 21316

This theorem is referenced by: psgnghm2 21541 evpmss 21546

W3C validator