Metamath Proof Explorer


Theorem orvclteinc

Description: Preimage maps produced by the "less than or equal to" relation are increasing. (Contributed by Thierry Arnoux, 11-Feb-2017)

Ref Expression
Hypotheses dstfrv.1 ⊢ φ → P ∈ Prob
dstfrv.2 ⊢ φ → X ∈ RndVar ℝ ⁡ P
orvclteinc.1 ⊢ φ → A ∈ ℝ
orvclteinc.2 ⊢ φ → B ∈ ℝ
orvclteinc.3 ⊢ φ → A ≤ B
Assertion orvclteinc ⊢ φ → X ≤ RV/c A ⊆ X ≤ RV/c B

Proof

Step Hyp Ref Expression
1 dstfrv.1 ⊢ φ → P ∈ Prob
2 dstfrv.2 ⊢ φ → X ∈ RndVar ℝ ⁡ P
3 orvclteinc.1 ⊢ φ → A ∈ ℝ
4 orvclteinc.2 ⊢ φ → B ∈ ℝ
5 orvclteinc.3 ⊢ φ → A ≤ B
6 1 2 rrvf2 ⊢ φ → X : dom ⁡ X ⟶ ℝ
7 6 ffund ⊢ φ → Fun ⁡ X
8 simp2 ⊢ φ ∧ x ∈ ℝ ∧ x ≤ A → x ∈ ℝ
9 3 3ad2ant1 ⊢ φ ∧ x ∈ ℝ ∧ x ≤ A → A ∈ ℝ
10 4 3ad2ant1 ⊢ φ ∧ x ∈ ℝ ∧ x ≤ A → B ∈ ℝ
11 simp3 ⊢ φ ∧ x ∈ ℝ ∧ x ≤ A → x ≤ A
12 5 3ad2ant1 ⊢ φ ∧ x ∈ ℝ ∧ x ≤ A → A ≤ B
13 8 9 10 11 12 letrd ⊢ φ ∧ x ∈ ℝ ∧ x ≤ A → x ≤ B
14 13 3expia ⊢ φ ∧ x ∈ ℝ → x ≤ A → x ≤ B
15 14 ss2rabdv ⊢ φ → x ∈ ℝ | x ≤ A ⊆ x ∈ ℝ | x ≤ B
16 sspreima ⊢ Fun ⁡ X ∧ x ∈ ℝ | x ≤ A ⊆ x ∈ ℝ | x ≤ B → X -1 x ∈ ℝ | x ≤ A ⊆ X -1 x ∈ ℝ | x ≤ B
17 7 15 16 syl2anc ⊢ φ → X -1 x ∈ ℝ | x ≤ A ⊆ X -1 x ∈ ℝ | x ≤ B
18 1 2 3 orrvcval4 ⊢ φ → X ≤ RV/c A = X -1 x ∈ ℝ | x ≤ A
19 1 2 4 orrvcval4 ⊢ φ → X ≤ RV/c B = X -1 x ∈ ℝ | x ≤ B
20 17 18 19 3sstr4d ⊢ φ → X ≤ RV/c A ⊆ X ≤ RV/c B