| 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 21633 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 12624 | . . 3 ⊢ ℤ ∈ V | |
| 2 | addex 13039 | . . 3 ⊢ + ∈ V | |
| 3 | zaddablx.g | . . 3 ⊢ 𝐺 = {〈1, ℤ〉, 〈2, + 〉} | |
| 4 | zaddcl 12658 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) ∈ ℤ) | |
| 5 | zcn 12620 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 6 | zcn 12620 | . . . 4 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
| 7 | zcn 12620 | . . . 4 ⊢ (𝑧 ∈ ℤ → 𝑧 ∈ ℂ) | |
| 8 | addass 11211 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
| 9 | 5, 6, 7, 8 | syl3an 1178 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝑧 ∈ ℤ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 10 | 0z 12626 | . . 3 ⊢ 0 ∈ ℤ | |
| 11 | 5 | addlidd 11435 | . . 3 ⊢ (𝑥 ∈ ℤ → (0 + 𝑥) = 𝑥) |
| 12 | znegcl 12653 | . . 3 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
| 13 | zcn 12620 | . . . . . 6 ⊢ (-𝑥 ∈ ℤ → -𝑥 ∈ ℂ) | |
| 14 | addcom 11420 | . . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ -𝑥 ∈ ℂ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) | |
| 15 | 5, 13, 14 | syl2an 608 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ -𝑥 ∈ ℤ) → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
| 16 | 12, 15 | mpdan 700 | . . . 4 ⊢ (𝑥 ∈ ℤ → (𝑥 + -𝑥) = (-𝑥 + 𝑥)) |
| 17 | 5 | negidd 11583 | . . . 4 ⊢ (𝑥 ∈ ℤ → (𝑥 + -𝑥) = 0) |
| 18 | 16, 17 | eqtr3d 2797 | . . 3 ⊢ (𝑥 ∈ ℤ → (-𝑥 + 𝑥) = 0) |
| 19 | 1, 2, 3, 4, 9, 10, 11, 12, 18 | isgrpix 19088 | . 2 ⊢ 𝐺 ∈ Grp |
| 20 | 1, 2, 3 | grpbasex 17377 | . 2 ⊢ ℤ = (Base‘𝐺) |
| 21 | 1, 2, 3 | grpplusgx 17378 | . 2 ⊢ + = (+g‘𝐺) |
| 22 | addcom 11420 | . . 3 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) | |
| 23 | 5, 6, 22 | syl2an 608 | . 2 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 + 𝑦) = (𝑦 + 𝑥)) |
| 24 | 19, 20, 21, 23 | isabli 19923 | 1 ⊢ 𝐺 ∈ Abel |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 {cpr 4586 〈cop 4590 (class class class)co 7413 ℂcc 11122 0cc0 11124 1c1 11125 + caddc 11127 -cneg 11466 2c2 12319 ℤcz 12615 Abelcabl 19908 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-addf 11203 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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 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-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-n0 12529 df-z 12616 df-uz 12888 df-fz 13562 df-struct 17239 df-slot 17274 df-ndx 17286 df-base 17302 df-plusg 17355 df-0g 17526 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-grp 19060 df-cmn 19909 df-abl 19910 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |