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 32442

Description: Preimage maps produced by the "less than or equal to" 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 32415	. . . 4 ⊢ (𝜑 → 𝑋:dom 𝑋⟶ℝ)
4	3	ffund 6604	. . 3 ⊢ (𝜑 → Fun 𝑋)
5		simp2 1136	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ∈ ℝ)
6		orvclteinc.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ)
7	6	3ad2ant1 1132	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐴 ∈ ℝ)
8		orvclteinc.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ)
9	8	3ad2ant1 1132	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐵 ∈ ℝ)
10		simp3 1137	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ≤ 𝐴)
11		orvclteinc.3	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
12	11	3ad2ant1 1132	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐴 ≤ 𝐵)
13	5, 7, 9, 10, 12	letrd 11132	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ≤ 𝐵)
14	13	3expia 1120	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑥 ≤ 𝐴 → 𝑥 ≤ 𝐵))
15	14	ss2rabdv 4009	. . 3 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ⊆ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵})
16		sspreima 6945	. . 3 ⊢ ((Fun 𝑋 ∧ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ⊆ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}) → (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}) ⊆ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
17	4, 15, 16	syl2anc 584	. 2 ⊢ (𝜑 → (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}) ⊆ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
18	1, 2, 6	orrvcval4 32431	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐴) = (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}))
19	1, 2, 8	orrvcval4 32431	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐵) = (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
20	17, 18, 19	3sstr4d 3968	1 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐴) ⊆ (𝑋∘_RV/𝑐 ≤ 𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1086 ∈ wcel 2106 {crab 3068 ⊆ wss 3887 class class class wbr 5074 ^◡ccnv 5588 dom cdm 5589 “ cima 5592 Fun wfun 6427 ‘cfv 6433 (class class class)co 7275 ℝcr 10870 ≤ cle 11010 Probcprb 32374 rRndVarcrrv 32407 ∘_RV/𝑐corvc 32422

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-pre-lttri 10945 ax-pre-lttrn 10946

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-po 5503 df-so 5504 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-1st 7831 df-2nd 7832 df-er 8498 df-map 8617 df-en 8734 df-dom 8735 df-sdom 8736 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-ioo 13083 df-topgen 17154 df-top 22043 df-bases 22096 df-esum 31996 df-siga 32077 df-sigagen 32107 df-brsiga 32150 df-meas 32164 df-mbfm 32218 df-prob 32375 df-rrv 32408 df-orvc 32423

This theorem is referenced by: dstfrvinc 32443 dstfrvclim1 32444

W3C validator