xrmaxiflemlub - Intuitionistic Logic Explorer

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

Theorem xrmaxiflemlub 11391

Description: Lemma for xrmaxif 11394. 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 11388	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) ∈ ℝ^)
6	3, 4, 5	syl2anc 411	. . . 4 ⊢ (𝜑 → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) ∈ ℝ^*)
7		xrltso 9862	. . . . 5 ⊢ < Or ℝ^*
8		sowlin 4351	. . . . 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 1249	. . 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 528	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
16		simpr 110	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → 𝐵 = +∞)
17	16	iftrued 3564	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = +∞)
18	15, 17	breqtrd 4055	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → 𝐴 < +∞)
19	18, 16	breqtrrd 4057	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ 𝐵 = +∞) → 𝐴 < 𝐵)
20		simplr 528	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))))
21		simpr 110	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → ¬ 𝐵 = +∞)
22	21	iffalsed 3567	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))
23	20, 22	breqtrd 4055	. . . . . . . . . . 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 3564	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = 𝐴)
27	24, 26	breqtrd 4055	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → 𝐴 < 𝐴)
28		xrltnr 9845	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ^* → ¬ 𝐴 < 𝐴)
29	3, 28	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝐴 < 𝐴)
30	29	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ 𝐵 = -∞) → ¬ 𝐴 < 𝐴)
31	27, 30	pm2.21dd 621	. . . . . . . 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 3567	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))) = if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))
35	32, 34	breqtrd 4055	. . . . . . . . . . . 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 3564	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = +∞)
39	36, 38	breqtrd 4055	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ 𝐴 = +∞) → 𝐴 < +∞)
40		nltpnft 9880	. . . . . . . . . . . . 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 621	. . . . . . . . 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 3567	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))) = if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))
48	45, 47	breqtrd 4055	. . . . . . . . . . . 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 3564	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = 𝐵)
52	49, 51	breqtrd 4055	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ 𝐴 = -∞) → 𝐴 < 𝐵)
53	29	ad5antr 496	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 < 𝐴)
54		simp-5l 543	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝜑)
55		simp-4r 542	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = +∞)
56	54, 55	jca 306	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝜑 ∧ ¬ 𝐵 = +∞))
57		simpllr 534	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = -∞)
58	56, 57	jca 306	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞))
59		simplr 528	. . . . . . . . . . . . . . 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 528	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = +∞)
63		simpr 110	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐴 = -∞)
64		elxr 9842	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
65	3, 64	sylib 122	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
66	65	ad4antr 494	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
67	62, 63, 66	ecase23d 1361	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ∈ ℝ)
68	60, 61, 67	syl2anc 411	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ∈ ℝ)
69		simp-4r 542	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = +∞)
70		simpllr 534	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → ¬ 𝐵 = -∞)
71		elxr 9842	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
72	4, 71	sylib 122	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
73	72	ad4antr 494	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
74	69, 70, 73	ecase23d 1361	. . . . . . . . . . . . . 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 3567	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )) = sup({𝐴, 𝐵}, ℝ, < ))
78	76, 77	breqtrd 4055	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 < sup({𝐴, 𝐵}, ℝ, < ))
79		maxleastlt 11359	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴 ∈ ℝ ∧ 𝐴 < sup({𝐴, 𝐵}, ℝ, < ))) → (𝐴 < 𝐴 ∨ 𝐴 < 𝐵))
80	68, 75, 68, 78, 79	syl22anc 1250	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 < 𝐴 ∨ 𝐴 < 𝐵))
81	80	orcomd 730	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → (𝐴 < 𝐵 ∨ 𝐴 < 𝐴))
82	53, 81	ecased 1360	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 < 𝐵)
83		xrmnfdc 9909	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = -∞)
84		exmiddc 837	. . . . . . . . . . . 12 ⊢ (DECID 𝐴 = -∞ → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
85	3, 83, 84	3syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
86	85	ad4antr 494	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
87	52, 82, 86	mpjaodan 799	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) ∧ ¬ 𝐴 = +∞) → 𝐴 < 𝐵)
88		xrpnfdc 9908	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = +∞)
89		exmiddc 837	. . . . . . . . . . 11 ⊢ (DECID 𝐴 = +∞ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
90	3, 88, 89	3syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
91	90	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
92	44, 87, 91	mpjaodan 799	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) ∧ ¬ 𝐵 = -∞) → 𝐴 < 𝐵)
93		xrmnfdc 9909	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℝ^* → DECID 𝐵 = -∞)
94		exmiddc 837	. . . . . . . . . 10 ⊢ (DECID 𝐵 = -∞ → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
95	4, 93, 94	3syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
96	95	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → (𝐵 = -∞ ∨ ¬ 𝐵 = -∞))
97	31, 92, 96	mpjaodan 799	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) ∧ ¬ 𝐵 = +∞) → 𝐴 < 𝐵)
98		xrpnfdc 9908	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ^* → DECID 𝐵 = +∞)
99		exmiddc 837	. . . . . . . 8 ⊢ (DECID 𝐵 = +∞ → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
100	14, 98, 99	3syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → (𝐵 = +∞ ∨ ¬ 𝐵 = +∞))
101	19, 97, 100	mpjaodan 799	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → 𝐴 < 𝐵)
102	13, 14, 101	xrmaxiflemab 11390	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) = 𝐵)
103	12, 102	breqtrd 4055	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < )))))) → 𝐶 < 𝐵)
104	103	ex 115	. . 3 ⊢ (𝜑 → (𝐴 < if(𝐵 = +∞, +∞, if(𝐵 = -∞, 𝐴, if(𝐴 = +∞, +∞, if(𝐴 = -∞, 𝐵, sup({𝐴, 𝐵}, ℝ, < ))))) → 𝐶 < 𝐵))
105	104	orim2d 789	. 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 709 DECID wdc 835 ∨ w3o 979 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ifcif 3557 {cpr 3619 class class class wbr 4029 Or wor 4326 supcsup 7041 ℝcr 7871 +∞cpnf 8051 -∞cmnf 8052 ℝ^*cxr 8053 < clt 8054

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-coll 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989 ax-pre-mulext 7990 ax-arch 7991 ax-caucvg 7992

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-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-po 4327 df-iso 4328 df-iord 4397 df-on 4399 df-ilim 4400 df-suc 4402 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-recs 6358 df-frec 6444 df-sup 7043 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-reap 8594 df-ap 8601 df-div 8692 df-inn 8983 df-2 9041 df-3 9042 df-4 9043 df-n0 9241 df-z 9318 df-uz 9593 df-rp 9720 df-seqfrec 10519 df-exp 10610 df-cj 10986 df-re 10987 df-im 10988 df-rsqrt 11142 df-abs 11143

This theorem is referenced by: xrmaxiflemval 11393 xrmaxleastlt 11399

W3C validator