xrmaxiflemlub - Intuitionistic Logic Explorer

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

Theorem xrmaxiflemlub 11869

Description: Lemma for xrmaxif 11872. A least upper bound for {𝐴, 𝐵}. (Contributed by Jim Kingdon, 28-Apr-2023.)

**Hypotheses**
Ref	Expression
xrmaxiflemlub.a	⊢ (𝜑 → 𝐴 ∈ ℝ^*)
xrmaxiflemlub.b	⊢ (𝜑 → 𝐵 ∈ ℝ^*)
xrmaxiflemlub.c	⊢ (𝜑 → 𝐶 ∈ ℝ^*)
xrmaxiflemlub.clt	⊢ (𝜑 → 𝐶 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))

**Assertion**
Ref	Expression
xrmaxiflemlub	⊢ (𝜑 → (𝐶 < 𝐴 ∨ 𝐶 < 𝐵))

**Proof of Theorem xrmaxiflemlub**
Step	Hyp	Ref	Expression
1		xrmaxiflemlub.clt	. . 3 ⊢ (𝜑 → 𝐶 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
2		xrmaxiflemlub.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ^*)
3		xrmaxiflemlub.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
4		xrmaxiflemlub.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
5		xrmaxiflemcl 11866	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) ∈ ℝ^)
6	3, 4, 5	syl2anc 411	. . . 4 ⊢ (𝜑 → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) ∈ ℝ^*)
7		xrltso 10074	. . . . 5 ⊢ < Or ℝ^*
8		sowlin 4423	. . . . 5 ⊢ (( < Or ℝ^* ∧ (𝐶 ∈ ℝ^* ∧ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) ∈ ℝ^* ∧ 𝐴 ∈ ℝ^*)) → (𝐶 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) → (𝐶 < 𝐴 ∨ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))))
9	7, 8	mpan 424	. . . 4 ⊢ ((𝐶 ∈ ℝ^* ∧ if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) ∈ ℝ^* ∧ 𝐴 ∈ ℝ^*) → (𝐶 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) → (𝐶 < 𝐴 ∨ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))))
10	2, 6, 3, 9	syl3anc 1274	. . 3 ⊢ (𝜑 → (𝐶 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) → (𝐶 < 𝐴 ∨ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))))
11	1, 10	mpd 13	. 2 ⊢ (𝜑 → (𝐶 < 𝐴 ∨ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))))
12	1	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → 𝐶 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
13	3	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → 𝐴 ∈ ℝ^*)
14	4	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → 𝐵 ∈ ℝ^*)
15		simplr 529	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
16		simpr 110	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → 𝐵 = +∞)
17	16	iftrued 3616	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = +∞)
18	15, 17	breqtrd 4119	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → 𝐴 < +∞)
19	18, 16	breqtrrd 4121	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → 𝐴 < 𝐵)
20		simplr 529	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
21		simpr 110	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → ¬ 𝐵 = +∞)
22	21	iffalsed 3619	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
23	20, 22	breqtrd 4119	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → 𝐴 < if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
24	23	adantr 276	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 < if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
25		simpr 110	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐵 = -∞)
26	25	iftrued 3616	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = 𝐴)
27	24, 26	breqtrd 4119	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 < 𝐴)
28		xrltnr 10057	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ^* → ¬ 𝐴 < 𝐴)
29	3, 28	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝐴 < 𝐴)
30	29	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐴)
31	27, 30	pm2.21dd 625	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 < 𝐵)
32	23	adantr 276	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → 𝐴 < if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
33		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → ¬ 𝐵 = -∞)
34	33	iffalsed 3619	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
35	32, 34	breqtrd 4119	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → 𝐴 < if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
36	35	adantr 276	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 < if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
37		simpr 110	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 = +∞)
38	37	iftrued 3616	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = +∞)
39	36, 38	breqtrd 4119	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 < +∞)
40		nltpnft 10092	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℝ^* → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))
41	3, 40	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))
42	41	ad4antr 494	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → (𝐴 = +∞ ↔ ¬ 𝐴 < +∞))
43	37, 42	mpbid 147	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → ¬ 𝐴 < +∞)
44	39, 43	pm2.21dd 625	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 < 𝐵)
45	35	adantr 276	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → 𝐴 < if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
46		simpr 110	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → ¬ 𝐴 = +∞)
47	46	iffalsed 3619	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
48	45, 47	breqtrd 4119	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → 𝐴 < if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
49	48	adantr 276	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 < if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
50		simpr 110	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 = -∞)
51	50	iftrued 3616	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = 𝐵)
52	49, 51	breqtrd 4119	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 < 𝐵)
53	29	ad5antr 496	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 < 𝐴)
54		simp-5l 545	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝜑)
55		simp-4r 544	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = +∞)
56	54, 55	jca 306	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝜑 ∧ ¬ 𝐵 = +∞))
57		simpllr 536	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = -∞)
58	56, 57	jca 306	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞))
59		simplr 529	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = +∞)
60	58, 59	jca 306	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞))
61		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = -∞)
62		simplr 529	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = +∞)
63		simpr 110	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = -∞)
64		elxr 10054	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
65	3, 64	sylib 122	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
66	65	ad4antr 494	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
67	62, 63, 66	ecase23d 1387	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ∈ ℝ)
68	60, 61, 67	syl2anc 411	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ∈ ℝ)
69		simp-4r 544	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = +∞)
70		simpllr 536	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = -∞)
71		elxr 10054	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
72	4, 71	sylib 122	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
73	72	ad4antr 494	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
74	69, 70, 73	ecase23d 1387	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐵 ∈ ℝ)
75	60, 61, 74	syl2anc 411	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐵 ∈ ℝ)
76	48	adantr 276	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 < if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
77	61	iffalsed 3619	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = sup({𝐴, 𝐵}, ℝ, < ))
78	76, 77	breqtrd 4119	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 < sup({𝐴, 𝐵}, ℝ, < ))
79		maxleastlt 11836	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ∈ ℝ ∧ 𝐴 < sup({𝐴, 𝐵}, ℝ, < ))) → (𝐴 < 𝐴 ∨ 𝐴 < 𝐵))
80	68, 75, 68, 78, 79	syl22anc 1275	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 < 𝐴 ∨ 𝐴 < 𝐵))
81	80	orcomd 737	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 < 𝐵 ∨ 𝐴 < 𝐴))
82	53, 81	ecased 1386	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 < 𝐵)
83		xrmnfdc 10121	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = -∞)
84		exmiddc 844	. . . . . . . . . . . 12 ⊢ (DECID 𝐴 = -∞ → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
85	3, 83, 84	3syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
86	85	ad4antr 494	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
87	52, 82, 86	mpjaodan 806	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → 𝐴 < 𝐵)
88		xrpnfdc 10120	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = +∞)
89		exmiddc 844	. . . . . . . . . . 11 ⊢ (DECID 𝐴 = +∞ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
90	3, 88, 89	3syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
91	90	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
92	44, 87, 91	mpjaodan 806	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → 𝐴 < 𝐵)
93		xrmnfdc 10121	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℝ^* → DECID 𝐵 = -∞)
94		exmiddc 844	. . . . . . . . . 10 ⊢ (DECID 𝐵 = -∞ → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
95	4, 93, 94	3syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
96	95	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
97	31, 92, 96	mpjaodan 806	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → 𝐴 < 𝐵)
98		xrpnfdc 10120	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ^* → DECID 𝐵 = +∞)
99		exmiddc 844	. . . . . . . 8 ⊢ (DECID 𝐵 = +∞ → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
100	14, 98, 99	3syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
101	19, 97, 100	mpjaodan 806	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → 𝐴 < 𝐵)
102	13, 14, 101	xrmaxiflemab 11868	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = 𝐵)
103	12, 102	breqtrd 4119	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → 𝐶 < 𝐵)
104	103	ex 115	. . 3 ⊢ (𝜑 → (𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) → 𝐶 < 𝐵))
105	104	orim2d 796	. 2 ⊢ (𝜑 → ((𝐶 < 𝐴 ∨ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → (𝐶 < 𝐴 ∨ 𝐶 < 𝐵)))
106	11, 105	mpd 13	1 ⊢ (𝜑 → (𝐶 < 𝐴 ∨ 𝐶 < 𝐵))

Colors of variables: wff set class

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

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 xrmaxleastlt 11877

W3C validator