Metamath Proof Explorer


Theorem xmulcom

Description: Extended real multiplication is commutative. (Contributed by Mario Carneiro, 20-Aug-2015)

Ref Expression
Assertion xmulcom ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A ⋅ 𝑒 B = B ⋅ 𝑒 A

Proof

Step Hyp Ref Expression
1 xmullem ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∧ ¬ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ → A ∈ ℝ
2 1 recnd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∧ ¬ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ → A ∈ ℂ
3 ancom ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ↔ B ∈ ℝ * ∧ A ∈ ℝ *
4 orcom ⊢ A = 0 ∨ B = 0 ↔ B = 0 ∨ A = 0
5 4 notbii ⊢ ¬ A = 0 ∨ B = 0 ↔ ¬ B = 0 ∨ A = 0
6 3 5 anbi12i ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ↔ B ∈ ℝ * ∧ A ∈ ℝ * ∧ ¬ B = 0 ∨ A = 0
7 orcom ⊢ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ↔ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞
8 7 notbii ⊢ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ↔ ¬ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞
9 6 8 anbi12i ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ↔ B ∈ ℝ * ∧ A ∈ ℝ * ∧ ¬ B = 0 ∨ A = 0 ∧ ¬ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞
10 orcom ⊢ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ↔ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞
11 10 notbii ⊢ ¬ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ↔ ¬ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞
12 xmullem ⊢ B ∈ ℝ * ∧ A ∈ ℝ * ∧ ¬ B = 0 ∨ A = 0 ∧ ¬ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∧ ¬ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ → B ∈ ℝ
13 9 11 12 syl2anb ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∧ ¬ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ → B ∈ ℝ
14 13 recnd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∧ ¬ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ → B ∈ ℂ
15 2 14 mulcomd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∧ ¬ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ → A ⁢ B = B ⁢ A
16 15 ifeq2da ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ → if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ A ⁢ B = if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ B ⁢ A
17 10 a1i ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ → 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ↔ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞
18 17 ifbid ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ → if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ B ⁢ A = if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
19 16 18 eqtrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 ∧ ¬ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ → if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ A ⁢ B = if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
20 19 ifeq2da ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 → if 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ +∞ if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ A ⁢ B = if 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
21 7 a1i ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 → 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ↔ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞
22 21 ifbid ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 → if 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A = if 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
23 20 22 eqtrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ ¬ A = 0 ∨ B = 0 → if 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ +∞ if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ A ⁢ B = if 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
24 23 ifeq2da ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → if A = 0 ∨ B = 0 0 if 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ +∞ if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ A ⁢ B = if A = 0 ∨ B = 0 0 if 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
25 4 a1i ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A = 0 ∨ B = 0 ↔ B = 0 ∨ A = 0
26 25 ifbid ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → if A = 0 ∨ B = 0 0 if 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A = if B = 0 ∨ A = 0 0 if 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
27 24 26 eqtrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → if A = 0 ∨ B = 0 0 if 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ +∞ if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ A ⁢ B = if B = 0 ∨ A = 0 0 if 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
28 xmulval ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A ⋅ 𝑒 B = if A = 0 ∨ B = 0 0 if 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ ∨ 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ +∞ if 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ ∨ 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ −∞ A ⁢ B
29 xmulval ⊢ B ∈ ℝ * ∧ A ∈ ℝ * → B ⋅ 𝑒 A = if B = 0 ∨ A = 0 0 if 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
30 29 ancoms ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → B ⋅ 𝑒 A = if B = 0 ∨ A = 0 0 if 0 < A ∧ B = +∞ ∨ A < 0 ∧ B = −∞ ∨ 0 < B ∧ A = +∞ ∨ B < 0 ∧ A = −∞ +∞ if 0 < A ∧ B = −∞ ∨ A < 0 ∧ B = +∞ ∨ 0 < B ∧ A = −∞ ∨ B < 0 ∧ A = +∞ −∞ B ⁢ A
31 27 28 30 3eqtr4d ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A ⋅ 𝑒 B = B ⋅ 𝑒 A