| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ringadd2 | GIF version | ||
| Description: A ring element plus itself is two times the element. (Contributed by Steve Rodriguez, 9-Sep-2007.) (Revised by Mario Carneiro, 22-Dec-2013.) (Revised by AV, 24-Aug-2021.) |
| Ref | Expression |
|---|---|
| ringadd2.b | ⊢ 𝐵 = (Base‘𝑅) |
| ringadd2.p | ⊢ + = (+g‘𝑅) |
| ringadd2.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| ringadd2 | ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ∃𝑥 ∈ 𝐵 (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ringadd2.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | ringadd2.t | . . 3 ⊢ · = (.r‘𝑅) | |
| 3 | 1, 2 | ringid 14314 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ∃𝑥 ∈ 𝐵 ((𝑥 · 𝑋) = 𝑋 ∧ (𝑋 · 𝑥) = 𝑋)) |
| 4 | oveq12 6088 | . . . . . . 7 ⊢ (((𝑥 · 𝑋) = 𝑋 ∧ (𝑥 · 𝑋) = 𝑋) → ((𝑥 · 𝑋) + (𝑥 · 𝑋)) = (𝑋 + 𝑋)) | |
| 5 | 4 | anidms 401 | . . . . . 6 ⊢ ((𝑥 · 𝑋) = 𝑋 → ((𝑥 · 𝑋) + (𝑥 · 𝑋)) = (𝑋 + 𝑋)) |
| 6 | 5 | eqcomd 2244 | . . . . 5 ⊢ ((𝑥 · 𝑋) = 𝑋 → (𝑋 + 𝑋) = ((𝑥 · 𝑋) + (𝑥 · 𝑋))) |
| 7 | simpll 531 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑅 ∈ Ring) | |
| 8 | simpr 110 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 9 | simplr 533 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 10 | ringadd2.p | . . . . . . . 8 ⊢ + = (+g‘𝑅) | |
| 11 | 1, 10, 2 | ringdir 14307 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑥 + 𝑥) · 𝑋) = ((𝑥 · 𝑋) + (𝑥 · 𝑋))) |
| 12 | 7, 8, 8, 9, 11 | syl13anc 1280 | . . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 + 𝑥) · 𝑋) = ((𝑥 · 𝑋) + (𝑥 · 𝑋))) |
| 13 | 12 | eqeq2d 2250 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋) ↔ (𝑋 + 𝑋) = ((𝑥 · 𝑋) + (𝑥 · 𝑋)))) |
| 14 | 6, 13 | imbitrrid 156 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 · 𝑋) = 𝑋 → (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋))) |
| 15 | 14 | adantrd 279 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → (((𝑥 · 𝑋) = 𝑋 ∧ (𝑋 · 𝑥) = 𝑋) → (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋))) |
| 16 | 15 | reximdva 2652 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (∃𝑥 ∈ 𝐵 ((𝑥 · 𝑋) = 𝑋 ∧ (𝑋 · 𝑥) = 𝑋) → ∃𝑥 ∈ 𝐵 (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋))) |
| 17 | 3, 16 | mpd 13 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ∃𝑥 ∈ 𝐵 (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 ‘cfv 5375 (class class class)co 6079 Basecbs 13335 +gcplusg 13414 .rcmulr 13415 Ringcrg 14283 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-pre-ltirr 8285 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-pnf 8356 df-mnf 8357 df-ltxr 8359 df-inn 9288 df-2 9346 df-3 9347 df-ndx 13338 df-slot 13339 df-base 13341 df-sets 13342 df-plusg 13427 df-mulr 13428 df-0g 13595 df-mgm 13659 df-sgrp 13700 df-mnd 13713 df-mgp 14201 df-ur 14246 df-ring 14285 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |