Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > readdid1addid2d | Structured version Visualization version GIF version |
Description: Given some real number 𝐵 where 𝐴 acts like a right additive identity, derive that 𝐴 is a left additive identity. Note that the hypothesis is weaker than proving that 𝐴 is a right additive identity (for all numbers). Although, if there is a right additive identity, then by readdcan 10807, 𝐴 is the right additive identity. (Contributed by Steven Nguyen, 14-Jan-2023.) |
Ref | Expression |
---|---|
readdid1addid2d.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
readdid1addid2d.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
readdid1addid2d.1 | ⊢ (𝜑 → (𝐵 + 𝐴) = 𝐵) |
Ref | Expression |
---|---|
readdid1addid2d | ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → (𝐴 + 𝐶) = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | readdid1addid2d.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
2 | 1 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℝ) |
3 | 2 | recnd 10662 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℂ) |
4 | readdid1addid2d.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
5 | 4 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℝ) |
6 | 5 | recnd 10662 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℂ) |
7 | simpr 487 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℝ) | |
8 | 7 | recnd 10662 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℂ) |
9 | 3, 6, 8 | addassd 10656 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → ((𝐵 + 𝐴) + 𝐶) = (𝐵 + (𝐴 + 𝐶))) |
10 | readdid1addid2d.1 | . . . . 5 ⊢ (𝜑 → (𝐵 + 𝐴) = 𝐵) | |
11 | 10 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → (𝐵 + 𝐴) = 𝐵) |
12 | 11 | oveq1d 7164 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → ((𝐵 + 𝐴) + 𝐶) = (𝐵 + 𝐶)) |
13 | 9, 12 | eqtr3d 2857 | . 2 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → (𝐵 + (𝐴 + 𝐶)) = (𝐵 + 𝐶)) |
14 | 5, 7 | readdcld 10663 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → (𝐴 + 𝐶) ∈ ℝ) |
15 | readdcan 10807 | . . 3 ⊢ (((𝐴 + 𝐶) ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐵 + (𝐴 + 𝐶)) = (𝐵 + 𝐶) ↔ (𝐴 + 𝐶) = 𝐶)) | |
16 | 14, 7, 2, 15 | syl3anc 1366 | . 2 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → ((𝐵 + (𝐴 + 𝐶)) = (𝐵 + 𝐶) ↔ (𝐴 + 𝐶) = 𝐶)) |
17 | 13, 16 | mpbid 234 | 1 ⊢ ((𝜑 ∧ 𝐶 ∈ ℝ) → (𝐴 + 𝐶) = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 (class class class)co 7149 ℝcr 10529 + caddc 10533 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 ax-resscn 10587 ax-addrcl 10591 ax-addass 10595 ax-pre-lttri 10604 ax-pre-lttrn 10605 ax-pre-ltadd 10606 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-rab 3146 df-v 3493 df-sbc 3769 df-csb 3877 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-nul 4285 df-if 4461 df-pw 4534 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5453 df-po 5467 df-so 5468 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-ov 7152 df-er 8282 df-en 8503 df-dom 8504 df-sdom 8505 df-pnf 10670 df-mnf 10671 df-ltxr 10673 |
This theorem is referenced by: reneg0addid2 39281 |
Copyright terms: Public domain | W3C validator |