Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > isanmbfm | Structured version Visualization version GIF version |
Description: The predicate to be a measurable function. (Contributed by Thierry Arnoux, 30-Jan-2017.) |
Ref | Expression |
---|---|
mbfmf.1 | ⊢ (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra) |
mbfmf.2 | ⊢ (𝜑 → 𝑇 ∈ ∪ ran sigAlgebra) |
mbfmf.3 | ⊢ (𝜑 → 𝐹 ∈ (𝑆MblFnM𝑇)) |
Ref | Expression |
---|---|
isanmbfm | ⊢ (𝜑 → 𝐹 ∈ ∪ ran MblFnM) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mbfmf.1 | . . 3 ⊢ (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra) | |
2 | mbfmf.2 | . . 3 ⊢ (𝜑 → 𝑇 ∈ ∪ ran sigAlgebra) | |
3 | mbfmf.3 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑆MblFnM𝑇)) | |
4 | 1, 2 | ismbfm 29641 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ (𝑆MblFnM𝑇) ↔ (𝐹 ∈ (∪ 𝑇 ↑𝑚 ∪ 𝑆) ∧ ∀𝑥 ∈ 𝑇 (◡𝐹 “ 𝑥) ∈ 𝑆))) |
5 | 3, 4 | mpbid 221 | . . 3 ⊢ (𝜑 → (𝐹 ∈ (∪ 𝑇 ↑𝑚 ∪ 𝑆) ∧ ∀𝑥 ∈ 𝑇 (◡𝐹 “ 𝑥) ∈ 𝑆)) |
6 | unieq 4380 | . . . . . . 7 ⊢ (𝑠 = 𝑆 → ∪ 𝑠 = ∪ 𝑆) | |
7 | 6 | oveq2d 6565 | . . . . . 6 ⊢ (𝑠 = 𝑆 → (∪ 𝑡 ↑𝑚 ∪ 𝑠) = (∪ 𝑡 ↑𝑚 ∪ 𝑆)) |
8 | 7 | eleq2d 2673 | . . . . 5 ⊢ (𝑠 = 𝑆 → (𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑠) ↔ 𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑆))) |
9 | eleq2 2677 | . . . . . 6 ⊢ (𝑠 = 𝑆 → ((◡𝐹 “ 𝑥) ∈ 𝑠 ↔ (◡𝐹 “ 𝑥) ∈ 𝑆)) | |
10 | 9 | ralbidv 2969 | . . . . 5 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠 ↔ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑆)) |
11 | 8, 10 | anbi12d 743 | . . . 4 ⊢ (𝑠 = 𝑆 → ((𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑠) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠) ↔ (𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑆) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑆))) |
12 | unieq 4380 | . . . . . . 7 ⊢ (𝑡 = 𝑇 → ∪ 𝑡 = ∪ 𝑇) | |
13 | 12 | oveq1d 6564 | . . . . . 6 ⊢ (𝑡 = 𝑇 → (∪ 𝑡 ↑𝑚 ∪ 𝑆) = (∪ 𝑇 ↑𝑚 ∪ 𝑆)) |
14 | 13 | eleq2d 2673 | . . . . 5 ⊢ (𝑡 = 𝑇 → (𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑆) ↔ 𝐹 ∈ (∪ 𝑇 ↑𝑚 ∪ 𝑆))) |
15 | raleq 3115 | . . . . 5 ⊢ (𝑡 = 𝑇 → (∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑆 ↔ ∀𝑥 ∈ 𝑇 (◡𝐹 “ 𝑥) ∈ 𝑆)) | |
16 | 14, 15 | anbi12d 743 | . . . 4 ⊢ (𝑡 = 𝑇 → ((𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑆) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑆) ↔ (𝐹 ∈ (∪ 𝑇 ↑𝑚 ∪ 𝑆) ∧ ∀𝑥 ∈ 𝑇 (◡𝐹 “ 𝑥) ∈ 𝑆))) |
17 | 11, 16 | rspc2ev 3295 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝑇 ∈ ∪ ran sigAlgebra ∧ (𝐹 ∈ (∪ 𝑇 ↑𝑚 ∪ 𝑆) ∧ ∀𝑥 ∈ 𝑇 (◡𝐹 “ 𝑥) ∈ 𝑆)) → ∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra(𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑠) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠)) |
18 | 1, 2, 5, 17 | syl3anc 1318 | . 2 ⊢ (𝜑 → ∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra(𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑠) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠)) |
19 | elunirnmbfm 29642 | . 2 ⊢ (𝐹 ∈ ∪ ran MblFnM ↔ ∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra(𝐹 ∈ (∪ 𝑡 ↑𝑚 ∪ 𝑠) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠)) | |
20 | 18, 19 | sylibr 223 | 1 ⊢ (𝜑 → 𝐹 ∈ ∪ ran MblFnM) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ∃wrex 2897 ∪ cuni 4372 ◡ccnv 5037 ran crn 5039 “ cima 5041 (class class class)co 6549 ↑𝑚 cmap 7744 sigAlgebracsiga 29497 MblFnMcmbfm 29639 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-mbfm 29640 |
This theorem is referenced by: mbfmbfm 29647 orvcval4 29849 |
Copyright terms: Public domain | W3C validator |