orvcgteel - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > orvcgteel		Structured version Visualization version GIF version

Theorem orvcgteel 34659

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

**Hypotheses**
Ref	Expression
orvcgteel.1	⊢ (𝜑 → 𝑃 ∈ Prob)
orvcgteel.2	⊢ (𝜑 → 𝑋 ∈ (rRndVar‘𝑃))
orvcgteel.3	⊢ (𝜑 → 𝐴 ∈ ℝ)

**Assertion**
Ref	Expression
orvcgteel	⊢ (𝜑 → (𝑋∘_RV/𝑐^◡ ≤ 𝐴) ∈ dom 𝑃)

Proof of Theorem orvcgteel Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		orvcgteel.1	. 2 ⊢ (𝜑 → 𝑃 ∈ Prob)
2		orvcgteel.2	. 2 ⊢ (𝜑 → 𝑋 ∈ (rRndVar‘𝑃))
3		orvcgteel.3	. 2 ⊢ (𝜑 → 𝐴 ∈ ℝ)
4		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ)
5	3	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℝ)
6		brcnvg 5828	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥^◡ ≤ 𝐴 ↔ 𝐴 ≤ 𝑥))
7	4, 5, 6	syl2anc 590	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑥^◡ ≤ 𝐴 ↔ 𝐴 ≤ 𝑥))
8	7	pm5.32da 584	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝑥^◡ ≤ 𝐴) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)))
9		rexr 11189	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
10	9	ad2antrl 734	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝑥 ∈ ℝ^*)
11		simprr 778	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝐴 ≤ 𝑥)
12		ltpnf 13069	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 < +∞)
13	12	ad2antrl 734	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝑥 < +∞)
14	11, 13	jca 516	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))
15	10, 14	jca 516	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)))
16		simprl 776	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 ∈ ℝ^*)
17	3	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝐴 ∈ ℝ)
18		simprrl 786	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝐴 ≤ 𝑥)
19		simprrr 787	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 < +∞)
20		xrre3 13121	. . . . . . . . 9 ⊢ (((𝑥 ∈ ℝ^* ∧ 𝐴 ∈ ℝ) ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)) → 𝑥 ∈ ℝ)
21	16, 17, 18, 19, 20	syl22anc 844	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 ∈ ℝ)
22	21, 18	jca 516	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥))
23	15, 22	impbida 806	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥) ↔ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))))
24	8, 23	bitrd 280	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝑥^◡ ≤ 𝐴) ↔ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))))
25	24	rabbidva2 3394	. . . 4 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥^◡ ≤ 𝐴} = {𝑥 ∈ ℝ^* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)})
26	3	rexrd 11193	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
27		pnfxr 11197	. . . . 5 ⊢ +∞ ∈ ℝ^*
28		icoval 13334	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ +∞ ∈ ℝ^) → (𝐴[,)+∞) = {𝑥 ∈ ℝ^ ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)})
29	26, 27, 28	sylancl 592	. . . 4 ⊢ (𝜑 → (𝐴[,)+∞) = {𝑥 ∈ ℝ^* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)})
30	25, 29	eqtr4d 2778	. . 3 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥^◡ ≤ 𝐴} = (𝐴[,)+∞))
31		icopnfcld 24757	. . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴[,)+∞) ∈ (Clsd‘(topGen‘ran (,))))
32	3, 31	syl 17	. . 3 ⊢ (𝜑 → (𝐴[,)+∞) ∈ (Clsd‘(topGen‘ran (,))))
33	30, 32	eqeltrd 2840	. 2 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥^◡ ≤ 𝐴} ∈ (Clsd‘(topGen‘ran (,))))
34	1, 2, 3, 33	orrvccel 34658	1 ⊢ (𝜑 → (𝑋∘_RV/𝑐^◡ ≤ 𝐴) ∈ dom 𝑃)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 {crab 3392 class class class wbr 5079 ^◡ccnv 5624 dom cdm 5625 ran crn 5626 ‘cfv 6492 (class class class)co 7363 ℝcr 11035 +∞cpnf 11174 ℝ^*cxr 11176 < clt 11177 ≤ cle 11178 (,)cioo 13296 [,)cico 13298 topGenctg 17398 Clsdccld 23006 Probcprb 34598 rRndVarcrrv 34631 ∘_RV/𝑐corvc 34647

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-inf2 9560 ax-ac2 10383 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-iin 4931 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-er 8640 df-map 8772 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-sup 9352 df-inf 9353 df-oi 9422 df-dju 9823 df-card 9861 df-acn 9864 df-ac 10036 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-n0 12436 df-z 12523 df-uz 12787 df-q 12897 df-ioo 13300 df-ico 13302 df-topgen 17404 df-top 22884 df-bases 22936 df-cld 23009 df-esum 34219 df-siga 34300 df-sigagen 34330 df-brsiga 34373 df-meas 34387 df-mbfm 34441 df-prob 34599 df-rrv 34632 df-orvc 34648

This theorem is referenced by: (None)

W3C validator