xaddcom - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > xaddcom		GIF version

Theorem xaddcom 9848

Description: The extended real addition operation is commutative. (Contributed by NM, 26-Dec-2011.)

**Assertion**
Ref	Expression
xaddcom	⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))

**Proof of Theorem xaddcom**
Step	Hyp	Ref	Expression
1		elxr 9763	. 2 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		elxr 9763	. . . 4 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3		recn 7935	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ)
4		recn 7935	. . . . . . 7 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ)
5		addcom 8084	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴))
6	3, 4, 5	syl2an 289	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) = (𝐵 + 𝐴))
7		rexadd 9839	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +_𝑒 𝐵) = (𝐴 + 𝐵))
8		rexadd 9839	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 +_𝑒 𝐴) = (𝐵 + 𝐴))
9	8	ancoms 268	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐵 +_𝑒 𝐴) = (𝐵 + 𝐴))
10	6, 7, 9	3eqtr4d 2220	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
11		oveq2 5877	. . . . . . 7 ⊢ (𝐵 = +∞ → (𝐴 +_𝑒 𝐵) = (𝐴 +_𝑒 +∞))
12		rexr 7993	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
13		renemnf 7996	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞)
14		xaddpnf1 9833	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ -∞) → (𝐴 +_𝑒 +∞) = +∞)
15	12, 13, 14	syl2anc 411	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +_𝑒 +∞) = +∞)
16	11, 15	sylan9eqr 2232	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 +_𝑒 𝐵) = +∞)
17		oveq1 5876	. . . . . . 7 ⊢ (𝐵 = +∞ → (𝐵 +_𝑒 𝐴) = (+∞ +_𝑒 𝐴))
18		xaddpnf2 9834	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ -∞) → (+∞ +_𝑒 𝐴) = +∞)
19	12, 13, 18	syl2anc 411	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → (+∞ +_𝑒 𝐴) = +∞)
20	17, 19	sylan9eqr 2232	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐵 +_𝑒 𝐴) = +∞)
21	16, 20	eqtr4d 2213	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
22		oveq2 5877	. . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 +_𝑒 𝐵) = (𝐴 +_𝑒 -∞))
23		renepnf 7995	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
24		xaddmnf1 9835	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ +∞) → (𝐴 +_𝑒 -∞) = -∞)
25	12, 23, 24	syl2anc 411	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +_𝑒 -∞) = -∞)
26	22, 25	sylan9eqr 2232	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +_𝑒 𝐵) = -∞)
27		oveq1 5876	. . . . . . 7 ⊢ (𝐵 = -∞ → (𝐵 +_𝑒 𝐴) = (-∞ +_𝑒 𝐴))
28		xaddmnf2 9836	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ +∞) → (-∞ +_𝑒 𝐴) = -∞)
29	12, 23, 28	syl2anc 411	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → (-∞ +_𝑒 𝐴) = -∞)
30	27, 29	sylan9eqr 2232	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐵 +_𝑒 𝐴) = -∞)
31	26, 30	eqtr4d 2213	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
32	10, 21, 31	3jaodan 1306	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
33	2, 32	sylan2b 287	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
34		pnfaddmnf 9837	. . . . . . . 8 ⊢ (+∞ +_𝑒 -∞) = 0
35		mnfaddpnf 9838	. . . . . . . 8 ⊢ (-∞ +_𝑒 +∞) = 0
36	34, 35	eqtr4i 2201	. . . . . . 7 ⊢ (+∞ +_𝑒 -∞) = (-∞ +_𝑒 +∞)
37		simpr 110	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 = -∞) → 𝐵 = -∞)
38	37	oveq2d 5885	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 = -∞) → (+∞ +_𝑒 𝐵) = (+∞ +_𝑒 -∞))
39	37	oveq1d 5884	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 = -∞) → (𝐵 +_𝑒 +∞) = (-∞ +_𝑒 +∞))
40	36, 38, 39	3eqtr4a 2236	. . . . . 6 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 = -∞) → (+∞ +_𝑒 𝐵) = (𝐵 +_𝑒 +∞))
41		xaddpnf2 9834	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ -∞) → (+∞ +_𝑒 𝐵) = +∞)
42		xaddpnf1 9833	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ -∞) → (𝐵 +_𝑒 +∞) = +∞)
43	41, 42	eqtr4d 2213	. . . . . 6 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ -∞) → (+∞ +_𝑒 𝐵) = (𝐵 +_𝑒 +∞))
44		xrmnfdc 9830	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ^* → DECID 𝐵 = -∞)
45		exmiddc 836	. . . . . . . 8 ⊢ (DECID 𝐵 = -∞ → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
46	44, 45	syl 14	. . . . . . 7 ⊢ (𝐵 ∈ ℝ^* → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
47		df-ne 2348	. . . . . . . 8 ⊢ (𝐵 ≠ -∞ ↔ ¬ 𝐵 = -∞)
48	47	orbi2i 762	. . . . . . 7 ⊢ ((𝐵 = -∞ ∨ 𝐵 ≠ -∞) ↔ (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
49	46, 48	sylibr 134	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → (𝐵 = -∞ ∨ 𝐵 ≠ -∞))
50	40, 43, 49	mpjaodan 798	. . . . 5 ⊢ (𝐵 ∈ ℝ^* → (+∞ +_𝑒 𝐵) = (𝐵 +_𝑒 +∞))
51	50	adantl 277	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (+∞ +_𝑒 𝐵) = (𝐵 +_𝑒 +∞))
52		simpl 109	. . . . 5 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → 𝐴 = +∞)
53	52	oveq1d 5884	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (+∞ +_𝑒 𝐵))
54	52	oveq2d 5885	. . . 4 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐵 +_𝑒 𝐴) = (𝐵 +_𝑒 +∞))
55	51, 53, 54	3eqtr4d 2220	. . 3 ⊢ ((𝐴 = +∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
56	35, 34	eqtr4i 2201	. . . . . . 7 ⊢ (-∞ +_𝑒 +∞) = (+∞ +_𝑒 -∞)
57		simpr 110	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 = +∞) → 𝐵 = +∞)
58	57	oveq2d 5885	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 = +∞) → (-∞ +_𝑒 𝐵) = (-∞ +_𝑒 +∞))
59	57	oveq1d 5884	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 = +∞) → (𝐵 +_𝑒 -∞) = (+∞ +_𝑒 -∞))
60	56, 58, 59	3eqtr4a 2236	. . . . . 6 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 = +∞) → (-∞ +_𝑒 𝐵) = (𝐵 +_𝑒 -∞))
61		xaddmnf2 9836	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ +∞) → (-∞ +_𝑒 𝐵) = -∞)
62		xaddmnf1 9835	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ +∞) → (𝐵 +_𝑒 -∞) = -∞)
63	61, 62	eqtr4d 2213	. . . . . 6 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ +∞) → (-∞ +_𝑒 𝐵) = (𝐵 +_𝑒 -∞))
64		xrpnfdc 9829	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ^* → DECID 𝐵 = +∞)
65		exmiddc 836	. . . . . . . 8 ⊢ (DECID 𝐵 = +∞ → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
66	64, 65	syl 14	. . . . . . 7 ⊢ (𝐵 ∈ ℝ^* → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
67		df-ne 2348	. . . . . . . 8 ⊢ (𝐵 ≠ +∞ ↔ ¬ 𝐵 = +∞)
68	67	orbi2i 762	. . . . . . 7 ⊢ ((𝐵 = +∞ ∨ 𝐵 ≠ +∞) ↔ (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
69	66, 68	sylibr 134	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → (𝐵 = +∞ ∨ 𝐵 ≠ +∞))
70	60, 63, 69	mpjaodan 798	. . . . 5 ⊢ (𝐵 ∈ ℝ^* → (-∞ +_𝑒 𝐵) = (𝐵 +_𝑒 -∞))
71	70	adantl 277	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) → (-∞ +_𝑒 𝐵) = (𝐵 +_𝑒 -∞))
72		simpl 109	. . . . 5 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) → 𝐴 = -∞)
73	72	oveq1d 5884	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (-∞ +_𝑒 𝐵))
74	72	oveq2d 5885	. . . 4 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) → (𝐵 +_𝑒 𝐴) = (𝐵 +_𝑒 -∞))
75	71, 73, 74	3eqtr4d 2220	. . 3 ⊢ ((𝐴 = -∞ ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
76	33, 55, 75	3jaoian 1305	. 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))
77	1, 76	sylanb 284	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 +_𝑒 𝐵) = (𝐵 +_𝑒 𝐴))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 708 DECID wdc 834 ∨ w3o 977 = wceq 1353 ∈ wcel 2148 ≠ wne 2347 (class class class)co 5869 ℂcc 7800 ℝcr 7801 0cc0 7802 + caddc 7805 +∞cpnf 7979 -∞cmnf 7980 ℝ^*cxr 7981 +_𝑒 cxad 9757

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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-pow 4171 ax-pr 4206 ax-un 4430 ax-setind 4533 ax-cnex 7893 ax-resscn 7894 ax-1re 7896 ax-addrcl 7899 ax-addcom 7902 ax-rnegex 7911

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-rab 2464 df-v 2739 df-sbc 2963 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-if 3535 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-br 4001 df-opab 4062 df-id 4290 df-xp 4629 df-rel 4630 df-cnv 4631 df-co 4632 df-dm 4633 df-iota 5174 df-fun 5214 df-fv 5220 df-ov 5872 df-oprab 5873 df-mpo 5874 df-pnf 7984 df-mnf 7985 df-xr 7986 df-xadd 9760

This theorem is referenced by: xaddid2 9850 xleadd2a 9861 xltadd2 9864 xadd4d 9872 xrmaxaddlem 11252

W3C validator