Metamath Proof Explorer


Theorem liminfgord

Description: Ordering property of the inferior limit function. (Contributed by Glauco Siliprandi, 2-Jan-2022)

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

Proof

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