Theorem pmltpc 25403

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 3091	. . . . . . . 8 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ ¬ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
2	1	rexbii 3083	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ ∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
3		rexnal 3089	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
4	2, 3	bitri 275	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
5		rexanali 3091	. . . . . . . 8 ⊢ (∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ¬ ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)))
6	5	rexbii 3083	. . . . . . 7 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ∃𝑧 ∈ 𝐴 ¬ ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)))
7		rexnal 3089	. . . . . . . 8 ⊢ (∃𝑧 ∈ 𝐴 ¬ ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ¬ ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)))
8		breq1 5122	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑧 ≤ 𝑤 ↔ 𝑥 ≤ 𝑤))
9		fveq2 6876	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
10	9	breq2d 5131	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → ((𝐹‘𝑤) ≤ (𝐹‘𝑧) ↔ (𝐹‘𝑤) ≤ (𝐹‘𝑥)))
11	8, 10	imbi12d 344	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → ((𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ (𝑥 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑥))))
12		breq2 5123	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑥 ≤ 𝑤 ↔ 𝑥 ≤ 𝑦))
13		fveq2 6876	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑦 → (𝐹‘𝑤) = (𝐹‘𝑦))
14	13	breq1d 5129	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → ((𝐹‘𝑤) ≤ (𝐹‘𝑥) ↔ (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
15	12, 14	imbi12d 344	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → ((𝑥 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑥)) ↔ (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))))
16	11, 15	cbvral2vw 3224	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
17	7, 16	xchbinx 334	. . . . . . 7 ⊢ (∃𝑧 ∈ 𝐴 ¬ ∀𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 → (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
18	6, 17	bitri 275	. . . . . 6 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)))
19	4, 18	anbi12i 628	. . . . 5 ⊢ ((∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) ↔ (¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))))
20		reeanv 3213	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐴 (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))))
21		ioran 985	. . . . 5 ⊢ (¬ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) ↔ (¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))))
22	19, 20, 21	3bitr4i 303	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐴 (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) ↔ ¬ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))))
23		reeanv 3213	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 ∃𝑤 ∈ 𝐴 ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) ↔ (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))))
24		simplll 774	. . . . . . . . . 10 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → (𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹))
25	24	simpld 494	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝐹 ∈ (ℝ ↑pm ℝ))
26	24	simprd 495	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝐴 ⊆ dom 𝐹)
27		simpllr 775	. . . . . . . . . 10 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴))
28	27	simpld 494	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑥 ∈ 𝐴)
29		simplrl 776	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑦 ∈ 𝐴)
30	27	simprd 495	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑧 ∈ 𝐴)
31		simplrr 777	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑤 ∈ 𝐴)
32		simprll 778	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑥 ≤ 𝑦)
33		simprrl 780	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → 𝑧 ≤ 𝑤)
34		simprlr 779	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦))
35		simprrr 781	. . . . . . . . 9 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))
36	25, 26, 28, 29, 30, 31, 32, 33, 34, 35	pmltpclem2 25402	. . . . . . . 8 ⊢ (((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧)))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐)))))
37	36	ex 412	. . . . . . 7 ⊢ ((((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
38	37	rexlimdvva 3198	. . . . . 6 ⊢ (((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (∃𝑦 ∈ 𝐴 ∃𝑤 ∈ 𝐴 ((𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
39	23, 38	biimtrrid 243	. . . . 5 ⊢ (((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
40	39	rexlimdvva 3198	. . . 4 ⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → (∃𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐴 (∃𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 ∧ ¬ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∧ ∃𝑤 ∈ 𝐴 (𝑧 ≤ 𝑤 ∧ ¬ (𝐹‘𝑤) ≤ (𝐹‘𝑧))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
41	22, 40	biimtrrid 243	. . 3 ⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → (¬ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
42	41	orrd 863	. 2 ⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
43		df-3or 1087	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))) ↔ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥))) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))
44	42, 43	sylibr 234	1 ⊢ ((𝐹 ∈ (ℝ ↑pm ℝ) ∧ 𝐴 ⊆ dom 𝐹) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ∨ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑦) ≤ (𝐹‘𝑥)) ∨ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐴 ∃𝑐 ∈ 𝐴 (𝑎 < 𝑏 ∧ 𝑏 < 𝑐 ∧ (((𝐹‘𝑎) < (𝐹‘𝑏) ∧ (𝐹‘𝑐) < (𝐹‘𝑏)) ∨ ((𝐹‘𝑏) < (𝐹‘𝑎) ∧ (𝐹‘𝑏) < (𝐹‘𝑐))))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 847   ∨ w3o 1085   ∧ w3a 1086   ∈ wcel 2108  ∀wral 3051  ∃wrex 3060   ⊆ wss 3926   class class class wbr 5119  dom cdm 5654  ‘cfv 6531  (class class class)co 7405   ↑_pm cpm 8841  ℝcr 11128   < clt 11269   ≤ cle 11270

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186  ax-pre-lttri 11203  ax-pre-lttrn 11204

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-po 5561  df-so 5562  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-er 8719  df-pm 8843  df-en 8960  df-dom 8961  df-sdom 8962  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275

This theorem is referenced by: (None)