dstfrvel - Mathbox for Thierry Arnoux

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

Theorem dstfrvel 34732

Description: Elementhood of preimage maps produced by the "less than or equal to" relation. (Contributed by Thierry Arnoux, 13-Feb-2017.)

**Hypotheses**
Ref	Expression
dstfrv.1	⊢ (𝜑 → 𝑃 ∈ Prob)
dstfrv.2	⊢ (𝜑 → 𝑋 ∈ (rRndVar‘𝑃))
orvclteel.1	⊢ (𝜑 → 𝐴 ∈ ℝ)
dstfrvel.1	⊢ (𝜑 → 𝐵 ∈ ∪ dom 𝑃)
dstfrvel.2	⊢ (𝜑 → (𝑋‘𝐵) ≤ 𝐴)

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

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

Step	Hyp	Ref	Expression
1		dstfrv.1	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ Prob)
2		dstfrv.2	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ (rRndVar‘𝑃))
3	1, 2	rrvvf 34702	. . . . 5 ⊢ (𝜑 → 𝑋:∪ dom 𝑃⟶ℝ)
4		dstfrvel.1	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ∪ dom 𝑃)
5	3, 4	ffvelcdmd 7062	. . . 4 ⊢ (𝜑 → (𝑋‘𝐵) ∈ ℝ)
6		dstfrvel.2	. . . 4 ⊢ (𝜑 → (𝑋‘𝐵) ≤ 𝐴)
7		breq1 5102	. . . . 5 ⊢ (𝑥 = (𝑋‘𝐵) → (𝑥 ≤ 𝐴 ↔ (𝑋‘𝐵) ≤ 𝐴))
8	7	elrab 3650	. . . 4 ⊢ ((𝑋‘𝐵) ∈ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ↔ ((𝑋‘𝐵) ∈ ℝ ∧ (𝑋‘𝐵) ≤ 𝐴))
9	5, 6, 8	sylanbrc 592	. . 3 ⊢ (𝜑 → (𝑋‘𝐵) ∈ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴})
10	3	ffund 6692	. . . 4 ⊢ (𝜑 → Fun 𝑋)
11	1, 2	rrvdm 34704	. . . . 5 ⊢ (𝜑 → dom 𝑋 = ∪ dom 𝑃)
12	4, 11	eleqtrrd 2864	. . . 4 ⊢ (𝜑 → 𝐵 ∈ dom 𝑋)
13		fvimacnv 7030	. . . 4 ⊢ ((Fun 𝑋 ∧ 𝐵 ∈ dom 𝑋) → ((𝑋‘𝐵) ∈ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ↔ 𝐵 ∈ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴})))
14	10, 12, 13	syl2anc 593	. . 3 ⊢ (𝜑 → ((𝑋‘𝐵) ∈ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴} ↔ 𝐵 ∈ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴})))
15	9, 14	mpbid 234	. 2 ⊢ (𝜑 → 𝐵 ∈ (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}))
16		orvclteel.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ)
17	1, 2, 16	orrvcval4 34723	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐 ≤ 𝐴) = (^◡𝑋 “ {𝑥 ∈ ℝ ∣ 𝑥 ≤ 𝐴}))
18	15, 17	eleqtrrd 2864	1 ⊢ (𝜑 → 𝐵 ∈ (𝑋∘_RV/𝑐 ≤ 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∈ wcel 2141 {crab 3413 ∪ cuni 4864 class class class wbr 5099 ^◡ccnv 5644 dom cdm 5645 “ cima 5648 Fun wfun 6511 ‘cfv 6517 (class class class)co 7392 ℝcr 11069 ≤ cle 11214 Probcprb 34665 rRndVarcrrv 34698 ∘_RV/𝑐corvc 34714

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-pre-lttri 11144 ax-pre-lttrn 11145

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-po 5553 df-so 5554 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-oprab 7396 df-mpo 7397 df-1st 7966 df-2nd 7967 df-er 8673 df-map 8805 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-ioo 13350 df-topgen 17455 df-top 22934 df-bases 22986 df-esum 34286 df-siga 34367 df-sigagen 34397 df-brsiga 34440 df-meas 34454 df-mbfm 34508 df-prob 34666 df-rrv 34699 df-orvc 34715

This theorem is referenced by: dstfrvunirn 34733

W3C validator