Metamath Proof Explorer


Theorem orvcgteel

Description: Preimage maps produced by the "greater than or equal to" relation are measurable sets. (Contributed by Thierry Arnoux, 5-Feb-2017)

Ref Expression
Hypotheses orvcgteel.1 ⊢ φ → P ∈ Prob
orvcgteel.2 ⊢ φ → X ∈ RndVar ℝ ⁡ P
orvcgteel.3 ⊢ φ → A ∈ ℝ
Assertion orvcgteel ⊢ φ → X ≤ -1 RV/c A ∈ dom ⁡ P

Proof

Step Hyp Ref Expression
1 orvcgteel.1 ⊢ φ → P ∈ Prob
2 orvcgteel.2 ⊢ φ → X ∈ RndVar ℝ ⁡ P
3 orvcgteel.3 ⊢ φ → A ∈ ℝ
4 simpr ⊢ φ ∧ x ∈ ℝ → x ∈ ℝ
5 3 adantr ⊢ φ ∧ x ∈ ℝ → A ∈ ℝ
6 brcnvg ⊢ x ∈ ℝ ∧ A ∈ ℝ → x ≤ -1 A ↔ A ≤ x
7 4 5 6 syl2anc ⊢ φ ∧ x ∈ ℝ → x ≤ -1 A ↔ A ≤ x
8 7 pm5.32da ⊢ φ → x ∈ ℝ ∧ x ≤ -1 A ↔ x ∈ ℝ ∧ A ≤ x
9 rexr ⊢ x ∈ ℝ → x ∈ ℝ *
10 9 ad2antrl ⊢ φ ∧ x ∈ ℝ ∧ A ≤ x → x ∈ ℝ *
11 simprr ⊢ φ ∧ x ∈ ℝ ∧ A ≤ x → A ≤ x
12 ltpnf ⊢ x ∈ ℝ → x < +∞
13 12 ad2antrl ⊢ φ ∧ x ∈ ℝ ∧ A ≤ x → x < +∞
14 11 13 jca ⊢ φ ∧ x ∈ ℝ ∧ A ≤ x → A ≤ x ∧ x < +∞
15 10 14 jca ⊢ φ ∧ x ∈ ℝ ∧ A ≤ x → x ∈ ℝ * ∧ A ≤ x ∧ x < +∞
16 simprl ⊢ φ ∧ x ∈ ℝ * ∧ A ≤ x ∧ x < +∞ → x ∈ ℝ *
17 3 adantr ⊢ φ ∧ x ∈ ℝ * ∧ A ≤ x ∧ x < +∞ → A ∈ ℝ
18 simprrl ⊢ φ ∧ x ∈ ℝ * ∧ A ≤ x ∧ x < +∞ → A ≤ x
19 simprrr ⊢ φ ∧ x ∈ ℝ * ∧ A ≤ x ∧ x < +∞ → x < +∞
20 xrre3 ⊢ x ∈ ℝ * ∧ A ∈ ℝ ∧ A ≤ x ∧ x < +∞ → x ∈ ℝ
21 16 17 18 19 20 syl22anc ⊢ φ ∧ x ∈ ℝ * ∧ A ≤ x ∧ x < +∞ → x ∈ ℝ
22 21 18 jca ⊢ φ ∧ x ∈ ℝ * ∧ A ≤ x ∧ x < +∞ → x ∈ ℝ ∧ A ≤ x
23 15 22 impbida ⊢ φ → x ∈ ℝ ∧ A ≤ x ↔ x ∈ ℝ * ∧ A ≤ x ∧ x < +∞
24 8 23 bitrd ⊢ φ → x ∈ ℝ ∧ x ≤ -1 A ↔ x ∈ ℝ * ∧ A ≤ x ∧ x < +∞
25 24 rabbidva2 ⊢ φ → x ∈ ℝ | x ≤ -1 A = x ∈ ℝ * | A ≤ x ∧ x < +∞
26 3 rexrd ⊢ φ → A ∈ ℝ *
27 pnfxr ⊢ +∞ ∈ ℝ *
28 icoval ⊢ A ∈ ℝ * ∧ +∞ ∈ ℝ * → A +∞ = x ∈ ℝ * | A ≤ x ∧ x < +∞
29 26 27 28 sylancl ⊢ φ → A +∞ = x ∈ ℝ * | A ≤ x ∧ x < +∞
30 25 29 eqtr4d ⊢ φ → x ∈ ℝ | x ≤ -1 A = A +∞
31 icopnfcld ⊢ A ∈ ℝ → A +∞ ∈ Clsd ⁡ topGen ⁡ ran ⁡ .
32 3 31 syl ⊢ φ → A +∞ ∈ Clsd ⁡ topGen ⁡ ran ⁡ .
33 30 32 eqeltrd ⊢ φ → x ∈ ℝ | x ≤ -1 A ∈ Clsd ⁡ topGen ⁡ ran ⁡ .
34 1 2 3 33 orrvccel ⊢ φ → X ≤ -1 RV/c A ∈ dom ⁡ P