| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > orvcgteel | Structured version Visualization version GIF version | ||
| Description: Preimage maps produced by the "greater than or equal to" relation are measurable sets. (Contributed by Thierry Arnoux, 5-Feb-2017.) |
| Ref | Expression |
|---|---|
| orvcgteel.1 | ⊢ (𝜑 → 𝑃 ∈ Prob) |
| orvcgteel.2 | ⊢ (𝜑 → 𝑋 ∈ (rRndVar‘𝑃)) |
| orvcgteel.3 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| Ref | Expression |
|---|---|
| orvcgteel | ⊢ (𝜑 → (𝑋∘RV/𝑐◡ ≤ 𝐴) ∈ dom 𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orvcgteel.1 | . 2 ⊢ (𝜑 → 𝑃 ∈ Prob) | |
| 2 | orvcgteel.2 | . 2 ⊢ (𝜑 → 𝑋 ∈ (rRndVar‘𝑃)) | |
| 3 | orvcgteel.3 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 4 | simpr 490 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
| 5 | 3 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝐴 ∈ ℝ) |
| 6 | brcnvg 5865 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥◡ ≤ 𝐴 ↔ 𝐴 ≤ 𝑥)) | |
| 7 | 4, 5, 6 | syl2anc 596 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑥◡ ≤ 𝐴 ↔ 𝐴 ≤ 𝑥)) |
| 8 | 7 | pm5.32da 590 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝑥◡ ≤ 𝐴) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥))) |
| 9 | rexr 11385 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ*) | |
| 10 | 9 | ad2antrl 741 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝑥 ∈ ℝ*) |
| 11 | simprr 785 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝐴 ≤ 𝑥) | |
| 12 | ltpnf 13279 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → 𝑥 < +∞) | |
| 13 | 12 | ad2antrl 741 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → 𝑥 < +∞) |
| 14 | 11, 13 | jca 521 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)) |
| 15 | 10, 14 | jca 521 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) → (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) |
| 16 | simprl 783 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 ∈ ℝ*) | |
| 17 | 3 | adantr 486 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝐴 ∈ ℝ) |
| 18 | simprrl 793 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝐴 ≤ 𝑥) | |
| 19 | simprrr 794 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 < +∞) | |
| 20 | xrre3 13331 | . . . . . . . . 9 ⊢ (((𝑥 ∈ ℝ* ∧ 𝐴 ∈ ℝ) ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)) → 𝑥 ∈ ℝ) | |
| 21 | 16, 17, 18, 19, 20 | syl22anc 852 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → 𝑥 ∈ ℝ) |
| 22 | 21, 18 | jca 521 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞))) → (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥)) |
| 23 | 15, 22 | impbida 813 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥) ↔ (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)))) |
| 24 | 8, 23 | bitrd 282 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ ℝ ∧ 𝑥◡ ≤ 𝐴) ↔ (𝑥 ∈ ℝ* ∧ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)))) |
| 25 | 24 | rabbidva2 3418 | . . . 4 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥◡ ≤ 𝐴} = {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)}) |
| 26 | 3 | rexrd 11389 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| 27 | pnfxr 11393 | . . . . 5 ⊢ +∞ ∈ ℝ* | |
| 28 | icoval 13544 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴[,)+∞) = {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)}) | |
| 29 | 26, 27, 28 | sylancl 598 | . . . 4 ⊢ (𝜑 → (𝐴[,)+∞) = {𝑥 ∈ ℝ* ∣ (𝐴 ≤ 𝑥 ∧ 𝑥 < +∞)}) |
| 30 | 25, 29 | eqtr4d 2801 | . . 3 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥◡ ≤ 𝐴} = (𝐴[,)+∞)) |
| 31 | icopnfcld 25119 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴[,)+∞) ∈ (Clsd‘(topGen‘ran (,)))) | |
| 32 | 3, 31 | syl 18 | . . 3 ⊢ (𝜑 → (𝐴[,)+∞) ∈ (Clsd‘(topGen‘ran (,)))) |
| 33 | 30, 32 | eqeltrd 2864 | . 2 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥◡ ≤ 𝐴} ∈ (Clsd‘(topGen‘ran (,)))) |
| 34 | 1, 2, 3, 33 | orrvccel 35182 | 1 ⊢ (𝜑 → (𝑋∘RV/𝑐◡ ≤ 𝐴) ∈ dom 𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {crab 3416 class class class wbr 5106 ◡ccnv 5655 dom cdm 5656 ran crn 5657 ‘cfv 6561 (class class class)co 7446 ℝcr 11229 +∞cpnf 11370 ℝ*cxr 11372 < clt 11373 ≤ cle 11374 (,)cioo 13506 [,)cico 13508 topGenctg 17640 Clsdccld 23367 Probcprb 35122 rRndVarcrrv 35155 ∘RV/𝑐corvc 35171 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-inf2 9672 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 ax-pre-sup 11308 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-2o 8508 df-er 8748 df-map 8880 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-sup 9464 df-inf 9465 df-oi 9534 df-dju 10012 df-card 10050 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 df-nn 12366 df-n0 12637 df-z 12724 df-uz 12996 df-q 13106 df-ioo 13510 df-ico 13512 df-topgen 17646 df-top 23245 df-bases 23297 df-cld 23370 df-esum 34743 df-siga 34824 df-sigagen 34855 df-brsiga 34898 df-meas 34912 df-mbfm 34966 df-prob 35123 df-rrv 35156 df-orvc 35172 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |