Theorem pmltpc 25426

Description: Any function on the reals is either increasing, decreasing, or has a triple of points in a vee formation. (This theorem was created on demand by Mario Carneiro for the 6PCM conference in Bialystok, 1-Jul-2014.) (Contributed by Mario Carneiro, 1-Jul-2014.)

Assertion

Ref	Expression
pmltpc	⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))

Distinct variable groups:   𝑎,𝑏,𝑐,𝑥,𝑦,𝐴   𝐹,𝑎,𝑏,𝑐,𝑥,𝑦

Proof of Theorem pmltpc

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rexanali 3092	. . . . . . . 8 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ ¬ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
2	1	rexbii 3085	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ ∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
3		rexnal 3090	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
4	2, 3	bitri 275	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
5		rexanali 3092	. . . . . . . 8 ⊢ (∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ¬ ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)))
6	5	rexbii 3085	. . . . . . 7 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ∃𝑧 ∈ 𝐴 ¬ ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)))
7		rexnal 3090	. . . . . . . 8 ⊢ (∃𝑧 ∈ 𝐴 ¬ ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ¬ ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)))
8		breq1 5089	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑧 ≤ 𝑤 ↔ 𝑥 ≤ 𝑤))
9		fveq2 6832	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
10	9	breq2d 5098	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → ((𝐹‘𝑤) ≤ (𝐹‘𝑧) ↔ (𝐹‘𝑤) ≤ (𝐹‘𝑥)))
11	8, 10	imbi12d 344	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → ((𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ (𝑥 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑥))))
12		breq2 5090	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑥 ≤ 𝑤 ↔ 𝑥 ≤ 𝑦))
13		fveq2 6832	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑦 → (𝐹‘𝑤) = (𝐹‘𝑦))
14	13	breq1d 5096	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → ((𝐹‘𝑤) ≤ (𝐹‘𝑥) ↔ (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
15	12, 14	imbi12d 344	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → ((𝑥 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑥)) ↔ (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))))
16	11, 15	cbvral2vw 3220	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
17	7, 16	xchbinx 334	. . . . . . 7 ⊢ (∃𝑧 ∈ 𝐴 ¬ ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
18	6, 17	bitri 275	. . . . . 6 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
19	4, 18	anbi12i 629	. . . . 5 ⊢ ((∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) ↔ (¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))))
20		reeanv 3210	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐴 (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))))
21		ioran 986	. . . . 5 ⊢ (¬ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) ↔ (¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))))
22	19, 20, 21	3bitr4i 303	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐴 (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) ↔ ¬ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))))
23		reeanv 3210	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 ∃𝑤 ∈ 𝐴 ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) ↔ (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))))
24		simplll 775	. . . . . . . . . 10 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → (𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹))
25	24	simpld 494	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝐹 ∈ (ℝ ↑pm ℝ))
26	24	simprd 495	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝐴 ⊆ dom 𝐹)
27		simpllr 776	. . . . . . . . . 10 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴))
28	27	simpld 494	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑥 ∈ 𝐴)
29		simplrl 777	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑦 ∈ 𝐴)
30	27	simprd 495	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑧 ∈ 𝐴)
31		simplrr 778	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑤 ∈ 𝐴)
32		simprll 779	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑥 ≤ 𝑦)
33		simprrl 781	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑧 ≤ 𝑤)
34		simprlr 780	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦))
35		simprrr 782	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))
36	25, 26, 28, 29, 30, 31, 32, 33, 34, 35	pmltpclem2 25425	. . . . . . . 8 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐)))))
37	36	ex 412	. . . . . . 7 ⊢ ((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
38	37	rexlimdvva 3195	. . . . . 6 ⊢ (((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (∃𝑦 ∈ 𝐴 ∃𝑤 ∈ 𝐴 ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
39	23, 38	biimtrrid 243	. . . . 5 ⊢ (((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
40	39	rexlimdvva 3195	. . . 4 ⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐴 (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
41	22, 40	biimtrrid 243	. . 3 ⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → (¬ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
42	41	orrd 864	. 2 ⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
43		df-3or 1088	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))) ↔ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
44	42, 43	sylibr 234	1 ⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 848   ∨ w3o 1086   ∧ w3a 1087   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062   ⊆ wss 3890   class class class wbr 5086  dom cdm 5622  ‘cfv 6490  (class class class)co 7358   ↑_pm cpm 8765  ℝcr 11026   < clt 11168   ≤ cle 11169

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680  ax-cnex 11083  ax-resscn 11084  ax-pre-lttri 11101  ax-pre-lttrn 11102

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5517  df-po 5530  df-so 5531  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7361  df-oprab 7362  df-mpo 7363  df-er 8634  df-pm 8767  df-en 8885  df-dom 8886  df-sdom 8887  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174

This theorem is referenced by: (None)