orvclteinc - Mathbox for Thierry Arnoux

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

Theorem orvclteinc 30537

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

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

**Assertion**
Ref	Expression
orvclteinc	⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐴) ⊆ (𝑋∘_RV/𝑐 ≤ 𝐵))

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

Step	Hyp	Ref	Expression
1		dstfrv.1	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ Prob)
2		dstfrv.2	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ (rRndVar‘𝑃))
3	1, 2	rrvf2 30510	. . . 4 ⊢ (𝜑 → 𝑋:dom 𝑋⟶ℝ)
4		ffun 6048	. . . 4 ⊢ (𝑋:dom 𝑋⟶ℝ → Fun 𝑋)
5	3, 4	syl 17	. . 3 ⊢ (𝜑 → Fun 𝑋)
6		simp2 1062	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ∈ ℝ)
7		orvclteinc.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ)
8	7	3ad2ant1 1082	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐴 ∈ ℝ)
9		orvclteinc.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ)
10	9	3ad2ant1 1082	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐵 ∈ ℝ)
11		simp3 1063	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ≤ 𝐴)
12		orvclteinc.3	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
13	12	3ad2ant1 1082	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐴 ≤ 𝐵)
14	6, 8, 10, 11, 13	letrd 10194	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ≤ 𝐵)
15	14	3expia 1267	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑥 ≤ 𝐴 → 𝑥 ≤ 𝐵))
16	15	ss2rabdv 3683	. . 3 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ⊆ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵})
17		sspreima 29447	. . 3 ⊢ ((Fun 𝑋 ∧ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ⊆ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}) → (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}) ⊆ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
18	5, 16, 17	syl2anc 693	. 2 ⊢ (𝜑 → (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}) ⊆ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
19	1, 2, 7	orrvcval4 30526	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐴) = (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}))
20	1, 2, 9	orrvcval4 30526	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐵) = (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
21	18, 19, 20	3sstr4d 3648	1 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐴) ⊆ (𝑋∘_RV/𝑐 ≤ 𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1037 ∈ wcel 1990 {crab 2916 ⊆ wss 3574 class class class wbr 4653 ^◡ccnv 5113 dom cdm 5114 “ cima 5117 Fun wfun 5882 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ℝcr 9935 ≤ cle 10075 Probcprb 30469 rRndVarcrrv 30502 ∘_RV/𝑐corvc 30517

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-pre-lttri 10010 ax-pre-lttrn 10011

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-po 5035 df-so 5036 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-1st 7168 df-2nd 7169 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-ioo 12179 df-topgen 16104 df-top 20699 df-bases 20750 df-esum 30090 df-siga 30171 df-sigagen 30202 df-brsiga 30245 df-meas 30259 df-mbfm 30313 df-prob 30470 df-rrv 30503 df-orvc 30518

This theorem is referenced by: dstfrvinc 30538 dstfrvclim1 30539

W3C validator