Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dchrplusg | Structured version Visualization version GIF version |
Description: Group operation on the group of Dirichlet characters. (Contributed by Mario Carneiro, 18-Apr-2016.) |
Ref | Expression |
---|---|
dchrmhm.g | ⊢ 𝐺 = (DChr‘𝑁) |
dchrmhm.z | ⊢ 𝑍 = (ℤ/nℤ‘𝑁) |
dchrmhm.b | ⊢ 𝐷 = (Base‘𝐺) |
dchrmul.t | ⊢ · = (+g‘𝐺) |
dchrplusg.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
Ref | Expression |
---|---|
dchrplusg | ⊢ (𝜑 → · = ( ∘f · ↾ (𝐷 × 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dchrmhm.g | . . . 4 ⊢ 𝐺 = (DChr‘𝑁) | |
2 | dchrmhm.z | . . . 4 ⊢ 𝑍 = (ℤ/nℤ‘𝑁) | |
3 | eqid 2740 | . . . 4 ⊢ (Base‘𝑍) = (Base‘𝑍) | |
4 | eqid 2740 | . . . 4 ⊢ (Unit‘𝑍) = (Unit‘𝑍) | |
5 | dchrplusg.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
6 | dchrmhm.b | . . . . 5 ⊢ 𝐷 = (Base‘𝐺) | |
7 | 1, 2, 3, 4, 5, 6 | dchrbas 26381 | . . . 4 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ((mulGrp‘𝑍) MndHom (mulGrp‘ℂfld)) ∣ (((Base‘𝑍) ∖ (Unit‘𝑍)) × {0}) ⊆ 𝑥}) |
8 | 1, 2, 3, 4, 5, 7 | dchrval 26380 | . . 3 ⊢ (𝜑 → 𝐺 = {〈(Base‘ndx), 𝐷〉, 〈(+g‘ndx), ( ∘f · ↾ (𝐷 × 𝐷))〉}) |
9 | 8 | fveq2d 6775 | . 2 ⊢ (𝜑 → (+g‘𝐺) = (+g‘{〈(Base‘ndx), 𝐷〉, 〈(+g‘ndx), ( ∘f · ↾ (𝐷 × 𝐷))〉})) |
10 | dchrmul.t | . 2 ⊢ · = (+g‘𝐺) | |
11 | 6 | fvexi 6785 | . . . 4 ⊢ 𝐷 ∈ V |
12 | 11, 11 | xpex 7597 | . . 3 ⊢ (𝐷 × 𝐷) ∈ V |
13 | ofexg 7532 | . . 3 ⊢ ((𝐷 × 𝐷) ∈ V → ( ∘f · ↾ (𝐷 × 𝐷)) ∈ V) | |
14 | eqid 2740 | . . . 4 ⊢ {〈(Base‘ndx), 𝐷〉, 〈(+g‘ndx), ( ∘f · ↾ (𝐷 × 𝐷))〉} = {〈(Base‘ndx), 𝐷〉, 〈(+g‘ndx), ( ∘f · ↾ (𝐷 × 𝐷))〉} | |
15 | 14 | grpplusg 16996 | . . 3 ⊢ (( ∘f · ↾ (𝐷 × 𝐷)) ∈ V → ( ∘f · ↾ (𝐷 × 𝐷)) = (+g‘{〈(Base‘ndx), 𝐷〉, 〈(+g‘ndx), ( ∘f · ↾ (𝐷 × 𝐷))〉})) |
16 | 12, 13, 15 | mp2b 10 | . 2 ⊢ ( ∘f · ↾ (𝐷 × 𝐷)) = (+g‘{〈(Base‘ndx), 𝐷〉, 〈(+g‘ndx), ( ∘f · ↾ (𝐷 × 𝐷))〉}) |
17 | 9, 10, 16 | 3eqtr4g 2805 | 1 ⊢ (𝜑 → · = ( ∘f · ↾ (𝐷 × 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2110 Vcvv 3431 {cpr 4569 〈cop 4573 × cxp 5588 ↾ cres 5592 ‘cfv 6432 ∘f cof 7525 · cmul 10877 ℕcn 11973 ndxcnx 16892 Basecbs 16910 +gcplusg 16960 Unitcui 19879 ℤ/nℤczn 20702 DChrcdchr 26378 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-rep 5214 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 ax-cnex 10928 ax-resscn 10929 ax-1cn 10930 ax-icn 10931 ax-addcl 10932 ax-addrcl 10933 ax-mulcl 10934 ax-mulrcl 10935 ax-mulcom 10936 ax-addass 10937 ax-mulass 10938 ax-distr 10939 ax-i2m1 10940 ax-1ne0 10941 ax-1rid 10942 ax-rnegex 10943 ax-rrecex 10944 ax-cnre 10945 ax-pre-lttri 10946 ax-pre-lttrn 10947 ax-pre-ltadd 10948 ax-pre-mulgt0 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-nel 3052 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6201 df-ord 6268 df-on 6269 df-lim 6270 df-suc 6271 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-riota 7228 df-ov 7274 df-oprab 7275 df-mpo 7276 df-of 7527 df-om 7707 df-1st 7824 df-2nd 7825 df-frecs 8088 df-wrecs 8119 df-recs 8193 df-rdg 8232 df-1o 8288 df-er 8481 df-en 8717 df-dom 8718 df-sdom 8719 df-fin 8720 df-pnf 11012 df-mnf 11013 df-xr 11014 df-ltxr 11015 df-le 11016 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-n0 12234 df-z 12320 df-uz 12582 df-fz 13239 df-struct 16846 df-slot 16881 df-ndx 16893 df-base 16911 df-plusg 16973 df-dchr 26379 |
This theorem is referenced by: dchrmul 26394 |
Copyright terms: Public domain | W3C validator |