Theorem xrmaxiflemcom 11241

Description: Lemma for xrmaxif 11243. Commutativity of an expression which we will later show to be the supremum. (Contributed by Jim Kingdon, 29-Apr-2023.)

Assertion

Ref	Expression
xrmaxiflemcom	⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))

Proof of Theorem xrmaxiflemcom

Step	Hyp	Ref	Expression
1		simpr 110	. . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → 𝐵 = +∞)
2	1	iftrued 3541	. . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = +∞)
3		xrpnfdc 9829	. . . . . . 7 ⊢ (𝐴 ∈ ℝ* → DECID 𝐴 = +∞)
4	3	ad2antrr 488	. . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → DECID 𝐴 = +∞)
5		exmiddc 836	. . . . . 6 ⊢ (DECID 𝐴 = +∞ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
6	4, 5	syl 14	. . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
7		eqid 2177	. . . . . . . 8 ⊢ +∞ = +∞
8	7	biantru 302	. . . . . . 7 ⊢ (𝐴 = +∞ ↔ (𝐴 = +∞ ∧ +∞ = +∞))
9	8	a1i 9	. . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → (𝐴 = +∞ ↔ (𝐴 = +∞ ∧ +∞ = +∞)))
10		xrmnfdc 9830	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ* → DECID 𝐴 = -∞)
11	10	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → DECID 𝐴 = -∞)
12		exmiddc 836	. . . . . . . . . 10 ⊢ (DECID 𝐴 = -∞ → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
13	11, 12	syl 14	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
14		iba 300	. . . . . . . . . . . 12 ⊢ (+∞ = 𝐵 → (𝐴 = -∞ ↔ (𝐴 = -∞ ∧ +∞ = 𝐵)))
15	14	eqcoms 2180	. . . . . . . . . . 11 ⊢ (𝐵 = +∞ → (𝐴 = -∞ ↔ (𝐴 = -∞ ∧ +∞ = 𝐵)))
16	15	adantl 277	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → (𝐴 = -∞ ↔ (𝐴 = -∞ ∧ +∞ = 𝐵)))
17	1	iftrued 3541	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))) = +∞)
18	17	eqcomd 2183	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → +∞ = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))
19	18	biantrud 304	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → (¬ 𝐴 = -∞ ↔ (¬ 𝐴 = -∞ ∧ +∞ = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))
20	16, 19	orbi12d 793	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → ((𝐴 = -∞ ∨ ¬ 𝐴 = -∞) ↔ ((𝐴 = -∞ ∧ +∞ = 𝐵) ∨ (¬ 𝐴 = -∞ ∧ +∞ = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))))
21	13, 20	mpbid 147	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → ((𝐴 = -∞ ∧ +∞ = 𝐵) ∨ (¬ 𝐴 = -∞ ∧ +∞ = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))
22		eqifdc 3568	. . . . . . . . 9 ⊢ (DECID 𝐴 = -∞ → (+∞ = if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))) ↔ ((𝐴 = -∞ ∧ +∞ = 𝐵) ∨ (¬ 𝐴 = -∞ ∧ +∞ = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))))
23	11, 22	syl 14	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → (+∞ = if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))) ↔ ((𝐴 = -∞ ∧ +∞ = 𝐵) ∨ (¬ 𝐴 = -∞ ∧ +∞ = if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))))
24	21, 23	mpbird 167	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → +∞ = if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))
25	24	biantrud 304	. . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → (¬ 𝐴 = +∞ ↔ (¬ 𝐴 = +∞ ∧ +∞ = if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))))
26	9, 25	orbi12d 793	. . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → ((𝐴 = +∞ ∨ ¬ 𝐴 = +∞) ↔ ((𝐴 = +∞ ∧ +∞ = +∞) ∨ (¬ 𝐴 = +∞ ∧ +∞ = if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))))
27	6, 26	mpbid 147	. . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → ((𝐴 = +∞ ∧ +∞ = +∞) ∨ (¬ 𝐴 = +∞ ∧ +∞ = if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))))
28		eqifdc 3568	. . . . 5 ⊢ (DECID 𝐴 = +∞ → (+∞ = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))) ↔ ((𝐴 = +∞ ∧ +∞ = +∞) ∨ (¬ 𝐴 = +∞ ∧ +∞ = if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))))
29	4, 28	syl 14	. . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → (+∞ = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))) ↔ ((𝐴 = +∞ ∧ +∞ = +∞) ∨ (¬ 𝐴 = +∞ ∧ +∞ = if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))))
30	27, 29	mpbird 167	. . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → +∞ = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))
31	2, 30	eqtrd 2210	. 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))
32	3, 5	syl 14	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ* → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
33	32	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
34		pm4.24 395	. . . . . . . . 9 ⊢ (𝐴 = +∞ ↔ (𝐴 = +∞ ∧ 𝐴 = +∞))
35	34	a1i 9	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (𝐴 = +∞ ↔ (𝐴 = +∞ ∧ 𝐴 = +∞)))
36	10	ad3antrrr 492	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → DECID 𝐴 = -∞)
37	36, 12	syl 14	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
38		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐵 = -∞)
39	38	eqeq2d 2189	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (𝐴 = 𝐵 ↔ 𝐴 = -∞))
40	39	anbi2d 464	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → ((𝐴 = -∞ ∧ 𝐴 = 𝐵) ↔ (𝐴 = -∞ ∧ 𝐴 = -∞)))
41		anidm 396	. . . . . . . . . . . . 13 ⊢ ((𝐴 = -∞ ∧ 𝐴 = -∞) ↔ 𝐴 = -∞)
42	40, 41	bitr2di 197	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (𝐴 = -∞ ↔ (𝐴 = -∞ ∧ 𝐴 = 𝐵)))
43		eqid 2177	. . . . . . . . . . . . . 14 ⊢ 𝐴 = 𝐴
44	43	biantru 302	. . . . . . . . . . . . 13 ⊢ (¬ 𝐴 = -∞ ↔ (¬ 𝐴 = -∞ ∧ 𝐴 = 𝐴))
45	44	a1i 9	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (¬ 𝐴 = -∞ ↔ (¬ 𝐴 = -∞ ∧ 𝐴 = 𝐴)))
46	42, 45	orbi12d 793	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → ((𝐴 = -∞ ∨ ¬ 𝐴 = -∞) ↔ ((𝐴 = -∞ ∧ 𝐴 = 𝐵) ∨ (¬ 𝐴 = -∞ ∧ 𝐴 = 𝐴))))
47	37, 46	mpbid 147	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → ((𝐴 = -∞ ∧ 𝐴 = 𝐵) ∨ (¬ 𝐴 = -∞ ∧ 𝐴 = 𝐴)))
48		eqifdc 3568	. . . . . . . . . . 11 ⊢ (DECID 𝐴 = -∞ → (𝐴 = if(𝐴 = -∞, 𝐵, 𝐴) ↔ ((𝐴 = -∞ ∧ 𝐴 = 𝐵) ∨ (¬ 𝐴 = -∞ ∧ 𝐴 = 𝐴))))
49	36, 48	syl 14	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (𝐴 = if(𝐴 = -∞, 𝐵, 𝐴) ↔ ((𝐴 = -∞ ∧ 𝐴 = 𝐵) ∨ (¬ 𝐴 = -∞ ∧ 𝐴 = 𝐴))))
50	47, 49	mpbird 167	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 = if(𝐴 = -∞, 𝐵, 𝐴))
51	50	biantrud 304	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (¬ 𝐴 = +∞ ↔ (¬ 𝐴 = +∞ ∧ 𝐴 = if(𝐴 = -∞, 𝐵, 𝐴))))
52	35, 51	orbi12d 793	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → ((𝐴 = +∞ ∨ ¬ 𝐴 = +∞) ↔ ((𝐴 = +∞ ∧ 𝐴 = +∞) ∨ (¬ 𝐴 = +∞ ∧ 𝐴 = if(𝐴 = -∞, 𝐵, 𝐴)))))
53	33, 52	mpbid 147	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → ((𝐴 = +∞ ∧ 𝐴 = +∞) ∨ (¬ 𝐴 = +∞ ∧ 𝐴 = if(𝐴 = -∞, 𝐵, 𝐴))))
54	3	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → DECID 𝐴 = +∞)
55		eqifdc 3568	. . . . . . 7 ⊢ (DECID 𝐴 = +∞ → (𝐴 = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, 𝐴)) ↔ ((𝐴 = +∞ ∧ 𝐴 = +∞) ∨ (¬ 𝐴 = +∞ ∧ 𝐴 = if(𝐴 = -∞, 𝐵, 𝐴)))))
56	54, 55	syl 14	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → (𝐴 = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, 𝐴)) ↔ ((𝐴 = +∞ ∧ 𝐴 = +∞) ∨ (¬ 𝐴 = +∞ ∧ 𝐴 = if(𝐴 = -∞, 𝐵, 𝐴)))))
57	53, 56	mpbird 167	. . . . 5 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, 𝐴)))
58	38	iftrued 3541	. . . . 5 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = 𝐴)
59	38	iftrued 3541	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )) = 𝐴)
60	59	ifeq2d 3552	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, 𝐴))
61	60	ifeq2d 3552	. . . . 5 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, 𝐴)))
62	57, 58, 61	3eqtr4d 2220	. . . 4 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))
63		simpr 110	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → ¬ 𝐵 = -∞)
64	63	iffalsed 3544	. . . . 5 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
65	63	iffalsed 3544	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )) = sup({𝐵, 𝐴}, ℝ, < ))
66	65	ifeq2d 3552	. . . . . . 7 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, sup({𝐵, 𝐴}, ℝ, < )))
67	66	ifeq2d 3552	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐵, 𝐴}, ℝ, < ))))
68		maxcom 11196	. . . . . . 7 ⊢ sup({𝐵, 𝐴}, ℝ, < ) = sup({𝐴, 𝐵}, ℝ, < )
69		ifeq2 3538	. . . . . . 7 ⊢ (sup({𝐵, 𝐴}, ℝ, < ) = sup({𝐴, 𝐵}, ℝ, < ) → if(𝐴 = -∞, 𝐵, sup({𝐵, 𝐴}, ℝ, < )) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
70		ifeq2 3538	. . . . . . 7 ⊢ (if(𝐴 = -∞, 𝐵, sup({𝐵, 𝐴}, ℝ, < )) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐵, 𝐴}, ℝ, < ))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
71	68, 69, 70	mp2b 8	. . . . . 6 ⊢ if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐵, 𝐴}, ℝ, < ))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
72	67, 71	eqtrdi 2226	. . . . 5 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
73	64, 72	eqtr4d 2213	. . . 4 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))
74		xrmnfdc 9830	. . . . . 6 ⊢ (𝐵 ∈ ℝ* → DECID 𝐵 = -∞)
75		exmiddc 836	. . . . . 6 ⊢ (DECID 𝐵 = -∞ → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
76	74, 75	syl 14	. . . . 5 ⊢ (𝐵 ∈ ℝ* → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
77	76	ad2antlr 489	. . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
78	62, 73, 77	mpjaodan 798	. . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))
79		simpr 110	. . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → ¬ 𝐵 = +∞)
80	79	iffalsed 3544	. . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
81	79	iffalsed 3544	. . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))) = if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))
82	81	ifeq2d 3552	. . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))) = if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))
83	82	ifeq2d 3552	. . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < )))))
84	78, 80, 83	3eqtr4d 2220	. 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))
85		xrpnfdc 9829	. . . 4 ⊢ (𝐵 ∈ ℝ* → DECID 𝐵 = +∞)
86		exmiddc 836	. . . 4 ⊢ (DECID 𝐵 = +∞ → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
87	85, 86	syl 14	. . 3 ⊢ (𝐵 ∈ ℝ* → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
88	87	adantl 277	. 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
89	31, 84, 88	mpjaodan 798	1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, sup({𝐵, 𝐴}, ℝ, < ))))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 708  DECID wdc 834   = wceq 1353   ∈ wcel 2148  ifcif 3534  {cpr 3592  supcsup 6975  ℝcr 7801  +∞cpnf 7979  -∞cmnf 7980  ℝ^*cxr 7981   < clt 7982

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-un 4430  ax-setind 4533  ax-cnex 7893  ax-resscn 7894

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-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-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-if 3535  df-pw 3576  df-sn 3597  df-pr 3598  df-uni 3808  df-sup 6977  df-pnf 7984  df-mnf 7985  df-xr 7986

This theorem is referenced by:  xrmaxiflemval  11242