Metamath Proof Explorer


Theorem limsupgord

Description: Ordering property of the superior limit function. (Contributed by Mario Carneiro, 7-Sep-2014) (Revised by Mario Carneiro, 7-May-2016)

Ref Expression
Assertion limsupgord ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ A ≤ B → sup F B +∞ ∩ ℝ * ℝ * < ≤ sup F A +∞ ∩ ℝ * ℝ * <

Proof

Step Hyp Ref Expression
1 rexr ⊢ A ∈ ℝ → A ∈ ℝ *
2 1 3ad2ant1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ A ≤ B → A ∈ ℝ *
3 simp3 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ A ≤ B → A ≤ B
4 df-ico ⊢ . = x ∈ ℝ * , y ∈ ℝ * ⟼ z ∈ ℝ * | x ≤ z ∧ z < y
5 xrletr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ w ∈ ℝ * → A ≤ B ∧ B ≤ w → A ≤ w
6 4 4 5 ixxss1 ⊢ A ∈ ℝ * ∧ A ≤ B → B +∞ ⊆ A +∞
7 2 3 6 syl2anc ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ A ≤ B → B +∞ ⊆ A +∞
8 imass2 ⊢ B +∞ ⊆ A +∞ → F B +∞ ⊆ F A +∞
9 ssrin ⊢ F B +∞ ⊆ F A +∞ → F B +∞ ∩ ℝ * ⊆ F A +∞ ∩ ℝ *
10 7 8 9 3syl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ A ≤ B → F B +∞ ∩ ℝ * ⊆ F A +∞ ∩ ℝ *
11 inss2 ⊢ F A +∞ ∩ ℝ * ⊆ ℝ *
12 supxrcl ⊢ F A +∞ ∩ ℝ * ⊆ ℝ * → sup F A +∞ ∩ ℝ * ℝ * < ∈ ℝ *
13 11 12 ax-mp ⊢ sup F A +∞ ∩ ℝ * ℝ * < ∈ ℝ *
14 xrleid ⊢ sup F A +∞ ∩ ℝ * ℝ * < ∈ ℝ * → sup F A +∞ ∩ ℝ * ℝ * < ≤ sup F A +∞ ∩ ℝ * ℝ * <
15 13 14 ax-mp ⊢ sup F A +∞ ∩ ℝ * ℝ * < ≤ sup F A +∞ ∩ ℝ * ℝ * <
16 supxrleub ⊢ F A +∞ ∩ ℝ * ⊆ ℝ * ∧ sup F A +∞ ∩ ℝ * ℝ * < ∈ ℝ * → sup F A +∞ ∩ ℝ * ℝ * < ≤ sup F A +∞ ∩ ℝ * ℝ * < ↔ ∀ x ∈ F A +∞ ∩ ℝ * x ≤ sup F A +∞ ∩ ℝ * ℝ * <
17 11 13 16 mp2an ⊢ sup F A +∞ ∩ ℝ * ℝ * < ≤ sup F A +∞ ∩ ℝ * ℝ * < ↔ ∀ x ∈ F A +∞ ∩ ℝ * x ≤ sup F A +∞ ∩ ℝ * ℝ * <
18 15 17 mpbi ⊢ ∀ x ∈ F A +∞ ∩ ℝ * x ≤ sup F A +∞ ∩ ℝ * ℝ * <
19 ssralv ⊢ F B +∞ ∩ ℝ * ⊆ F A +∞ ∩ ℝ * → ∀ x ∈ F A +∞ ∩ ℝ * x ≤ sup F A +∞ ∩ ℝ * ℝ * < → ∀ x ∈ F B +∞ ∩ ℝ * x ≤ sup F A +∞ ∩ ℝ * ℝ * <
20 10 18 19 mpisyl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ A ≤ B → ∀ x ∈ F B +∞ ∩ ℝ * x ≤ sup F A +∞ ∩ ℝ * ℝ * <
21 inss2 ⊢ F B +∞ ∩ ℝ * ⊆ ℝ *
22 supxrleub ⊢ F B +∞ ∩ ℝ * ⊆ ℝ * ∧ sup F A +∞ ∩ ℝ * ℝ * < ∈ ℝ * → sup F B +∞ ∩ ℝ * ℝ * < ≤ sup F A +∞ ∩ ℝ * ℝ * < ↔ ∀ x ∈ F B +∞ ∩ ℝ * x ≤ sup F A +∞ ∩ ℝ * ℝ * <
23 21 13 22 mp2an ⊢ sup F B +∞ ∩ ℝ * ℝ * < ≤ sup F A +∞ ∩ ℝ * ℝ * < ↔ ∀ x ∈ F B +∞ ∩ ℝ * x ≤ sup F A +∞ ∩ ℝ * ℝ * <
24 20 23 sylibr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ A ≤ B → sup F B +∞ ∩ ℝ * ℝ * < ≤ sup F A +∞ ∩ ℝ * ℝ * <