| 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 21735 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 12709 | . . 3 ⊢ ℤ ∈ V | |
| 2 | addex 13124 | . . 3 ⊢ + ∈ V | |
| 3 | zaddablx.g | . . 3 ⊢ 𝐺 = {〈1, ℤ〉, 〈2, + 〉} | |
| 4 | zaddcl 12743 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) ∈ ℤ) | |
| 5 | zcn 12705 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 6 | zcn 12705 | . . . 4 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
| 7 | zcn 12705 | . . . 4 ⊢ (𝑧 ∈ ℤ → 𝑧 ∈ ℂ) | |
| 8 | addass 11294 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 9 | 5, 6, 7, 8 | syl3an 1178 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝑧 ∈ ℤ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 10 | 0z 12711 | . . 3 ⊢ 0 ∈ ℤ | |
| 11 | 5 | addlidd 11518 | . . 3 ⊢ (𝑥 ∈ ℤ → (0 + 𝑥) = 𝑥) |
| 12 | znegcl 12738 | . . 3 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
| 13 | zcn 12705 | . . . . . 6 ⊢ ( -𝑥 ∈ ℤ → -𝑥 ∈ ℂ) | |
| 14 | addcom 11503 | . . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = ( -𝑥 + 𝑥)) | |
| 15 | 5, 13, 14 | syl2an 608 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ -𝑥 ∈ ℤ) → (𝑥 + -𝑥) = ( -𝑥 + 𝑥)) |
| 16 | 12, 15 | mpdan 700 | . . . 4 ⊢ (𝑥 ∈ ℤ → (𝑥 + -𝑥) = ( -𝑥 + 𝑥)) |
| 17 | 5 | negidd 11666 | . . . 4 ⊢ (𝑥 ∈ ℤ → (𝑥 + -𝑥) = 0) |
| 18 | 16, 17 | eqtr3d 2797 | . . 3 ⊢ (𝑥 ∈ ℤ → ( -𝑥 + 𝑥) = 0) |
| 19 | 1, 2, 3, 4, 9, 10, 11, 12, 18 | isgrpix 19184 | . 2 ⊢ 𝐺 ∈ Grp |
| 20 | 1, 2, 3 | grpbasex 17472 | . 2 ⊢ ℤ = (Base‘𝐺) |
| 21 | 1, 2, 3 | grpplusgx 17473 | . 2 ⊢ + = (+g‘𝐺) |
| 22 | addcom 11503 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
| 23 | 5, 6, 22 | syl2an 608 | . 2 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) |
| 24 | 19, 20, 21, 23 | isabli 20019 | 1 ⊢ 𝐺 ∈ Abel |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 {cpr 4586 〈cop 4834 (class class class)co 7424 ℂcc 11205 0cc0 11207 1c1 11208 + caddc 11210 -cneg 11549 2c2 12404 ℤcz 12700 Abelcabl 20004 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-addf 11286 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 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 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-1o 8483 df-er 8724 df-en 8981 df-dom 8982 df-sdom 8983 df-fin 8984 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-n0 12614 df-z 12701 df-uz 12973 df-fz 13647 df-struct 17334 df-slot 17369 df-ndx 17381 df-base 17397 df-plusg 17450 df-0g 17621 df-mgm 18825 df-sgrp 18917 df-mnd 18933 df-grp 19156 df-cmn 20005 df-abl 20006 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |