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

Theorem psgnghm 21886
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 2761 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
3 eqid 2761 . . . . . 6 {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
4 psgnghm.n . . . . . 6 𝑁 = (pmSgn‘𝐷)
51, 2, 3, 4psgnfn 19715 . . . . 5 𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
65fndmi 6643 . . . 4 dom 𝑁 = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
76ssrab3 4030 . . 3 dom 𝑁 ⊆ (Base‘𝑆)
8 psgnghm.f . . . 4 𝐹 = (𝑆 ↾s dom 𝑁)
98, 2ressbas2 17416 . . 3 (dom 𝑁 ⊆ (Base‘𝑆) → dom 𝑁 = (Base‘𝐹))
107, 9ax-mp 5 . 2 dom 𝑁 = (Base‘𝐹)
11 psgnghm.u . . 3 𝑈 = ((mulGrp‘ℂfld) ↾s {1, -1})
1211cnmsgnbas 21884 . 2 {1, -1} = (Base‘𝑈)
1310fvexi 6899 . . 3 dom 𝑁 ∈ V
14 eqid 2761 . . . 4 (+g‘𝑆) = (+g‘𝑆)
158, 14ressplusg 17462 . . 3 (dom 𝑁 ∈ V → (+g‘𝑆) = (+g‘𝐹))
1613, 15ax-mp 5 . 2 (+g‘𝑆) = (+g‘𝐹)
17 prex 5396 . . 3 {1, -1} ∈ V
18 eqid 2761 . . . . 5 (mulGrp‘ℂfld) = (mulGrp‘ℂfld)
19 cnfldmul 21686 . . . . 5 · = (.r‘ℂfld)
2018, 19mgpplusg 20364 . . . 4 · = (+g‘(mulGrp‘ℂfld))
2111, 20ressplusg 17462 . . 3 ({1, -1} ∈ V → · = (+g‘𝑈))
2217, 21ax-mp 5 . 2 · = (+g‘𝑈)
231, 4psgndmsubg 19716 . . 3 (𝐷 ∈ 𝑉 → dom 𝑁 ∈ (SubGrp‘𝑆))
248subggrp 19339 . . 3 (dom 𝑁 ∈ (SubGrp‘𝑆) → 𝐹 ∈ Grp)
2523, 24syl 18 . 2 (𝐷 ∈ 𝑉 → 𝐹 ∈ Grp)
2611cnmsgngrp 21885 . . 3 𝑈 ∈ Grp
2726a1i 11 . 2 (𝐷 ∈ 𝑉 → 𝑈 ∈ Grp)
28 fnfun 6639 . . . . . 6 (𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} → Fun 𝑁)
295, 28ax-mp 5 . . . . 5 Fun 𝑁
30 funfn 6570 . . . . 5 (Fun 𝑁 ↔ 𝑁 Fn dom 𝑁)
3129, 30mpbi 233 . . . 4 𝑁 Fn dom 𝑁
3231a1i 11 . . 3 (𝐷 ∈ 𝑉 → 𝑁 Fn dom 𝑁)
33 eqid 2761 . . . . . 6 ran (pmTrsp‘𝐷) = ran (pmTrsp‘𝐷)
341, 33, 4psgnvali 19722 . . . . 5 (𝑥 ∈ dom 𝑁 → ∃𝑧 ∈ Word ran (pmTrsp‘𝐷)(𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))))
35 lencl 14678 . . . . . . . . . 10 (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℕ0)
3635nn0zd 12718 . . . . . . . . 9 (𝑧 ∈ Word ran (pmTrsp‘𝐷) → (♯‘𝑧) ∈ ℤ)
37 m1expcl2 14228 . . . . . . . . . 10 ((♯‘𝑧) ∈ ℤ → ( -1↑(♯‘𝑧)) ∈ { -1, 1})
38 prcom 4693 . . . . . . . . . 10 { -1, 1} = {1, -1}
3937, 38eleqtrdi 2871 . . . . . . . . 9 ((♯‘𝑧) ∈ ℤ → ( -1↑(♯‘𝑧)) ∈ {1, -1})
40 eleq1a 2856 . . . . . . . . 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 3157 . . . . . 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 3154 . . 3 (𝐷 ∈ 𝑉 → ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1})
47 ffnfv 7119 . . 3 (𝑁:dom 𝑁⟶{1, -1} ↔ (𝑁 Fn dom 𝑁 ∧ ∀𝑥 ∈ dom 𝑁(𝑁‘𝑥) ∈ {1, -1}))
4832, 46, 47sylanbrc 595 . 2 (𝐷 ∈ 𝑉 → 𝑁:dom 𝑁⟶{1, -1})
49 ccatcl 14719 . . . . . . 7 ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷))
501, 33, 4psgnvalii 19723 . . . . . . 7 ((𝐷 ∈ 𝑉 ∧ (𝑧 ++ 𝑤) ∈ Word ran (pmTrsp‘𝐷)) → (𝑁‘(𝑆 Σg (𝑧 ++ 𝑤))) = ( -1↑(♯‘(𝑧 ++ 𝑤))))
5149, 50sylan2 605 . . . . . 6 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σg (𝑧 ++ 𝑤))) = ( -1↑(♯‘(𝑧 ++ 𝑤))))
521symggrp 19614 . . . . . . . . . 10 (𝐷 ∈ 𝑉 → 𝑆 ∈ Grp)
5352grpmndd 19157 . . . . . . . . 9 (𝐷 ∈ 𝑉 → 𝑆 ∈ Mnd)
5433, 1, 2symgtrf 19683 . . . . . . . . . . 11 ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆)
55 sswrd 14667 . . . . . . . . . . 11 (ran (pmTrsp‘𝐷) ⊆ (Base‘𝑆) → Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆))
5654, 55ax-mp 5 . . . . . . . . . 10 Word ran (pmTrsp‘𝐷) ⊆ Word (Base‘𝑆)
5756sseli 3927 . . . . . . . . 9 (𝑧 ∈ Word ran (pmTrsp‘𝐷) → 𝑧 ∈ Word (Base‘𝑆))
5856sseli 3927 . . . . . . . . 9 (𝑤 ∈ Word ran (pmTrsp‘𝐷) → 𝑤 ∈ Word (Base‘𝑆))
592, 14gsumccat 19037 . . . . . . . . 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 6889 . . . . . 6 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘(𝑆 Σg (𝑧 ++ 𝑤))) = (𝑁‘((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤))))
63 ccatlen 14720 . . . . . . . . 9 ((𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷)) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
6463adantl 487 . . . . . . . 8 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (♯‘(𝑧 ++ 𝑤)) = ((♯‘𝑧) + (♯‘𝑤)))
6564oveq2d 7436 . . . . . . 7 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → ( -1↑(♯‘(𝑧 ++ 𝑤))) = ( -1↑((♯‘𝑧) + (♯‘𝑤))))
66 neg1cn 12305 . . . . . . . . 9 -1 ∈ ℂ
6766a1i 11 . . . . . . . 8 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → -1 ∈ ℂ)
68 lencl 14678 . . . . . . . . 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 14291 . . . . . . 7 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → ( -1↑((♯‘𝑧) + (♯‘𝑤))) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤))))
7265, 71eqtrd 2796 . . . . . 6 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → ( -1↑(♯‘(𝑧 ++ 𝑤))) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤))))
7351, 62, 723eqtr3d 2804 . . . . 5 ((𝐷 ∈ 𝑉 ∧ (𝑧 ∈ Word ran (pmTrsp‘𝐷) ∧ 𝑤 ∈ Word ran (pmTrsp‘𝐷))) → (𝑁‘((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤))) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤))))
74 oveq12 7429 . . . . . . . 8 ((𝑥 = (𝑆 Σg 𝑧) ∧ 𝑦 = (𝑆 Σg 𝑤)) → (𝑥(+g‘𝑆)𝑦) = ((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤)))
7574fveq2d 6889 . . . . . . 7 ((𝑥 = (𝑆 Σg 𝑧) ∧ 𝑦 = (𝑆 Σg 𝑤)) → (𝑁‘(𝑥(+g‘𝑆)𝑦)) = (𝑁‘((𝑆 Σg 𝑧)(+g‘𝑆)(𝑆 Σg 𝑤))))
76 oveq12 7429 . . . . . . 7 (((𝑁‘𝑥) = ( -1↑(♯‘𝑧)) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤))) → ((𝑁‘𝑥) · (𝑁‘𝑦)) = (( -1↑(♯‘𝑧)) · ( -1↑(♯‘𝑤))))
7775, 76eqeqan12d 2775 . . . . . 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 3220 . . 3 (𝐷 ∈ 𝑉 → (∃𝑧 ∈ Word ran (pmTrsp‘𝐷)∃𝑤 ∈ Word ran (pmTrsp‘𝐷)((𝑥 = (𝑆 Σg 𝑧) ∧ (𝑁‘𝑥) = ( -1↑(♯‘𝑧))) ∧ (𝑦 = (𝑆 Σg 𝑤) ∧ (𝑁‘𝑦) = ( -1↑(♯‘𝑤)))) → (𝑁‘(𝑥(+g‘𝑆)𝑦)) = ((𝑁‘𝑥) · (𝑁‘𝑦))))
811, 33, 4psgnvali 19722 . . . . 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 3235 . . . 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 19439 1 (𝐷 ∈ 𝑉 → 𝑁 ∈ (𝐹 GrpHom 𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  {crab 3413  Vcvv 3451   ∖ cdif 3896   ⊆ wss 3899  {cpr 4586   I cid 5545  dom cdm 5651  ran crn 5652  Fun wfun 6532   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Fincfn 8973  ℂcc 11198  1c1 11201   + caddc 11203   · cmul 11205   -cneg 11542  ℕ0cn0 12606  ℤcz 12693  ↑cexp 14204  ♯chash 14474  Word cword 14658   ++ cconcat 14715  Basecbs 17387   ↾s cress 17408  +gcplusg 17428   Σg cgsu 17611  Mndcmnd 18923  Grpcgrp 19144  SubGrpcsubg 19330   GrpHom cghm 19427  SymGrpcsymg 19583  pmTrspcpmtr 19655  pmSgncpsgn 19703  mulGrpcmgp 20360  ℂfldccnfld 21678
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277  ax-addf 11279  ax-mulf 11280
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-xor 1542  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-tpos 8243  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-2o 8477  df-er 8717  df-map 8849  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-card 10020  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-div 11974  df-nn 12336  df-2 12405  df-3 12406  df-4 12407  df-5 12408  df-6 12409  df-7 12410  df-8 12411  df-9 12412  df-n0 12607  df-xnn0 12680  df-z 12694  df-dec 12815  df-uz 12966  df-rp 13121  df-fz 13640  df-fzo 13789  df-seq 14145  df-exp 14205  df-hash 14475  df-word 14659  df-lsw 14708  df-concat 14716  df-s1 14743  df-substr 14789  df-pfx 14821  df-splice 14899  df-reverse 14908  df-s2 14999  df-struct 17325  df-sets 17342  df-slot 17360  df-ndx 17372  df-base 17388  df-ress 17409  df-plusg 17441  df-mulr 17442  df-starv 17443  df-tset 17447  df-ple 17448  df-ds 17450  df-unif 17451  df-0g 17612  df-gsum 17613  df-mre 17756  df-mrc 17757  df-acs 17759  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-mhm 18978  df-submnd 18979  df-efmnd 19065  df-grp 19147  df-minusg 19148  df-subg 19333  df-ghm 19428  df-gim 19473  df-oppg 19560  df-symg 19584  df-pmtr 19656  df-psgn 19705  df-cmn 19996  df-abl 19997  df-mgp 20361  df-rng 20375  df-ur 20408  df-ring 20461  df-cring 20462  df-oppr 20567  df-dvdsr 20587  df-unit 20588  df-invr 20618  df-dvr 20631  df-drng 20982  df-cnfld 21679
This theorem is used by:  psgnghm2  21887  evpmss  21892
  Copyright terms: Public domain W3C validator