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 34995

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 34967	. . . 4 ⊢ (𝜑 → 𝑋:dom 𝑋⟶ℝ)
4	3	ffund 6711	. . 3 ⊢ (𝜑 → Fun 𝑋)
5		simp2 1155	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ∈ ℝ)
6		orvclteinc.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ)
7	6	3ad2ant1 1151	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐴 ∈ ℝ)
8		orvclteinc.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ)
9	8	3ad2ant1 1151	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐵 ∈ ℝ)
10		simp3 1156	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ≤ 𝐴)
11		orvclteinc.3	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
12	11	3ad2ant1 1151	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝐴 ≤ 𝐵)
13	5, 7, 9, 10, 12	letrd 11395	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ ∧ 𝑥 ≤ 𝐴) → 𝑥 ≤ 𝐵)
14	13	3expia 1139	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑥 ≤ 𝐴 → 𝑥 ≤ 𝐵))
15	14	ss2rabdv 4026	. . 3 ⊢ (𝜑 → {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ⊆ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵})
16		sspreima 7064	. . 3 ⊢ ((Fun 𝑋 ∧ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ⊆ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}) → (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}) ⊆ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
17	4, 15, 16	syl2anc 596	. 2 ⊢ (𝜑 → (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}) ⊆ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
18	1, 2, 6	orrvcval4 34984	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐴) = (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}))
19	1, 2, 8	orrvcval4 34984	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐵) = (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐵}))
20	17, 18, 19	3sstr4d 3989	1 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐴) ⊆ (𝑋∘_RV/𝑐 ≤ 𝐵))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 ∈ wcel 2145 {crab 3414 ⊆ wss 3902 class class class wbr 5107 ^◡ccnv 5658 dom cdm 5659 “ cima 5662 Fun wfun 6531 ‘cfv 6537 (class class class)co 7417 ℝcr 11127 ≤ cle 11272 Probcprb 34926 rRndVarcrrv 34959 ∘_RV/𝑐corvc 34975

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-pre-lttri 11202 ax-pre-lttrn 11203

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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-er 8700 df-map 8832 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-ioo 13406 df-topgen 17534 df-top 23125 df-bases 23177 df-esum 34546 df-siga 34627 df-sigagen 34658 df-brsiga 34701 df-meas 34715 df-mbfm 34769 df-prob 34927 df-rrv 34960 df-orvc 34976

This theorem is used by: dstfrvinc 34996 dstfrvclim1 34997

W3C validator