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

Theorem psgnghm 21901
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.
StepHypRef Expression
1 psgnghm.s . . . . . 6 𝑆 = (SymGrp‘𝐷)
2 eqid 2763 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
3 eqid 2763 . . . . . 6 {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
4 psgnghm.n . . . . . 6 𝑁 = (pmSgn‘𝐷)
51, 2, 3, 4psgnfn 19730 . . . . 5 𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
65fndmi 6654 . . . 4 dom 𝑁 = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
76ssrab3 4010 . . 3 dom 𝑁 ⊆ (Base‘𝑆)
8 psgnghm.f . . . 4 𝐹 = (𝑆 ↾s dom 𝑁)
98, 2ressbas2 17431 . . 3 (dom 𝑁 ⊆ (Base‘𝑆) → dom 𝑁 = (Base‘𝐹))
107, 9ax-mp 5 . 2 dom 𝑁 = (Base‘𝐹)
11 psgnghm.u . . 3 𝑈 = ((mulGrp‘ℂfld) ↾s {1, -1})
1211cnmsgnbas 21899 . 2 {1, -1} = (Base‘𝑈)
1310fvexi 6910 . . 3 dom 𝑁 ∈ V
14 eqid 2763 . . . 4 (+g‘𝑆) = (+g‘𝑆)
158, 14ressplusg 17477 . . 3 (dom 𝑁 ∈ V → (+g‘𝑆) = (+g‘𝐹))
1613, 15ax-mp 5 . 2 (+g‘𝑆) = (+g‘𝐹)
17 prex 5400 . . 3 {1, -1} ∈ V
18 eqid 2763 . . . . 5 (mulGrp‘ℂfld) = (mulGrp‘ℂfld)
19 cnfldmul 21701 . . . . 5 · = (.r‘ℂfld)
2018, 19mgpplusg 20379 . . . 4 · = (+g‘(mulGrp‘ℂfld))
2111, 20ressplusg 17477 . . 3 ({1, -1} ∈ V → · = (+g‘𝑈))
2217, 21ax-mp 5 . 2 · = (+g‘𝑈)
231, 4psgndmsubg 19731 . . 3 (𝐷 ∈ 𝑉 → dom 𝑁 ∈ (SubGrp‘𝑆))
248subggrp 19354 . . 3 (dom 𝑁 ∈ (SubGrp‘𝑆) → 𝐹 ∈ Grp)
2523, 24syl 18 . 2 (𝐷 ∈ 𝑉 → 𝐹 ∈ Grp)
2611cnmsgngrp 21900 . . 3 𝑈 ∈ Grp
2726a1i 11 . 2 (𝐷 ∈ 𝑉 → 𝑈 ∈ Grp)
28 fnfun 6650 . . . . . 6 (𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} → Fun 𝑁)
295, 28ax-mp 5 . . . . 5 Fun 𝑁
30 funfn 6579 . . . . 5 (Fun 𝑁 ↔ 𝑁 Fn dom 𝑁)
3129, 30mpbi 233 . . . 4 𝑁 Fn dom 𝑁
3231a1i 11 . . 3 (𝐷 ∈ 𝑉 → 𝑁 Fn dom 𝑁)
33 eqid 2763 . . . . . 6 ran (pmTrsp‘𝐷) = ran (pmTrsp‘𝐷)
341, 33, 4psgnvali 19737 . . . . 5 (𝑥 ∈ dom 𝑁 → ∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))))
35 lencl 14691 . . . . . . . . . 10 (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℕ0)
3635nn0zd 12731 . . . . . . . . 9 (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℤ)
37 m1expcl2 14241 . . . . . . . . . 10 ((♯‘𝑧) ∈ ℤ → ( -1↑(♯‘𝑧)) ∈ { -1, 1})
38 prcom 4693 . . . . . . . . . 10 { -1, 1} = {1, -1}
3937, 38eleqtrdi 2874 . . . . . . . . 9 ((♯‘𝑧) ∈ ℤ → ( -1↑(♯‘𝑧)) ∈ {1, -1})
40 eleq1a 2859 . . . . . . . . 9 (( -1↑(♯‘𝑧)) ∈ {1, -1} → ((𝑁‘𝑥) = ( -1↑(♯‘𝑧)) → (𝑁‘𝑥) ∈ {1, -1}))
4136, 39, 403syl 19 . . . . . . . 8 (𝑧 ∈ Word ran (pmTrsp‘𝐷) → ((𝑁‘𝑥) = ( -1↑(♯‘𝑧)) → (𝑁‘𝑥) ∈ {1, -1}))
4241adantld 496 . . . . . . 7 (𝑧 ∈ Word ran (pmTrsp‘𝐷) → ((𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) → (𝑁‘𝑥) ∈ {1, -1}))
4342rexlimiv 3160 . . . . . 6 (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) → (𝑁‘𝑥) ∈ {1, -1})
4443a1i 11 . . . . 5 (𝐷 ∈ 𝑉 → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) → (𝑁‘𝑥) ∈ {1, -1}))
4534, 44syl5 35 . . . 4 (𝐷 ∈ 𝑉 → (𝑥 ∈ dom 𝑁 → (𝑁‘𝑥) ∈ {1, -1}))
4645ralrimiv 3157 . . 3 (𝐷 ∈ 𝑉 → ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1})
47 ffnfv 7130 . . 3 (𝑁:dom 𝑁⟶{1, -1} ↔ (𝑁 Fn dom 𝑁 ∧ ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1}))
4832, 46, 47sylanbrc 595 . 2 (𝐷 ∈ 𝑉 → 𝑁:dom 𝑁⟶{1, -1})
49 ccatcl 14732 . . . . . . 7 ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷))
501, 33, 4psgnvalii 19738 . . . . . . 7 ((𝐷 ∈ 𝑉 ∧ (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷)) → (𝑁‘(𝑆 Σg (𝑧 ++ 𝑤))) = ( -1↑(♯‘(𝑧 ++ 𝑤))))
5149, 50sylan2 605 . . . . . 6 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σg (𝑧 ++ 𝑤))) = ( -1↑(♯‘(𝑧 ++ 𝑤))))
521symggrp 19629 . . . . . . . . . 10 (𝐷 ∈ 𝑉 → 𝑆 ∈ Grp)
5352grpmndd 19172 . . . . . . . . 9 (𝐷 ∈ 𝑉 → 𝑆 ∈ Mnd)
5433, 1, 2symgtrf 19698 . . . . . . . . . . 11 ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆)
55 sswrd 14680 . . . . . . . . . . 11 (ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆) → Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆))
5654, 55ax-mp 5 . . . . . . . . . 10 Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆)
5756sseli 3909 . . . . . . . . 9 (𝑧 ∈ Word ran (pmTrsp‘𝐷) → 𝑧 ∈ Word (Base‘𝑆))
5856sseli 3909 . . . . . . . . 9 (𝑤 ∈ Word ran (pmTrsp‘𝐷) → 𝑤 ∈ Word (Base‘𝑆))
592, 14gsumccat 19052 . . . . . . . . 9 ((𝑆 ∈ Mnd ∧ 𝑧 ∈ Word (Base‘𝑆) ∧ 𝑤 ∈ Word (Base‘𝑆)) → (𝑆 Σg (𝑧 ++ 𝑤)) = ((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤)))
6053, 57, 58, 59syl3an 1178 . . . . . . . 8 ((𝐷 ∈ 𝑉 ∧ 𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑆 Σg (𝑧 ++ 𝑤)) = ((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤)))
61603expb 1138 . . . . . . 7 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑆 Σg (𝑧 ++ 𝑤)) = ((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤)))
6261fveq2d 6900 . . . . . 6 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σg (𝑧 ++ 𝑤))) = (𝑁‘((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤))))
63 ccatlen 14733 . . . . . . . . 9 ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
6463adantl 487 . . . . . . . 8 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
6564oveq2d 7446 . . . . . . 7 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → ( -1↑(♯‘(𝑧 ++ 𝑤))) = ( -1↑((♯‘𝑧) + (♯‘𝑤))))
66 neg1cn 12318 . . . . . . . . 9 -1 ∈ ℂ
6766a1i 11 . . . . . . . 8 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → -1 ∈ ℂ)
68 lencl 14691 . . . . . . . . 9 (𝑤 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑤) ∈ ℕ0)
6968ad2antll 742 . . . . . . . 8 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘𝑤) ∈ ℕ0)
7035ad2antrl 741 . . . . . . . 8 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘𝑧) ∈ ℕ0)
7167, 69, 70expaddd 14304 . . . . . . 7 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → ( -1↑((♯‘𝑧) + (♯‘𝑤))) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤))))
7265, 71eqtrd 2798 . . . . . 6 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → ( -1↑(♯‘(𝑧 ++ 𝑤))) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤))))
7351, 62, 723eqtr3d 2806 . . . . 5 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤))) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤))))
74 oveq12 7439 . . . . . . . 8 ((𝑥 = (𝑆 Σg 𝑧) ∧ 𝑦 = (𝑆 Σg 𝑤)) → (𝑥(+g‘𝑆)𝑦) = ((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤)))
7574fveq2d 6900 . . . . . . 7 ((𝑥 = (𝑆 Σg 𝑧) ∧ 𝑦 = (𝑆 Σg 𝑤)) → (𝑁‘(𝑥(+g‘𝑆)𝑦)) = (𝑁‘((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤))))
76 oveq12 7439 . . . . . . 7 (((𝑁‘𝑥) = ( -1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤))) → ((𝑁‘𝑥) · (𝑁‘𝑦)) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤))))
7775, 76eqeqan12d 2777 . . . . . 6 (((𝑥 = (𝑆 Σg 𝑧) ∧ 𝑦 = (𝑆 Σg 𝑤)) ∧ ((𝑁‘𝑥) = ( -1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))) → ((𝑁‘(𝑥(+g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)) ↔ (𝑁‘((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤))) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤)))))
7877an4s 673 . . . . 5 (((𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))) → ((𝑁‘(𝑥(+g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)) ↔ (𝑁‘((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤))) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤)))))
7973, 78syl5ibrcom 250 . . . 4 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (((𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))) → (𝑁‘(𝑥(+g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦))))
8079rexlimdvva 3223 . . 3 (𝐷 ∈ 𝑉 → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))) → (𝑁‘(𝑥(+g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦))))
811, 33, 4psgnvali 19737 . . . . 5 (𝑦 ∈ dom 𝑁 → ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤))))
8234, 81anim12i 625 . . . 4 ((𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁) → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) ∧ ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))))
83 reeanv 3238 . . . 4 (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))) ↔ (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) ∧ ∃𝑤 ∈ Word ran (pmTrsp‘𝐷)(𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))))
8482, 83sylibr 237 . . 3 ((𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁) → ∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))))
8580, 84impel 515 . 2 ((𝐷 ∈ 𝑉 ∧ (𝑥 ∈ dom 𝑁 ∧ 𝑦 ∈ dom 𝑁)) → (𝑁‘(𝑥(+g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦)))
8610, 12, 16, 22, 25, 27, 48, 85isghmd 19454 1 (𝐷 ∈ 𝑉 → 𝑁 ∈ (𝐹 GrpHom 𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  {cpr 4590   I cid 5549  dom cdm 5655  ran crn 5656  Fun wfun 6541   Fn wfn 6542  ⟶wf 6543  ‘cfv 6547  (class class class)co 7430  Fincfn 8987  ℂcc 11211  1c1 11214   + caddc 11216   · cmul 11218   -cneg 11555  ℕ0cn0 12619  ℤcz 12706  ↑cexp 14217  ♯chash 14487  Word cword 14671   ++ cconcat 14728  Basecbs 17402   ↾s cress 17423  +gcplusg 17443   Σg cgsu 17626  Mndcmnd 18938  Grpcgrp 19159  SubGrpcsubg 19345   GrpHom cghm 19442  SymGrpcsymg 19598  pmTrspcpmtr 19670  pmSgncpsgn 19718  mulGrpcmgp 20375  ℂfldccnfld 21693
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761  ax-cnex 11269  ax-resscn 11270  ax-1cn 11271  ax-icn 11272  ax-addcl 11273  ax-addrcl 11274  ax-mulcl 11275  ax-mulrcl 11276  ax-mulcom 11277  ax-addass 11278  ax-mulass 11279  ax-distr 11280  ax-i2m1 11281  ax-1ne0 11282  ax-1rid 11283  ax-rnegex 11284  ax-rrecex 11285  ax-cnre 11286  ax-pre-lttri 11287  ax-pre-lttrn 11288  ax-pre-ltadd 11289  ax-pre-mulgt0 11290  ax-addf 11292  ax-mulf 11293
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-xor 1541  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-ot 4862  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-isom 6556  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-1st 8011  df-2nd 8012  df-tpos 8257  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-1o 8490  df-2o 8491  df-er 8731  df-map 8863  df-en 8988  df-dom 8989  df-sdom 8990  df-fin 8991  df-card 10033  df-pnf 11358  df-mnf 11359  df-xr 11360  df-ltxr 11361  df-le 11362  df-sub 11556  df-neg 11557  df-div 11987  df-nn 12349  df-2 12418  df-3 12419  df-4 12420  df-5 12421  df-6 12422  df-7 12423  df-8 12424  df-9 12425  df-n0 12620  df-xnn0 12693  df-z 12707  df-dec 12828  df-uz 12979  df-rp 13134  df-fz 13653  df-fzo 13802  df-seq 14158  df-exp 14218  df-hash 14488  df-word 14672  df-lsw 14721  df-concat 14729  df-s1 14756  df-substr 14803  df-pfx 14835  df-splice 14913  df-reverse 14922  df-s2 15013  df-struct 17340  df-sets 17357  df-slot 17375  df-ndx 17387  df-base 17403  df-ress 17424  df-plusg 17456  df-mulr 17457  df-starv 17458  df-tset 17462  df-ple 17463  df-ds 17465  df-unif 17466  df-0g 17627  df-gsum 17628  df-mre 17771  df-mrc 17772  df-acs 17774  df-mgm 18831  df-sgrp 18923  df-mnd 18939  df-mhm 18993  df-submnd 18994  df-efmnd 19080  df-grp 19162  df-minusg 19163  df-subg 19348  df-ghm 19443  df-gim 19488  df-oppg 19575  df-symg 19599  df-pmtr 19671  df-psgn 19720  df-cmn 20011  df-abl 20012  df-mgp 20376  df-rng 20390  df-ur 20423  df-ring 20476  df-cring 20477  df-oppr 20582  df-dvdsr 20602  df-unit 20603  df-invr 20633  df-dvr 20646  df-drng 20997  df-cnfld 21694
This theorem is used by:  psgnghm2  21902  evpmss  21907
  Copyright terms: Public domain W3C validator