| 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 21570 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 12595 | . . 3 ⊢ ℤ ∈ V | |
| 2 | addex 13008 | . . 3 ⊢ + ∈ V | |
| 3 | zaddablx.g | . . 3 ⊢ 𝐺 = {〈1, ℤ〉, 〈2, + 〉} | |
| 4 | zaddcl 12629 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) ∈ ℤ) | |
| 5 | zcn 12591 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 6 | zcn 12591 | . . . 4 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
| 7 | zcn 12591 | . . . 4 ⊢ (𝑧 ∈ ℤ → 𝑧 ∈ ℂ) | |
| 8 | addass 11182 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 9 | 5, 6, 7, 8 | syl3an 1178 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝑧 ∈ ℤ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 10 | 0z 12597 | . . 3 ⊢ 0 ∈ ℤ | |
| 11 | 5 | addlidd 11406 | . . 3 ⊢ (𝑥 ∈ ℤ → (0 + 𝑥) = 𝑥) |
| 12 | znegcl 12624 | . . 3 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
| 13 | zcn 12591 | . . . . . 6 ⊢ (-𝑥 ∈ ℤ → -𝑥 ∈ ℂ) | |
| 14 | addcom 11391 | . . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) | |
| 15 | 5, 13, 14 | syl2an 607 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ -𝑥 ∈ ℤ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
| 16 | 12, 15 | mpdan 699 | . . . 4 ⊢ (𝑥 ∈ ℤ → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
| 17 | 5 | negidd 11554 | . . . 4 ⊢ (𝑥 ∈ ℤ → (𝑥 + -𝑥) = 0) |
| 18 | 16, 17 | eqtr3d 2800 | . . 3 ⊢ (𝑥 ∈ ℤ → (-𝑥 + 𝑥) = 0) |
| 19 | 1, 2, 3, 4, 9, 10, 11, 12, 18 | isgrpix 19026 | . 2 ⊢ 𝐺 ∈ Grp |
| 20 | 1, 2, 3 | grpbasex 17340 | . 2 ⊢ ℤ = (Base‘𝐺) |
| 21 | 1, 2, 3 | grpplusgx 17341 | . 2 ⊢ + = (+g‘𝐺) |
| 22 | addcom 11391 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
| 23 | 5, 6, 22 | syl2an 607 | . 2 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) |
| 24 | 19, 20, 21, 23 | isabli 19861 | 1 ⊢ 𝐺 ∈ Abel |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 {cpr 4591 〈cop 4595 (class class class)co 7410 ℂcc 11093 0cc0 11095 1c1 11096 + caddc 11098 -cneg 11437 2c2 12290 ℤcz 12586 Abelcabl 19846 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-addf 11174 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-2 12298 df-n0 12500 df-z 12587 df-uz 12858 df-fz 13531 df-struct 17202 df-slot 17237 df-ndx 17249 df-base 17265 df-plusg 17318 df-0g 17489 df-mgm 18693 df-sgrp 18772 df-mnd 18788 df-grp 18998 df-cmn 19847 df-abl 19848 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |