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 34645

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 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ)
5	3	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℝ)
6		brcnvg 5836	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥^◡ ≤ 𝐴 ↔ 𝐴 ≤ 𝑥))
7	4, 5, 6	syl2anc 585	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑥^◡ ≤ 𝐴 ↔ 𝐴 ≤ 𝑥))
8	7	pm5.32da 579	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝑥^◡ ≤ 𝐴) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)))
9		rexr 11190	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
10	9	ad2antrl 729	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝑥 ∈ ℝ^*)
11		simprr 773	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝐴 ≤ 𝑥)
12		ltpnf 13046	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 < +∞)
13	12	ad2antrl 729	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝑥 < +∞)
14	11, 13	jca 511	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))
15	10, 14	jca 511	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)))
16		simprl 771	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 ∈ ℝ^*)
17	3	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝐴 ∈ ℝ)
18		simprrl 781	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝐴 ≤ 𝑥)
19		simprrr 782	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 < +∞)
20		xrre3 13098	. . . . . . . . 9 ⊢ (((𝑥 ∈ ℝ^* ∧ 𝐴 ∈ ℝ) ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)) → 𝑥 ∈ ℝ)
21	16, 17, 18, 19, 20	syl22anc 839	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 ∈ ℝ)
22	21, 18	jca 511	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥))
23	15, 22	impbida 801	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥) ↔ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))))
24	8, 23	bitrd 279	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝑥^◡ ≤ 𝐴) ↔ (𝑥 ∈ ℝ^* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))))
25	24	rabbidva2 3403	. . . 4 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥^◡ ≤ 𝐴} = {𝑥 ∈ ℝ^* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)})
26	3	rexrd 11194	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
27		pnfxr 11198	. . . . 5 ⊢ +∞ ∈ ℝ^*
28		icoval 13311	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ +∞ ∈ ℝ^) → (𝐴[,)+∞) = {𝑥 ∈ ℝ^ ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)})
29	26, 27, 28	sylancl 587	. . . 4 ⊢ (𝜑 → (𝐴[,)+∞) = {𝑥 ∈ ℝ^* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)})
30	25, 29	eqtr4d 2775	. . 3 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥^◡ ≤ 𝐴} = (𝐴[,)+∞))
31		icopnfcld 24723	. . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴[,)+∞) ∈ (Clsd‘(topGen‘ran (,))))
32	3, 31	syl 17	. . 3 ⊢ (𝜑 → (𝐴[,)+∞) ∈ (Clsd‘(topGen‘ran (,))))
33	30, 32	eqeltrd 2837	. 2 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥^◡ ≤ 𝐴} ∈ (Clsd‘(topGen‘ran (,))))
34	1, 2, 3, 33	orrvccel 34644	1 ⊢ (𝜑 → (𝑋∘_RV/𝑐^◡ ≤ 𝐴) ∈ dom 𝑃)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3401 class class class wbr 5100 ^◡ccnv 5631 dom cdm 5632 ran crn 5633 ‘cfv 6500 (class class class)co 7368 ℝcr 11037 +∞cpnf 11175 ℝ^*cxr 11177 < clt 11178 ≤ cle 11179 (,)cioo 13273 [,)cico 13275 topGenctg 17369 Clsdccld 22972 Probcprb 34584 rRndVarcrrv 34617 ∘_RV/𝑐corvc 34633

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-inf2 9562 ax-ac2 10385 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-inf 9358 df-oi 9427 df-dju 9825 df-card 9863 df-acn 9866 df-ac 10038 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-n0 12414 df-z 12501 df-uz 12764 df-q 12874 df-ioo 13277 df-ico 13279 df-topgen 17375 df-top 22850 df-bases 22902 df-cld 22975 df-esum 34205 df-siga 34286 df-sigagen 34316 df-brsiga 34359 df-meas 34373 df-mbfm 34427 df-prob 34585 df-rrv 34618 df-orvc 34634

This theorem is referenced by: (None)

W3C validator