| 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 14045 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ∃𝑥 ∈ 𝐵 ((𝑥 · 𝑋) = 𝑋 ∧ (𝑋 · 𝑥) = 𝑋)) |
| 4 | oveq12 6027 | . . . . . . 7 ⊢ (((𝑥 · 𝑋) = 𝑋 ∧ (𝑥 · 𝑋) = 𝑋) → ((𝑥 · 𝑋) + (𝑥 · 𝑋)) = (𝑋 + 𝑋)) | |
| 5 | 4 | anidms 397 | . . . . . 6 ⊢ ((𝑥 · 𝑋) = 𝑋 → ((𝑥 · 𝑋) + (𝑥 · 𝑋)) = (𝑋 + 𝑋)) |
| 6 | 5 | eqcomd 2237 | . . . . 5 ⊢ ((𝑥 · 𝑋) = 𝑋 → (𝑋 + 𝑋) = ((𝑥 · 𝑋) + (𝑥 · 𝑋))) |
| 7 | simpll 527 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑅 ∈ Ring) | |
| 8 | simpr 110 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 9 | simplr 529 | . . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 10 | ringadd2.p | . . . . . . . 8 ⊢ + = (+g‘𝑅) | |
| 11 | 1, 10, 2 | ringdir 14038 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑥 + 𝑥) · 𝑋) = ((𝑥 · 𝑋) + (𝑥 · 𝑋))) |
| 12 | 7, 8, 8, 9, 11 | syl13anc 1275 | . . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 + 𝑥) · 𝑋) = ((𝑥 · 𝑋) + (𝑥 · 𝑋))) |
| 13 | 12 | eqeq2d 2243 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋) ↔ (𝑋 + 𝑋) = ((𝑥 · 𝑋) + (𝑥 · 𝑋)))) |
| 14 | 6, 13 | imbitrrid 156 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 · 𝑋) = 𝑋 → (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋))) |
| 15 | 14 | adantrd 279 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → (((𝑥 · 𝑋) = 𝑋 ∧ (𝑋 · 𝑥) = 𝑋) → (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋))) |
| 16 | 15 | reximdva 2634 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (∃𝑥 ∈ 𝐵 ((𝑥 · 𝑋) = 𝑋 ∧ (𝑋 · 𝑥) = 𝑋) → ∃𝑥 ∈ 𝐵 (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋))) |
| 17 | 3, 16 | mpd 13 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ∃𝑥 ∈ 𝐵 (𝑋 + 𝑋) = ((𝑥 + 𝑥) · 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ∃wrex 2511 ‘cfv 5326 (class class class)co 6018 Basecbs 13087 +gcplusg 13165 .rcmulr 13166 Ringcrg 14015 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-pre-ltirr 8144 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-ltxr 8219 df-inn 9144 df-2 9202 df-3 9203 df-ndx 13090 df-slot 13091 df-base 13093 df-sets 13094 df-plusg 13178 df-mulr 13179 df-0g 13346 df-mgm 13444 df-sgrp 13490 df-mnd 13505 df-mgp 13940 df-ur 13979 df-ring 14017 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |