orvccel - Mathbox for Thierry Arnoux

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

Theorem orvccel 31123

Description: If the relation produces closed sets, preimage maps by a measurable function are measurable sets. (Contributed by Thierry Arnoux, 21-Jan-2017.)

**Hypotheses**
Ref	Expression
orvccel.1	⊢ (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra)
orvccel.2	⊢ (𝜑 → 𝐽 ∈ Top)
orvccel.3	⊢ (𝜑 → 𝑋 ∈ (𝑆MblFnM(sigaGen‘𝐽)))
orvccel.4	⊢ (𝜑 → 𝐴 ∈ 𝑉)
orvccel.5	⊢ (𝜑 → {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} ∈ (Clsd‘𝐽))

**Assertion**
Ref	Expression
orvccel	⊢ (𝜑 → (𝑋∘_RV/𝑐𝑅𝐴) ∈ 𝑆)

Distinct variable groups: 𝑦,𝐴 𝑦,𝑅 𝑦,𝑋 𝑦,𝐽 Allowed substitution hints: 𝜑(𝑦) 𝑆(𝑦) 𝑉(𝑦)

**Proof of Theorem orvccel**
Step	Hyp	Ref	Expression
1		orvccel.1	. . 3 ⊢ (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra)
2		orvccel.2	. . 3 ⊢ (𝜑 → 𝐽 ∈ Top)
3		orvccel.3	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑆MblFnM(sigaGen‘𝐽)))
4		orvccel.4	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5	1, 2, 3, 4	orvcval4 31121	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐𝑅𝐴) = (^◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}))
6	2	sgsiga 30803	. . 3 ⊢ (𝜑 → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
7		cldssbrsiga 30848	. . . . 5 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) ⊆ (sigaGen‘𝐽))
8	2, 7	syl 17	. . . 4 ⊢ (𝜑 → (Clsd‘𝐽) ⊆ (sigaGen‘𝐽))
9		orvccel.5	. . . 4 ⊢ (𝜑 → {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} ∈ (Clsd‘𝐽))
10	8, 9	sseldd 3822	. . 3 ⊢ (𝜑 → {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} ∈ (sigaGen‘𝐽))
11	1, 6, 3, 10	mbfmcnvima 30917	. 2 ⊢ (𝜑 → (^◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}) ∈ 𝑆)
12	5, 11	eqeltrd 2859	1 ⊢ (𝜑 → (𝑋∘_RV/𝑐𝑅𝐴) ∈ 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∈ wcel 2107 {crab 3094 ⊆ wss 3792 ∪ cuni 4671 class class class wbr 4886 ^◡ccnv 5354 ran crn 5356 “ cima 5358 ‘cfv 6135 (class class class)co 6922 Topctop 21105 Clsdccld 21228 sigAlgebracsiga 30768 sigaGencsigagen 30799 MblFnMcmbfm 30910 ∘_RV/𝑐corvc 31116

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5006 ax-sep 5017 ax-nul 5025 ax-pow 5077 ax-pr 5138 ax-un 7226 ax-inf2 8835 ax-ac2 9620

This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-fal 1615 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4672 df-int 4711 df-iun 4755 df-iin 4756 df-br 4887 df-opab 4949 df-mpt 4966 df-tr 4988 df-id 5261 df-eprel 5266 df-po 5274 df-so 5275 df-fr 5314 df-se 5315 df-we 5316 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-rn 5366 df-res 5367 df-ima 5368 df-pred 5933 df-ord 5979 df-on 5980 df-lim 5981 df-suc 5982 df-iota 6099 df-fun 6137 df-fn 6138 df-f 6139 df-f1 6140 df-fo 6141 df-f1o 6142 df-fv 6143 df-isom 6144 df-riota 6883 df-ov 6925 df-oprab 6926 df-mpt2 6927 df-om 7344 df-1st 7445 df-2nd 7446 df-wrecs 7689 df-recs 7751 df-rdg 7789 df-1o 7843 df-2o 7844 df-oadd 7847 df-er 8026 df-map 8142 df-en 8242 df-dom 8243 df-sdom 8244 df-fin 8245 df-oi 8704 df-card 9098 df-acn 9101 df-ac 9272 df-cda 9325 df-top 21106 df-cld 21231 df-siga 30769 df-sigagen 30800 df-mbfm 30911 df-orvc 31117

This theorem is referenced by: orrvccel 31127

W3C validator