Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > zaddablx | Structured version Visualization version GIF version |
Description: The integers are an Abelian group under addition. Note: This theorem has hard-coded structure indices for demonstration purposes. It is not intended for general use. Use zsubrg 20563 instead. (New usage is discouraged.) (Contributed by NM, 4-Sep-2011.) |
Ref | Expression |
---|---|
zaddablx.g | ⊢ 𝐺 = {〈1, ℤ〉, 〈2, + 〉} |
Ref | Expression |
---|---|
zaddablx | ⊢ 𝐺 ∈ Abel |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zex 12258 | . . 3 ⊢ ℤ ∈ V | |
2 | addex 12657 | . . 3 ⊢ + ∈ V | |
3 | zaddablx.g | . . 3 ⊢ 𝐺 = {〈1, ℤ〉, 〈2, + 〉} | |
4 | zaddcl 12290 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) ∈ ℤ) | |
5 | zcn 12254 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
6 | zcn 12254 | . . . 4 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
7 | zcn 12254 | . . . 4 ⊢ (𝑧 ∈ ℤ → 𝑧 ∈ ℂ) | |
8 | addass 10889 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
9 | 5, 6, 7, 8 | syl3an 1158 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝑧 ∈ ℤ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
10 | 0z 12260 | . . 3 ⊢ 0 ∈ ℤ | |
11 | 5 | addid2d 11106 | . . 3 ⊢ (𝑥 ∈ ℤ → (0 + 𝑥) = 𝑥) |
12 | znegcl 12285 | . . 3 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
13 | zcn 12254 | . . . . . 6 ⊢ (-𝑥 ∈ ℤ → -𝑥 ∈ ℂ) | |
14 | addcom 11091 | . . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) | |
15 | 5, 13, 14 | syl2an 595 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ -𝑥 ∈ ℤ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
16 | 12, 15 | mpdan 683 | . . . 4 ⊢ (𝑥 ∈ ℤ → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
17 | 5 | negidd 11252 | . . . 4 ⊢ (𝑥 ∈ ℤ → (𝑥 + -𝑥) = 0) |
18 | 16, 17 | eqtr3d 2780 | . . 3 ⊢ (𝑥 ∈ ℤ → (-𝑥 + 𝑥) = 0) |
19 | 1, 2, 3, 4, 9, 10, 11, 12, 18 | isgrpix 18521 | . 2 ⊢ 𝐺 ∈ Grp |
20 | 1, 2, 3 | grpbasex 16927 | . 2 ⊢ ℤ = (Base‘𝐺) |
21 | 1, 2, 3 | grpplusgx 16928 | . 2 ⊢ + = (+g‘𝐺) |
22 | addcom 11091 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
23 | 5, 6, 22 | syl2an 595 | . 2 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) |
24 | 19, 20, 21, 23 | isabli 19316 | 1 ⊢ 𝐺 ∈ Abel |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∈ wcel 2108 {cpr 4560 〈cop 4564 (class class class)co 7255 ℂcc 10800 0cc0 10802 1c1 10803 + caddc 10805 -cneg 11136 2c2 11958 ℤcz 12249 Abelcabl 19302 |
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-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 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 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-uni 4837 df-iun 4923 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-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-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-n0 12164 df-z 12250 df-uz 12512 df-fz 13169 df-struct 16776 df-slot 16811 df-ndx 16823 df-base 16841 df-plusg 16901 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-cmn 19303 df-abl 19304 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |