Theorem xrmaxiflemab 11390

Description: Lemma for xrmaxif 11394. A variation of xrmaxleim 11387- that is, if we know which of two real numbers is larger, we know the maximum of the two. (Contributed by Jim Kingdon, 26-Apr-2023.)

Hypotheses

Ref	Expression
xrmaxiflemab.a	⊢ (𝜑 → 𝐴 ∈ ℝ*)
xrmaxiflemab.b	⊢ (𝜑 → 𝐵 ∈ ℝ*)
xrmaxiflemab.ab	⊢ (𝜑 → 𝐴 < 𝐵)

Assertion

Ref	Expression
xrmaxiflemab	⊢ (𝜑 → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = 𝐵)

Proof of Theorem xrmaxiflemab

Step	Hyp	Ref	Expression
1		simpr 110	. . . 4 ⊢ ((𝜑 ∧ 𝐵 = +∞) → 𝐵 = +∞)
2	1	iftrued 3564	. . 3 ⊢ ((𝜑 ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = +∞)
3	2, 1	eqtr4d 2229	. 2 ⊢ ((𝜑 ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = 𝐵)
4		simpr 110	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 = +∞) → ¬ 𝐵 = +∞)
5	4	iffalsed 3567	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
6		xrmaxiflemab.ab	. . . . . . 7 ⊢ (𝜑 → 𝐴 < 𝐵)
7	6	ad2antrr 488	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 < 𝐵)
8		simpr 110	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐵 = -∞)
9	7, 8	breqtrd 4055	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 < -∞)
10		xrmaxiflemab.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
11		nltmnf 9854	. . . . . . 7 ⊢ (𝐴 ∈ ℝ* → ¬ 𝐴 < -∞)
12	10, 11	syl 14	. . . . . 6 ⊢ (𝜑 → ¬ 𝐴 < -∞)
13	12	ad2antrr 488	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → ¬ 𝐴 < -∞)
14	9, 13	pm2.21dd 621	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = 𝐵)
15		simpr 110	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → ¬ 𝐵 = -∞)
16	15	iffalsed 3567	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
17		simpr 110	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 = +∞)
18	6	ad3antrrr 492	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 < 𝐵)
19	17, 18	eqbrtrrd 4053	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → +∞ < 𝐵)
20		xrmaxiflemab.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ*)
21		pnfnlt 9853	. . . . . . . . 9 ⊢ (𝐵 ∈ ℝ* → ¬ +∞ < 𝐵)
22	20, 21	syl 14	. . . . . . . 8 ⊢ (𝜑 → ¬ +∞ < 𝐵)
23	22	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → ¬ +∞ < 𝐵)
24	19, 23	pm2.21dd 621	. . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = 𝐵)
25		simpr 110	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → ¬ 𝐴 = +∞)
26	25	iffalsed 3567	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
27		simpr 110	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 = -∞)
28	27	iftrued 3564	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = 𝐵)
29		simpr 110	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = -∞)
30	29	iffalsed 3567	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = sup({𝐴, 𝐵}, ℝ, < ))
31	25	adantr 276	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = +∞)
32		elxr 9842	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
33	10, 32	sylib 122	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
34	33	ad4antr 494	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
35	31, 29, 34	ecase23d 1361	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ∈ ℝ)
36	4	ad3antrrr 492	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = +∞)
37	15	ad2antrr 488	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = -∞)
38		elxr 9842	. . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ ℝ* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
39	20, 38	sylib 122	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
40	39	ad4antr 494	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
41	36, 37, 40	ecase23d 1361	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐵 ∈ ℝ)
42	35, 41	jca 306	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ))
43	6	ad4antr 494	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 < 𝐵)
44	35, 41, 43	ltled 8138	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ≤ 𝐵)
45		maxleim 11349	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → sup({𝐴, 𝐵}, ℝ, < ) = 𝐵))
46	42, 44, 45	sylc 62	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → sup({𝐴, 𝐵}, ℝ, < ) = 𝐵)
47	30, 46	eqtrd 2226	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = 𝐵)
48		xrmnfdc 9909	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ* → DECID 𝐴 = -∞)
49		exmiddc 837	. . . . . . . . . 10 ⊢ (DECID 𝐴 = -∞ → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
50	10, 48, 49	3syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
51	50	ad3antrrr 492	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
52	28, 47, 51	mpjaodan 799	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = 𝐵)
53	26, 52	eqtrd 2226	. . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = 𝐵)
54		xrpnfdc 9908	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ* → DECID 𝐴 = +∞)
55		exmiddc 837	. . . . . . . 8 ⊢ (DECID 𝐴 = +∞ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
56	10, 54, 55	3syl 17	. . . . . . 7 ⊢ (𝜑 → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
57	56	ad2antrr 488	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
58	24, 53, 57	mpjaodan 799	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = 𝐵)
59	16, 58	eqtrd 2226	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = 𝐵)
60		xrmnfdc 9909	. . . . . 6 ⊢ (𝐵 ∈ ℝ* → DECID 𝐵 = -∞)
61		exmiddc 837	. . . . . 6 ⊢ (DECID 𝐵 = -∞ → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
62	20, 60, 61	3syl 17	. . . . 5 ⊢ (𝜑 → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
63	62	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐵 = +∞) → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
64	14, 59, 63	mpjaodan 799	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 = +∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = 𝐵)
65	5, 64	eqtrd 2226	. 2 ⊢ ((𝜑 ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = 𝐵)
66		xrpnfdc 9908	. . 3 ⊢ (𝐵 ∈ ℝ* → DECID 𝐵 = +∞)
67		exmiddc 837	. . 3 ⊢ (DECID 𝐵 = +∞ → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
68	20, 66, 67	3syl 17	. 2 ⊢ (𝜑 → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
69	3, 65, 68	mpjaodan 799	1 ⊢ (𝜑 → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = 𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 709  DECID wdc 835   ∨ w3o 979   = wceq 1364   ∈ wcel 2164  ifcif 3557  {cpr 3619   class class class wbr 4029  supcsup 7041  ℝcr 7871  +∞cpnf 8051  -∞cmnf 8052  ℝ^*cxr 8053   < clt 8054   ≤ cle 8055

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-pre-ltirr 7984  ax-pre-lttrn 7986  ax-pre-apti 7987

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-xp 4665  df-cnv 4667  df-iota 5215  df-riota 5873  df-sup 7043  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060

This theorem is referenced by:  xrmaxiflemlub  11391