Metamath Proof Explorer


Theorem zaddcomlem

Description: Lemma for zaddcom . (Contributed by SN, 1-Feb-2025)

Ref Expression
Assertion zaddcomlem ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → A + B = B + A

Proof

Step Hyp Ref Expression
1 simpr ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → B ∈ ℕ 0
2 1 nn0cnd ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → B ∈ ℂ
3 rernegcl ⊢ A ∈ ℝ → 0 - ℝ A ∈ ℝ
4 3 ad2antrr ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A ∈ ℝ
5 4 recnd ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A ∈ ℂ
6 simpll ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → A ∈ ℝ
7 6 recnd ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → A ∈ ℂ
8 2 5 7 addassd ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → B + 0 - ℝ A + A = B + 0 - ℝ A + A
9 renegid2 ⊢ A ∈ ℝ → 0 - ℝ A + A = 0
10 9 ad2antrr ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + A = 0
11 10 oveq2d ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → B + 0 - ℝ A + A = B + 0
12 nn0re ⊢ B ∈ ℕ 0 → B ∈ ℝ
13 readdrid ⊢ B ∈ ℝ → B + 0 = B
14 12 13 syl ⊢ B ∈ ℕ 0 → B + 0 = B
15 14 adantl ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → B + 0 = B
16 8 11 15 3eqtrrd ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → B = B + 0 - ℝ A + A
17 9 oveq1d ⊢ A ∈ ℝ → 0 - ℝ A + A + B = 0 + B
18 17 adantr ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ → 0 - ℝ A + A + B = 0 + B
19 readdlid ⊢ B ∈ ℝ → 0 + B = B
20 12 19 syl ⊢ B ∈ ℕ 0 → 0 + B = B
21 18 20 sylan9eq ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + A + B = B
22 nnnn0 ⊢ 0 - ℝ A ∈ ℕ → 0 - ℝ A ∈ ℕ 0
23 nn0addcom ⊢ 0 - ℝ A ∈ ℕ 0 ∧ B ∈ ℕ 0 → 0 - ℝ A + B = B + 0 - ℝ A
24 22 23 sylan ⊢ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + B = B + 0 - ℝ A
25 24 adantll ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + B = B + 0 - ℝ A
26 25 oveq1d ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + B + A = B + 0 - ℝ A + A
27 16 21 26 3eqtr4d ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + A + B = 0 - ℝ A + B + A
28 5 7 2 addassd ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + A + B = 0 - ℝ A + A + B
29 5 2 7 addassd ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + B + A = 0 - ℝ A + B + A
30 27 28 29 3eqtr3d ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + A + B = 0 - ℝ A + B + A
31 7 2 addcld ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → A + B ∈ ℂ
32 2 7 addcld ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → B + A ∈ ℂ
33 5 31 32 sn-addcand ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → 0 - ℝ A + A + B = 0 - ℝ A + B + A ↔ A + B = B + A
34 30 33 mpbid ⊢ A ∈ ℝ ∧ 0 - ℝ A ∈ ℕ ∧ B ∈ ℕ 0 → A + B = B + A