xrmaxifle - Intuitionistic Logic Explorer

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

Theorem xrmaxifle 11867

Description: An upper bound for {𝐴, 𝐵} in the extended reals. (Contributed by Jim Kingdon, 26-Apr-2023.)

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

**Proof of Theorem xrmaxifle**
Step	Hyp	Ref	Expression
1		pnfge 10067	. . . 4 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ +∞)
2	1	ad2antrr 488	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐵 = +∞) → 𝐴 ≤ +∞)
3		simpr 110	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐵 = +∞) → 𝐵 = +∞)
4	3	iftrued 3616	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = +∞)
5	2, 4	breqtrrd 4121	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐵 = +∞) → 𝐴 ≤ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
6		xrleid 10078	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ 𝐴)
7	6	ad3antrrr 492	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 ≤ 𝐴)
8		simpr 110	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐵 = -∞)
9	8	iftrued 3616	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = 𝐴)
10	7, 9	breqtrrd 4121	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 ≤ if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
11	1	ad4antr 494	. . . . . . 7 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 ≤ +∞)
12		simpr 110	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 = +∞)
13	12	iftrued 3616	. . . . . . 7 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = +∞)
14	11, 13	breqtrrd 4121	. . . . . 6 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 ≤ if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
15		mnfle 10070	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℝ^* → -∞ ≤ 𝐵)
16	15	ad5antlr 497	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → -∞ ≤ 𝐵)
17		simpr 110	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 = -∞)
18	17	iftrued 3616	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = 𝐵)
19	16, 17, 18	3brtr4d 4125	. . . . . . . 8 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 ≤ if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
20		simplr 529	. . . . . . . . . . 11 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = +∞)
21		simpr 110	. . . . . . . . . . 11 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = -∞)
22		elxr 10054	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
23	22	biimpi 120	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℝ^* → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
24	23	ad5antr 496	. . . . . . . . . . 11 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
25	20, 21, 24	ecase23d 1387	. . . . . . . . . 10 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ∈ ℝ)
26		simpr 110	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) → ¬ 𝐵 = +∞)
27	26	ad3antrrr 492	. . . . . . . . . . 11 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = +∞)
28		simpr 110	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → ¬ 𝐵 = -∞)
29	28	ad2antrr 488	. . . . . . . . . . 11 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = -∞)
30		elxr 10054	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
31	30	biimpi 120	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℝ^* → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
32	31	ad5antlr 497	. . . . . . . . . . 11 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
33	27, 29, 32	ecase23d 1387	. . . . . . . . . 10 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐵 ∈ ℝ)
34		maxle1 11832	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ≤ sup({𝐴, 𝐵}, ℝ, < ))
35	25, 33, 34	syl2anc 411	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ≤ sup({𝐴, 𝐵}, ℝ, < ))
36	21	iffalsed 3619	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = sup({𝐴, 𝐵}, ℝ, < ))
37	35, 36	breqtrrd 4121	. . . . . . . 8 ⊢ ((((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ≤ if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
38		xrmnfdc 10121	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = -∞)
39		exmiddc 844	. . . . . . . . . 10 ⊢ (DECID 𝐴 = -∞ → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
40	38, 39	syl 14	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ^* → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
41	40	ad4antr 494	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
42	19, 37, 41	mpjaodan 806	. . . . . . 7 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → 𝐴 ≤ if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
43		simpr 110	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → ¬ 𝐴 = +∞)
44	43	iffalsed 3619	. . . . . . 7 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
45	42, 44	breqtrrd 4121	. . . . . 6 ⊢ (((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → 𝐴 ≤ if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
46		xrpnfdc 10120	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = +∞)
47		exmiddc 844	. . . . . . . 8 ⊢ (DECID 𝐴 = +∞ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
48	46, 47	syl 14	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
49	48	ad3antrrr 492	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
50	14, 45, 49	mpjaodan 806	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → 𝐴 ≤ if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
51	28	iffalsed 3619	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
52	50, 51	breqtrrd 4121	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → 𝐴 ≤ if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
53		xrmnfdc 10121	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → DECID 𝐵 = -∞)
54		exmiddc 844	. . . . . 6 ⊢ (DECID 𝐵 = -∞ → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
55	53, 54	syl 14	. . . . 5 ⊢ (𝐵 ∈ ℝ^* → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
56	55	ad2antlr 489	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
57	10, 52, 56	mpjaodan 806	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) → 𝐴 ≤ if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
58	26	iffalsed 3619	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
59	57, 58	breqtrrd 4121	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ¬ 𝐵 = +∞) → 𝐴 ≤ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
60		xrpnfdc 10120	. . . 4 ⊢ (𝐵 ∈ ℝ^* → DECID 𝐵 = +∞)
61		exmiddc 844	. . . 4 ⊢ (DECID 𝐵 = +∞ → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
62	60, 61	syl 14	. . 3 ⊢ (𝐵 ∈ ℝ^* → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
63	62	adantl 277	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
64	5, 59, 63	mpjaodan 806	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → 𝐴 ≤ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 716 DECID wdc 842 ∨ w3o 1004 = wceq 1398 ∈ wcel 2202 ifcif 3607 {cpr 3674 class class class wbr 4093 supcsup 7224 ℝcr 8074 +∞cpnf 8254 -∞cmnf 8255 ℝ^*cxr 8256 < clt 8257 ≤ cle 8258

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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194 ax-caucvg 8195

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-sup 7226 df-pnf 8259 df-mnf 8260 df-xr 8261 df-ltxr 8262 df-le 8263 df-sub 8395 df-neg 8396 df-reap 8798 df-ap 8805 df-div 8896 df-inn 9187 df-2 9245 df-3 9246 df-4 9247 df-n0 9446 df-z 9523 df-uz 9799 df-rp 9932 df-seqfrec 10754 df-exp 10845 df-cj 11463 df-re 11464 df-im 11465 df-rsqrt 11619 df-abs 11620

This theorem is referenced by: xrmaxiflemval 11871 xrmax1sup 11874

W3C validator