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 32329

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 32327	. 2 ⊢ (𝜑 → (𝑋∘_RV/𝑐𝑅𝐴) = (^◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}))
6	2	sgsiga 32010	. . 3 ⊢ (𝜑 → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
7		cldssbrsiga 32055	. . . . 5 ⊢ (𝐽 ∈ Top → (Clsd‘𝐽) ⊆ (sigaGen‘𝐽))
8	2, 7	syl 17	. . . 4 ⊢ (𝜑 → (Clsd‘𝐽) ⊆ (sigaGen‘𝐽))
9		orvccel.5	. . . 4 ⊢ (𝜑 → {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} ∈ (Clsd‘𝐽))
10	8, 9	sseldd 3918	. . 3 ⊢ (𝜑 → {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} ∈ (sigaGen‘𝐽))
11	1, 6, 3, 10	mbfmcnvima 32124	. 2 ⊢ (𝜑 → (^◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}) ∈ 𝑆)
12	5, 11	eqeltrd 2839	1 ⊢ (𝜑 → (𝑋∘_RV/𝑐𝑅𝐴) ∈ 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∈ wcel 2108 {crab 3067 ⊆ wss 3883 ∪ cuni 4836 class class class wbr 5070 ^◡ccnv 5579 ran crn 5581 “ cima 5583 ‘cfv 6418 (class class class)co 7255 Topctop 21950 Clsdccld 22075 sigAlgebracsiga 31976 sigaGencsigagen 32006 MblFnMcmbfm 32117 ∘_RV/𝑐corvc 32322

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-ac2 10150

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-iin 4924 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-oi 9199 df-dju 9590 df-card 9628 df-acn 9631 df-ac 9803 df-top 21951 df-cld 22078 df-siga 31977 df-sigagen 32007 df-mbfm 32118 df-orvc 32323

This theorem is referenced by: orrvccel 32333

W3C validator